From 4442d04a34aa2d5b25a1c7d64755282a88f57a55 Mon Sep 17 00:00:00 2001 From: "huangge1199@hotmail.com" Date: Tue, 21 Sep 2021 19:50:08 +0800 Subject: [PATCH] =?UTF-8?q?58:=E6=9C=80=E5=90=8E=E4=B8=80=E4=B8=AA?= =?UTF-8?q?=E5=8D=95=E8=AF=8D=E7=9A=84=E9=95=BF=E5=BA=A6?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../leetcode/editor/cn/LengthOfLastWord.java | 67 +++++++++++++++++++ src/main/java/leetcode/editor/cn/doc/all.json | 2 +- .../editor/cn/doc/content/LengthOfLastWord.md | 37 ++++++++++ 3 files changed, 105 insertions(+), 1 deletion(-) create mode 100644 src/main/java/leetcode/editor/cn/LengthOfLastWord.java create mode 100644 src/main/java/leetcode/editor/cn/doc/content/LengthOfLastWord.md diff --git a/src/main/java/leetcode/editor/cn/LengthOfLastWord.java b/src/main/java/leetcode/editor/cn/LengthOfLastWord.java new file mode 100644 index 0000000..5307d0e --- /dev/null +++ b/src/main/java/leetcode/editor/cn/LengthOfLastWord.java @@ -0,0 +1,67 @@ +//给你一个字符串 s，由若干单词组成，单词前后用一些空格字符隔开。返回字符串中最后一个单词的长度。 +// +// 单词 是指仅由字母组成、不包含任何空格字符的最大子字符串。 +// +// +// +// 示例 1： +// +// +//输入：s = "Hello World" +//输出：5 +// +// +// 示例 2： +// +// +//输入：s = " fly me to the moon " +//输出：4 +// +// +// 示例 3： +// +// +//输入：s = "luffy is still joyboy" +//输出：6 +// +// +// +// +// 提示： +// +// +// 1 <= s.length <= 10⁴ +// s 仅有英文字母和空格 ' ' 组成 +// s 中至少存在一个单词 +// +// Related Topics 字符串 👍 373 👎 0 + +package leetcode.editor.cn; + +//58:最后一个单词的长度 +class LengthOfLastWord { + public static void main(String[] args) { + //测试代码 + Solution solution = new LengthOfLastWord().new Solution(); + } + + //力扣代码 + //leetcode submit region begin(Prohibit modification and deletion) + class Solution { + public int lengthOfLastWord(String s) { + int size = s.length(); + int count = 0; + for (int i = size - 1; i >= 0; i--) { + if (" ".equals("" + s.charAt(i)) && count > 0) { + break; + } + if (!" ".equals("" + s.charAt(i))) { + count++; + } + } + return count; + } + } +//leetcode submit region end(Prohibit modification and deletion) + +} \ No newline at end of file diff --git a/src/main/java/leetcode/editor/cn/doc/all.json b/src/main/java/leetcode/editor/cn/doc/all.json index 20b086f..0f6c32d 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.7068052635677022,"acs":108930,"articleLive":2,"columnArticles":732,"formTitle":"[292]Nim 游戏","frequency":1.7959518731,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"","submitted":154116,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.5199697577468645,"acs":2491680,"articleLive":2,"columnArticles":14120,"formTitle":"[1]两数之和","frequency":4.7730779814,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4791971,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.40850042987036556,"acs":994951,"articleLive":2,"columnArticles":7082,"formTitle":"[2]两数相加","frequency":4.73801695,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2435618,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.380065426558657,"acs":1229425,"articleLive":2,"columnArticles":7335,"formTitle":"[3]无重复字符的最长子串","frequency":4.5766059286,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3234772,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.40812711329470935,"acs":507553,"articleLive":2,"columnArticles":3787,"formTitle":"[4]寻找两个正序数组的中位数","frequency":4.5834236601,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1243615,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35412225609430403,"acs":729273,"articleLive":2,"columnArticles":3943,"formTitle":"[5]最长回文子串","frequency":4.667894887,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2059382,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5066885490086389,"acs":300708,"articleLive":2,"columnArticles":2426,"formTitle":"[6]Z 字形变换","frequency":3.7534921882,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":593477,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3531298025015223,"acs":828136,"articleLive":2,"columnArticles":5225,"formTitle":"[7]整数反转","frequency":4.7029559185,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2345132,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21712274386003003,"acs":344021,"articleLive":2,"columnArticles":2659,"formTitle":"[8]字符串转换整数 (atoi)","frequency":3.5412922228,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1584454,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.584511000666243,"acs":763272,"articleLive":2,"columnArticles":4885,"formTitle":"[9]回文数","frequency":3.8862027722,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1305830,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3162236637437929,"acs":202891,"articleLive":2,"columnArticles":1226,"formTitle":"[10]正则表达式匹配","frequency":4.147837812,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":641606,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6293057131979605,"acs":530601,"articleLive":2,"columnArticles":2988,"formTitle":"[11]盛最多水的容器","frequency":4.2497277099,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":843153,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6649439551759739,"acs":224773,"articleLive":2,"columnArticles":1749,"formTitle":"[12]整数转罗马数字","frequency":3.6499345022,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":338033,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6323704315647893,"acs":463107,"articleLive":2,"columnArticles":3852,"formTitle":"[13]罗马数字转整数","frequency":4.0451344144,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":732335,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4085370327891285,"acs":618005,"articleLive":2,"columnArticles":3849,"formTitle":"[14]最长公共前缀","frequency":4.4622041852,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1512727,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3350526162529545,"acs":648948,"articleLive":2,"columnArticles":3040,"formTitle":"[15]三数之和","frequency":4.4755401166,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":1936854,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4594249452001776,"acs":257589,"articleLive":2,"columnArticles":1412,"formTitle":"[16]最接近的三数之和","frequency":4.0829962872,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":560677,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5722678318455683,"acs":335286,"articleLive":2,"columnArticles":3026,"formTitle":"[17]电话号码的字母组合","frequency":3.5373640251,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":585890,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.3998252824995568,"acs":218772,"articleLive":2,"columnArticles":1491,"formTitle":"[18]四数之和","frequency":3.0735788968,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":547169,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.42878442060321226,"acs":508176,"articleLive":2,"columnArticles":3797,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":3.5177471815,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1185155,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4448364232819326,"acs":773462,"articleLive":2,"columnArticles":5496,"formTitle":"[20]有效的括号","frequency":4.5415448971,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1738756,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6671542430991672,"acs":704222,"articleLive":2,"columnArticles":3422,"formTitle":"[21]合并两个有序链表","frequency":4.2009764613,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1055561,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7725301215566205,"acs":346428,"articleLive":2,"columnArticles":2603,"formTitle":"[22]括号生成","frequency":4.4318777682,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":448433,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5593632825333804,"acs":321781,"articleLive":2,"columnArticles":2080,"formTitle":"[23]合并K个升序链表","frequency":3.8162839282,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":575263,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7032406782710385,"acs":312703,"articleLive":2,"columnArticles":2483,"formTitle":"[24]两两交换链表中的节点","frequency":2.7008707325,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":444660,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6572228689915611,"acs":226943,"articleLive":2,"columnArticles":2160,"formTitle":"[25]K 个一组翻转链表","frequency":4.2568959077,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":345306,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5398062051729273,"acs":802823,"articleLive":2,"columnArticles":4471,"formTitle":"[26]删除有序数组中的重复项","frequency":3.99609774,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1487243,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5978985635862635,"acs":474976,"articleLive":2,"columnArticles":4028,"formTitle":"[27]移除元素","frequency":3.6961235564,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":794409,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40643471675887166,"acs":463716,"articleLive":2,"columnArticles":3193,"formTitle":"[28]实现 strStr()","frequency":3.6004348729,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1140936,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.20771583022195753,"acs":108819,"articleLive":2,"columnArticles":877,"formTitle":"[29]两数相除","frequency":3.1798867511,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","submitted":523884,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.35751796698254634,"acs":78699,"articleLive":2,"columnArticles":580,"formTitle":"[30]串联所有单词的子串","frequency":2.480720788,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":220126,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3731309382109126,"acs":211913,"articleLive":2,"columnArticles":1721,"formTitle":"[31]下一个排列","frequency":3.8258921918,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":567932,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3566162776406969,"acs":188609,"articleLive":2,"columnArticles":1285,"formTitle":"[32]最长有效括号","frequency":3.7618602044,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":528885,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4266360135857482,"acs":360760,"articleLive":2,"columnArticles":2382,"formTitle":"[33]搜索旋转排序数组","frequency":3.3771731777,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":845592,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.42375312962510053,"acs":336132,"articleLive":2,"columnArticles":3231,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":3.3791045004,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":793226,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4642341898475635,"acs":498445,"articleLive":2,"columnArticles":3881,"formTitle":"[35]搜索插入位置","frequency":3.53597391,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1073693,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6408287136844266,"acs":199754,"articleLive":2,"columnArticles":1415,"formTitle":"[36]有效的数独","frequency":1.9569937295,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":311712,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6706554585652463,"acs":99648,"articleLive":2,"columnArticles":841,"formTitle":"[37]解数独","frequency":2.9418965031,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":148583,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5801505421195615,"acs":214191,"articleLive":2,"columnArticles":2260,"formTitle":"[38]外观数列","frequency":2.9576622404,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":369199,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7273073192404723,"acs":330671,"articleLive":2,"columnArticles":1931,"formTitle":"[39]组合总和","frequency":3.5799839065,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":454651,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6248202587010591,"acs":197710,"articleLive":2,"columnArticles":1371,"formTitle":"[40]组合总和 II","frequency":3.3424233296,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":316427,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4195088676671214,"acs":162975,"articleLive":2,"columnArticles":1402,"formTitle":"[41]缺失的第一个正数","frequency":4.1899010778,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":388490,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5788807338785816,"acs":320062,"articleLive":2,"columnArticles":2394,"formTitle":"[42]接雨水","frequency":4.5106011481,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":552898,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.44902347392821934,"acs":168523,"articleLive":2,"columnArticles":1126,"formTitle":"[43]字符串相乘","frequency":3.9610095835,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":375310,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.3280588978627548,"acs":83594,"articleLive":2,"columnArticles":543,"formTitle":"[44]通配符匹配","frequency":2.8381766769,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":254814,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4278866276028042,"acs":196287,"articleLive":2,"columnArticles":1582,"formTitle":"[45]跳跃游戏 II","frequency":4.5977728241,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":458736,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7827216751087427,"acs":415680,"articleLive":2,"columnArticles":2652,"formTitle":"[46]全排列","frequency":4.5308809731,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":531070,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6372796876265193,"acs":212499,"articleLive":2,"columnArticles":1461,"formTitle":"[47]全排列 II","frequency":3.1439504372,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":333447,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7350740253110137,"acs":218858,"articleLive":2,"columnArticles":1853,"formTitle":"[48]旋转图像","frequency":3.4619255715,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":297736,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.664572632839671,"acs":230830,"articleLive":2,"columnArticles":1300,"formTitle":"[49]字母异位词分组","frequency":3.218579448,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":347336,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37660585862129453,"acs":214703,"articleLive":2,"columnArticles":1274,"formTitle":"[50]Pow(x, n)","frequency":3.258739177,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":570100,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7391662042040288,"acs":151841,"articleLive":2,"columnArticles":1521,"formTitle":"[51]N 皇后","frequency":3.2903146416,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":205422,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8229752641447996,"acs":73295,"articleLive":2,"columnArticles":595,"formTitle":"[52]N皇后 II","frequency":1.5093166755,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":89061,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5519964540622941,"acs":666268,"articleLive":2,"columnArticles":3731,"formTitle":"[53]最大子序和","frequency":3.8318419403,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1207015,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.48066304018409794,"acs":187150,"articleLive":2,"columnArticles":1984,"formTitle":"[54]螺旋矩阵","frequency":3.8977868078,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":389358,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43235698083225205,"acs":318881,"articleLive":2,"columnArticles":2451,"formTitle":"[55]跳跃游戏","frequency":3.4301373078,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":737541,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.46824408860707634,"acs":297158,"articleLive":2,"columnArticles":2278,"formTitle":"[56]合并区间","frequency":4.0688862435,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":634622,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4109478064120264,"acs":85727,"articleLive":2,"columnArticles":924,"formTitle":"[57]插入区间","frequency":1.887729068,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":208608,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.3565640168284078,"acs":220527,"articleLive":2,"columnArticles":2385,"formTitle":"[58]最后一个单词的长度","frequency":2.7976237305,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"","submitted":618478,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7916558381876613,"acs":124894,"articleLive":2,"columnArticles":1551,"formTitle":"[59]螺旋矩阵 II","frequency":3.245006973,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":157763,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.523943414462701,"acs":89445,"articleLive":2,"columnArticles":946,"formTitle":"[60]排列序列","frequency":1.9853993508,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":170715,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4177969910330216,"acs":195224,"articleLive":2,"columnArticles":1975,"formTitle":"[61]旋转链表","frequency":3.198787154,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":467270,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6612919737919738,"acs":310056,"articleLive":2,"columnArticles":2392,"formTitle":"[62]不同路径","frequency":3.1620800128,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":468864,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3908226021145094,"acs":179395,"articleLive":2,"columnArticles":1693,"formTitle":"[63]不同路径 II","frequency":3.2258771525,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":459019,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6881639494370252,"acs":266049,"articleLive":2,"columnArticles":2058,"formTitle":"[64]最小路径和","frequency":3.4638825767,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":386607,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2694025716878617,"acs":45716,"articleLive":2,"columnArticles":633,"formTitle":"[65]有效数字","frequency":2.1710177204,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":169694,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.4580861217387617,"acs":345664,"articleLive":2,"columnArticles":3141,"formTitle":"[66]加一","frequency":2.9418965031,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":754583,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5434213126323219,"acs":192507,"articleLive":2,"columnArticles":1756,"formTitle":"[67]二进制求和","frequency":2.7121631421,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":354250,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5247230706433769,"acs":37280,"articleLive":2,"columnArticles":567,"formTitle":"[68]文本左右对齐","frequency":2.0725794045,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":71047,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39255440725484875,"acs":381968,"articleLive":2,"columnArticles":1912,"formTitle":"[69]x 的平方根","frequency":3.6328927504,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":973032,"title":"x 的平方根","titleSlug":"sqrtx"},{"acceptance":0.5291767103249744,"acs":565075,"articleLive":2,"columnArticles":3533,"formTitle":"[70]爬楼梯","frequency":4.3652411104,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1067838,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.4213777518126526,"acs":93044,"articleLive":2,"columnArticles":820,"formTitle":"[71]简化路径","frequency":2.8278779247,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":220809,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6137860155225573,"acs":173192,"articleLive":2,"columnArticles":1220,"formTitle":"[72]编辑距离","frequency":4.4260756532,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":282170,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6033653291758726,"acs":130809,"articleLive":2,"columnArticles":956,"formTitle":"[73]矩阵置零","frequency":2.0869062971,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":216799,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.460009187914866,"acs":167223,"articleLive":2,"columnArticles":1678,"formTitle":"[74]搜索二维矩阵","frequency":3.5022157733,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":363521,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.595244722593853,"acs":265172,"articleLive":2,"columnArticles":1830,"formTitle":"[75]颜色分类","frequency":2.6322739853,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":445484,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.42581204796680305,"acs":181628,"articleLive":2,"columnArticles":1242,"formTitle":"[76]最小覆盖子串","frequency":3.7140179231,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":426545,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7700666540657554,"acs":215929,"articleLive":2,"columnArticles":1266,"formTitle":"[77]组合","frequency":3.5482045334,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":280403,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8009849761284779,"acs":308529,"articleLive":2,"columnArticles":2021,"formTitle":"[78]子集","frequency":3.3874455628,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":385187,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45842377952070257,"acs":221112,"articleLive":2,"columnArticles":1388,"formTitle":"[79]单词搜索","frequency":3.4467932558,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":482331,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6163555518268383,"acs":146933,"articleLive":2,"columnArticles":1317,"formTitle":"[80]删除有序数组中的重复项 II","frequency":3.1798867511,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":238390,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4154700984614345,"acs":123002,"articleLive":2,"columnArticles":989,"formTitle":"[81]搜索旋转排序数组 II","frequency":3.4591056497,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":296055,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5299461361933865,"acs":178276,"articleLive":2,"columnArticles":1665,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":3.9317549011,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":336404,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5386775012416534,"acs":312364,"articleLive":2,"columnArticles":1913,"formTitle":"[83]删除排序链表中的重复元素","frequency":3.495158581,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":579872,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43320759235973894,"acs":180875,"articleLive":2,"columnArticles":1145,"formTitle":"[84]柱状图中最大的矩形","frequency":3.6480944399,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":417525,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5158106359543593,"acs":96470,"articleLive":2,"columnArticles":679,"formTitle":"[85]最大矩形","frequency":2.8591088907,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":187026,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6324420734475044,"acs":118433,"articleLive":2,"columnArticles":1088,"formTitle":"[86]分隔链表","frequency":2.715196941,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":187263,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48781551224340697,"acs":41397,"articleLive":2,"columnArticles":307,"formTitle":"[87]扰乱字符串","frequency":3.2258771525,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":84862,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5163290115743228,"acs":456582,"articleLive":2,"columnArticles":3195,"formTitle":"[88]合并两个有序数组","frequency":4.6328338556,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":884285,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7094442541950002,"acs":58007,"articleLive":2,"columnArticles":470,"formTitle":"[89]格雷编码","frequency":2.0988997246,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":81764,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6334950326347054,"acs":136076,"articleLive":2,"columnArticles":1192,"formTitle":"[90]子集 II","frequency":3.5279430284,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":214802,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.30652136241985484,"acs":159198,"articleLive":2,"columnArticles":1495,"formTitle":"[91]解码方法","frequency":3.4467932558,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":519370,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5480897956183686,"acs":208797,"articleLive":2,"columnArticles":2005,"formTitle":"[92]反转链表 II","frequency":3.7286891173,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":380954,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5391357703188153,"acs":151130,"articleLive":2,"columnArticles":1312,"formTitle":"[93]复原 IP 地址","frequency":3.9894326991,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":280319,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.755856192703742,"acs":553902,"articleLive":2,"columnArticles":2273,"formTitle":"[94]二叉树的中序遍历","frequency":3.1383533033,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":732814,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7010683957094472,"acs":99150,"articleLive":2,"columnArticles":611,"formTitle":"[95]不同的二叉搜索树 II","frequency":2.9722202335,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":141427,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.699190225015186,"acs":159995,"articleLive":2,"columnArticles":1265,"formTitle":"[96]不同的二叉搜索树","frequency":3.265264249,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":228829,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4569512388758251,"acs":60435,"articleLive":2,"columnArticles":536,"formTitle":"[97]交错字符串","frequency":2.1612900172,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":132257,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.3494326385140547,"acs":342466,"articleLive":2,"columnArticles":1904,"formTitle":"[98]验证二叉搜索树","frequency":3.4286092835,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":980063,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6122498865104585,"acs":70132,"articleLive":2,"columnArticles":577,"formTitle":"[99]恢复二叉搜索树","frequency":2.7185989991,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":114548,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6030593782822335,"acs":246319,"articleLive":2,"columnArticles":1860,"formTitle":"[100]相同的树","frequency":2.8212199332,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":408449,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5627067335064502,"acs":405222,"articleLive":2,"columnArticles":2229,"formTitle":"[101]对称二叉树","frequency":3.6794342505,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":720130,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6418642038091176,"acs":391274,"articleLive":2,"columnArticles":2465,"formTitle":"[102]二叉树的层序遍历","frequency":4.2951190475,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":609590,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5714674842794455,"acs":172034,"articleLive":2,"columnArticles":1568,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":3.8909997585,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":301039,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7663865013449747,"acs":507705,"articleLive":2,"columnArticles":2517,"formTitle":"[104]二叉树的最大深度","frequency":3.6663444537,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":662466,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7042999784498241,"acs":245114,"articleLive":2,"columnArticles":1407,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":4.0426691383,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":348025,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7213422671353251,"acs":131342,"articleLive":2,"columnArticles":868,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":3.512709049,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":182080,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6962236280560018,"acs":161668,"articleLive":2,"columnArticles":1297,"formTitle":"[107]二叉树的层序遍历 II","frequency":3.0693153162,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":232207,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7600231256574351,"acs":189302,"articleLive":2,"columnArticles":1173,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":2.4539726436,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":249074,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7633057471641472,"acs":93063,"articleLive":2,"columnArticles":714,"formTitle":"[109]有序链表转换二叉搜索树","frequency":2.7557285914,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":121921,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.563211667793474,"acs":253247,"articleLive":2,"columnArticles":1441,"formTitle":"[110]平衡二叉树","frequency":2.9790893359,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":449648,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4853765942043448,"acs":267509,"articleLive":2,"columnArticles":1767,"formTitle":"[111]二叉树的最小深度","frequency":2.1612900172,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":551137,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5258627560372997,"acs":263920,"articleLive":2,"columnArticles":1654,"formTitle":"[112]路径总和","frequency":3.1086713362,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":501880,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6267498218104063,"acs":175866,"articleLive":2,"columnArticles":1237,"formTitle":"[113]路径总和 II","frequency":3.0276755941,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":280600,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7254177631305878,"acs":174772,"articleLive":2,"columnArticles":1307,"formTitle":"[114]二叉树展开为链表","frequency":2.1612900172,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":240926,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5226757565795166,"acs":60414,"articleLive":2,"columnArticles":672,"formTitle":"[115]不同的子序列","frequency":2.3412192284,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":115586,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7033670522855638,"acs":154918,"articleLive":2,"columnArticles":1174,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":2.1790524736,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":220252,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.61239143102922,"acs":88275,"articleLive":2,"columnArticles":746,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":1.3775752132,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":144148,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7285123170345483,"acs":211627,"articleLive":2,"columnArticles":1709,"formTitle":"[118]杨辉三角","frequency":3.7552074839,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":290492,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6651884804935857,"acs":141451,"articleLive":2,"columnArticles":1187,"formTitle":"[119]杨辉三角 II","frequency":2.6867545118,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":212648,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.680436251327092,"acs":176250,"articleLive":2,"columnArticles":1557,"formTitle":"[120]三角形最小路径和","frequency":2.5997285636,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":259025,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5733620198801076,"acs":554843,"articleLive":2,"columnArticles":3347,"formTitle":"[121]买卖股票的最佳时机","frequency":4.1828988435,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":967701,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6887360262131056,"acs":454864,"articleLive":2,"columnArticles":2621,"formTitle":"[122]买卖股票的最佳时机 II","frequency":3.0830249595,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":660433,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5352798354418379,"acs":129853,"articleLive":2,"columnArticles":814,"formTitle":"[123]买卖股票的最佳时机 III","frequency":3.3088631331,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":242589,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4441281420757296,"acs":156950,"articleLive":2,"columnArticles":1078,"formTitle":"[124]二叉树中的最大路径和","frequency":4.0306077208,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":353389,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47353222093069447,"acs":274169,"articleLive":2,"columnArticles":1817,"formTitle":"[125]验证回文串","frequency":3.3424233296,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":578987,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3944605377930455,"acs":36630,"articleLive":2,"columnArticles":324,"formTitle":"[126]单词接龙 II","frequency":1.48824996,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":92861,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46755087848010335,"acs":122359,"articleLive":2,"columnArticles":645,"formTitle":"[127]单词接龙","frequency":2.4870014267,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":261702,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5434077651939351,"acs":167406,"articleLive":2,"columnArticles":1082,"formTitle":"[128]最长连续序列","frequency":3.9590054302,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":308067,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6813902387249643,"acs":118767,"articleLive":2,"columnArticles":1098,"formTitle":"[129]求根节点到叶节点数字之和","frequency":3.0310026092,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":174301,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44405673867971035,"acs":127006,"articleLive":2,"columnArticles":1157,"formTitle":"[130]被围绕的区域","frequency":2.4539726436,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":286013,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7230295580019537,"acs":131749,"articleLive":2,"columnArticles":849,"formTitle":"[131]分割回文串","frequency":3.4006978986,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":182218,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49222480837914845,"acs":49063,"articleLive":2,"columnArticles":436,"formTitle":"[132]分割回文串 II","frequency":2.1295748855,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":99676,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6754550748595796,"acs":71913,"articleLive":2,"columnArticles":523,"formTitle":"[133]克隆图","frequency":0.794816469,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":106466,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5767625946289053,"acs":123576,"articleLive":2,"columnArticles":960,"formTitle":"[134]加油站","frequency":3.5839023629,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":214258,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.486456583819667,"acs":97608,"articleLive":2,"columnArticles":774,"formTitle":"[135]分发糖果","frequency":4.2032684737,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":200651,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7195601895845455,"acs":492195,"articleLive":2,"columnArticles":2236,"formTitle":"[136]只出现一次的数字","frequency":3.7015255683,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":684022,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7197114932467138,"acs":99485,"articleLive":2,"columnArticles":754,"formTitle":"[137]只出现一次的数字 II","frequency":3.4704342203,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":138229,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6601856311279974,"acs":111032,"articleLive":2,"columnArticles":849,"formTitle":"[138]复制带随机指针的链表","frequency":3.1350103652,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":168183,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5138668189828564,"acs":189826,"articleLive":2,"columnArticles":1180,"formTitle":"[139]单词拆分","frequency":3.6451960552,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":369407,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.4867609016999261,"acs":52687,"articleLive":2,"columnArticles":533,"formTitle":"[140]单词拆分 II","frequency":1.5680776295,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":108240,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5122183405770334,"acs":521385,"articleLive":2,"columnArticles":2689,"formTitle":"[141]环形链表","frequency":3.7330988302,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1017896,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5520826044611704,"acs":291933,"articleLive":2,"columnArticles":1698,"formTitle":"[142]环形链表 II","frequency":3.3874455628,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":528785,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6189798609802775,"acs":124847,"articleLive":2,"columnArticles":1066,"formTitle":"[143]重排链表","frequency":4.3301800789,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":201698,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7030229168325676,"acs":406104,"articleLive":2,"columnArticles":1808,"formTitle":"[144]二叉树的前序遍历","frequency":2.3851501576,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":577654,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7496779428919207,"acs":295628,"articleLive":2,"columnArticles":1530,"formTitle":"[145]二叉树的后序遍历","frequency":3.2502983906,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":394340,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5263758106474188,"acs":229862,"articleLive":2,"columnArticles":1368,"formTitle":"[146]LRU 缓存机制","frequency":4.4362436722,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":436688,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6809514637904468,"acs":98994,"articleLive":2,"columnArticles":781,"formTitle":"[147]对链表进行插入排序","frequency":2.2634195123,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":145376,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6670850682015903,"acs":207799,"articleLive":2,"columnArticles":1231,"formTitle":"[148]排序链表","frequency":3.5373640251,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":311503,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.33903755093051424,"acs":46182,"articleLive":2,"columnArticles":507,"formTitle":"[149]直线上最多的点数","frequency":3.2008445563,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":136215,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5362295122210675,"acs":131062,"articleLive":2,"columnArticles":1035,"formTitle":"[150]逆波兰表达式求值","frequency":2.7445044991,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":244414,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.48200592868245723,"acs":166829,"articleLive":2,"columnArticles":1406,"formTitle":"[151]翻转字符串里的单词","frequency":2.5380911464,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":346114,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.4208658738886507,"acs":180639,"articleLive":2,"columnArticles":1214,"formTitle":"[152]乘积最大子数组","frequency":3.6499345022,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":429208,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5663126369057002,"acs":208377,"articleLive":2,"columnArticles":1470,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":2.5762996664,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":367954,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.532046233120451,"acs":112133,"articleLive":2,"columnArticles":888,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":3.1132012527,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":210758,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5732902248042435,"acs":283707,"articleLive":2,"columnArticles":1576,"formTitle":"[155]最小栈","frequency":3.2201112876,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":494875,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7247363048656006,"acs":6390,"articleLive":2,"columnArticles":110,"formTitle":"[156]上下翻转二叉树","frequency":1.2225136003,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"","submitted":8817,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5317160469278186,"acs":5348,"articleLive":2,"columnArticles":81,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"","submitted":10058,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5913555992141454,"acs":2709,"articleLive":2,"columnArticles":64,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.2477729518,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"","submitted":4581,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5447684512631542,"acs":15375,"articleLive":2,"columnArticles":187,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":2.0203924243,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"ac","submitted":28223,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6131390790431077,"acs":330325,"articleLive":2,"columnArticles":1941,"formTitle":"[160]相交链表","frequency":3.3220102917,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":538744,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33645536401067827,"acs":7436,"articleLive":2,"columnArticles":102,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.2750821312,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"","submitted":22101,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.4975801821015503,"acs":157716,"articleLive":2,"columnArticles":1060,"formTitle":"[162]寻找峰值","frequency":2.3710290978,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":316966,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3237712340178927,"acs":8939,"articleLive":2,"columnArticles":140,"formTitle":"[163]缺失的区间","frequency":0.8575034469,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"","submitted":27609,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6105909919291851,"acs":58632,"articleLive":2,"columnArticles":489,"formTitle":"[164]最大间距","frequency":2.7268132723,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":96025,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5186435041782387,"acs":84222,"articleLive":2,"columnArticles":903,"formTitle":"[165]比较版本号","frequency":2.6264564771,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":162389,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.29886719147061813,"acs":26462,"articleLive":2,"columnArticles":206,"formTitle":"[166]分数到小数","frequency":2.4870014267,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":88541,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5865005868508538,"acs":286329,"articleLive":2,"columnArticles":1880,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":3.1144633054,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":488199,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43236801520414997,"acs":83265,"articleLive":2,"columnArticles":742,"formTitle":"[168]Excel表列名称","frequency":2.7819821186,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":192579,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6644940695068436,"acs":381296,"articleLive":2,"columnArticles":2162,"formTitle":"[169]多数元素","frequency":3.196361249,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":573814,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.41763594790734665,"acs":8402,"articleLive":2,"columnArticles":84,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.2215934462,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"ac","submitted":20118,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.717580478305848,"acs":106128,"articleLive":2,"columnArticles":905,"formTitle":"[171]Excel 表列序号","frequency":2.0125012806,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":147897,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4387398411638236,"acs":89993,"articleLive":2,"columnArticles":591,"formTitle":"[172]阶乘后的零","frequency":2.2634195123,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","questionId":"172","status":"","submitted":205117,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8038115622432654,"acs":74359,"articleLive":2,"columnArticles":618,"formTitle":"[173]二叉搜索树迭代器","frequency":2.2344487724,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":92508,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4799720421908756,"acs":37769,"articleLive":2,"columnArticles":404,"formTitle":"[174]地下城游戏","frequency":2.9899826898,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":78690,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7397496422933613,"acs":300382,"articleLive":2,"columnArticles":1451,"formTitle":"[175]组合两个表","frequency":4.3301800789,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":406059,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3559937023339333,"acs":249401,"articleLive":2,"columnArticles":1005,"formTitle":"[176]第二高的薪水","frequency":4.2359255033,"frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","questionId":"176","status":"","submitted":700577,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46243442760881176,"acs":126412,"articleLive":2,"columnArticles":488,"formTitle":"[177]第N高的薪水","frequency":3.643509259,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":273362,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6027376168260273,"acs":117438,"articleLive":2,"columnArticles":662,"formTitle":"[178]分数排名","frequency":3.1798867511,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":194841,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4096283986362624,"acs":119548,"articleLive":2,"columnArticles":953,"formTitle":"[179]最大数","frequency":3.9684082881,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":291845,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.4869216431650927,"acs":85948,"articleLive":2,"columnArticles":500,"formTitle":"[180]连续出现的数字","frequency":3.2381623193,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":176513,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7025938688783777,"acs":160868,"articleLive":2,"columnArticles":665,"formTitle":"[181]超过经理收入的员工","frequency":3.235340647,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":228963,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7973579306769633,"acs":178420,"articleLive":2,"columnArticles":573,"formTitle":"[182]查找重复的电子邮箱","frequency":2.7835431554,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":223764,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6772322959778657,"acs":148087,"articleLive":2,"columnArticles":535,"formTitle":"[183]从不订购的客户","frequency":1.9271756905,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":218665,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47514314235130145,"acs":100909,"articleLive":2,"columnArticles":660,"formTitle":"[184]部门工资最高的员工","frequency":3.4591056497,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":212376,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49522260188822664,"acs":69711,"articleLive":2,"columnArticles":617,"formTitle":"[185]部门工资前三高的所有员工","frequency":3.4704342203,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":140767,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7549138804457953,"acs":7451,"articleLive":2,"columnArticles":111,"formTitle":"[186]翻转字符串里的单词 II","frequency":1.1262855682,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"","submitted":9870,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.4837501565221351,"acs":42496,"articleLive":2,"columnArticles":282,"formTitle":"[187]重复的DNA序列","frequency":1.4279180354,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"","submitted":87847,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3907435911045061,"acs":88344,"articleLive":2,"columnArticles":687,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":2.5365762701,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":226092,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.45151185549940637,"acs":335411,"articleLive":2,"columnArticles":1670,"formTitle":"[189]旋转数组","frequency":3.1334411712,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":742862,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.69698106734707,"acs":130026,"articleLive":2,"columnArticles":818,"formTitle":"[190]颠倒二进制位","frequency":2.4134006239,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":186556,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7481941623860152,"acs":187894,"articleLive":2,"columnArticles":1187,"formTitle":"[191]位1的个数","frequency":2.8278779247,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":251130,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3557644484233562,"acs":21459,"articleLive":2,"columnArticles":175,"formTitle":"[192]统计词频","frequency":2.7557285914,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":60318,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.324431653952974,"acs":25816,"articleLive":2,"columnArticles":140,"formTitle":"[193]有效电话号码","frequency":1.0965214663,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":79573,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3449058393171657,"acs":10183,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":0.7652722227,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":29524,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.43607382342369144,"acs":35182,"articleLive":2,"columnArticles":142,"formTitle":"[195]第十行","frequency":2.4739630923,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":80679,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6651516359673604,"acs":100100,"articleLive":2,"columnArticles":382,"formTitle":"[196]删除重复的电子邮箱","frequency":2.8783427187,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":150492,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5335104761576112,"acs":92762,"articleLive":2,"columnArticles":498,"formTitle":"[197]上升的温度","frequency":2.6289693443,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":173871,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5140302355655583,"acs":381193,"articleLive":2,"columnArticles":2635,"formTitle":"[198]打家劫舍","frequency":3.8492806942,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":741577,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6521486016366274,"acs":138907,"articleLive":2,"columnArticles":1566,"formTitle":"[199]二叉树的右视图","frequency":4.0306077208,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":212999,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5546731533506921,"acs":323796,"articleLive":2,"columnArticles":2087,"formTitle":"[200]岛屿数量","frequency":4.2568959077,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":583760,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5233022352212805,"acs":49024,"articleLive":2,"columnArticles":319,"formTitle":"[201]数字范围按位与","frequency":1.7718252505,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":93682,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6186054783456033,"acs":166961,"articleLive":2,"columnArticles":1365,"formTitle":"[202]快乐数","frequency":2.9124912678,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":269899,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5150430494589197,"acs":228213,"articleLive":2,"columnArticles":1634,"formTitle":"[203]移除链表元素","frequency":2.5502069589,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":443095,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.3780248484039122,"acs":167011,"articleLive":2,"columnArticles":730,"formTitle":"[204]计数质数","frequency":2.6307174436,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":441799,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5006924190136925,"acs":112443,"articleLive":2,"columnArticles":863,"formTitle":"[205]同构字符串","frequency":2.3241730844,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":224575,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.722961719239878,"acs":697546,"articleLive":2,"columnArticles":7312,"formTitle":"[206]反转链表","frequency":4.3767521007,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":964845,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5440581266831676,"acs":139799,"articleLive":2,"columnArticles":919,"formTitle":"[207]课程表","frequency":3.3695546736,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":256956,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7167972472738582,"acs":142905,"articleLive":2,"columnArticles":964,"formTitle":"[208]实现 Trie (前缀树)","frequency":3.2223392043,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":199366,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4710920292320261,"acs":189713,"articleLive":2,"columnArticles":1346,"formTitle":"[209]长度最小的子数组","frequency":2.524806681,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":402709,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5419737529581707,"acs":88171,"articleLive":2,"columnArticles":670,"formTitle":"[210]课程表 II","frequency":2.3145684772,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":162685,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.48134809628301983,"acs":28736,"articleLive":2,"columnArticles":315,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":1.4542214982,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":59699,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.46347065173287605,"acs":60539,"articleLive":2,"columnArticles":555,"formTitle":"[212]单词搜索 II","frequency":1.36946092,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":130621,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4329402908176477,"acs":162179,"articleLive":2,"columnArticles":1496,"formTitle":"[213]打家劫舍 II","frequency":3.6058135916,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":374599,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37106442274196066,"acs":30890,"articleLive":2,"columnArticles":304,"formTitle":"[214]最短回文串","frequency":2.5865276326,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":83247,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6464456022540993,"acs":433392,"articleLive":2,"columnArticles":2261,"formTitle":"[215]数组中的第K个最大元素","frequency":4.2563232733,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":670423,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7377920362332515,"acs":97739,"articleLive":2,"columnArticles":1008,"formTitle":"[216]组合总和 III","frequency":3.2417008934,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":132475,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.559939461591237,"acs":356654,"articleLive":2,"columnArticles":1658,"formTitle":"[217]存在重复元素","frequency":3.7166009695,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":636951,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5422288157779911,"acs":31067,"articleLive":2,"columnArticles":277,"formTitle":"[218]天际线问题","frequency":3.058036153,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":57295,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.42505648520107175,"acs":109302,"articleLive":2,"columnArticles":871,"formTitle":"[219]存在重复元素 II","frequency":2.2963497186,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":257147,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28689312538182343,"acs":63867,"articleLive":2,"columnArticles":414,"formTitle":"[220]存在重复元素 III","frequency":3.0035208027,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":222616,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4752847755604487,"acs":137065,"articleLive":2,"columnArticles":973,"formTitle":"[221]最大正方形","frequency":3.4991973587,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":288385,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7807559574961466,"acs":114476,"articleLive":2,"columnArticles":871,"formTitle":"[222]完全二叉树的节点个数","frequency":1.887729068,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":146622,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.46285152049058415,"acs":20228,"articleLive":2,"columnArticles":258,"formTitle":"[223]矩形面积","frequency":2.1612900172,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"","submitted":43703,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.41845291346096497,"acs":70162,"articleLive":2,"columnArticles":647,"formTitle":"[224]基本计算器","frequency":3.4664209713,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":167670,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.675472540179228,"acs":133189,"articleLive":2,"columnArticles":4745,"formTitle":"[225]用队列实现栈","frequency":2.2388482516,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":197179,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7874755885008715,"acs":300003,"articleLive":2,"columnArticles":1839,"formTitle":"[226]翻转二叉树","frequency":3.7300812354,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":380968,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4370269436445907,"acs":84993,"articleLive":2,"columnArticles":693,"formTitle":"[227]基本计算器 II","frequency":3.3759947938,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":194480,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.581163006495515,"acs":56367,"articleLive":2,"columnArticles":634,"formTitle":"[228]汇总区间","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":96990,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.4637578898753015,"acs":36149,"articleLive":2,"columnArticles":305,"formTitle":"[229]求众数 II","frequency":1.887729068,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":77948,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7412475156703868,"acs":135758,"articleLive":2,"columnArticles":846,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":1.7406214708,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":183148,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5036804681677682,"acs":164907,"articleLive":2,"columnArticles":1194,"formTitle":"[231]2 的幂","frequency":2.0604721083,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":327404,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6910639685533483,"acs":156819,"articleLive":2,"columnArticles":1252,"formTitle":"[232]用栈实现队列","frequency":2.6839559372,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":226924,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47647182359117957,"acs":34032,"articleLive":2,"columnArticles":411,"formTitle":"[233]数字 1 的个数","frequency":3.0693153162,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":71425,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.495177582801826,"acs":305891,"articleLive":2,"columnArticles":1956,"formTitle":"[234]回文链表","frequency":3.7294170571,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":617740,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6661882597353167,"acs":168030,"articleLive":2,"columnArticles":960,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":2.6591284455,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":252226,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6802838727666602,"acs":253735,"articleLive":2,"columnArticles":1361,"formTitle":"[236]二叉树的最近公共祖先","frequency":3.6097439199,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":372984,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.848290922823682,"acs":206653,"articleLive":2,"columnArticles":1011,"formTitle":"[237]删除链表中的节点","frequency":2.5082404113,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":243611,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7227401488246237,"acs":136754,"articleLive":2,"columnArticles":859,"formTitle":"[238]除自身以外数组的乘积","frequency":2.6031227695,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":189216,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4964961063488617,"acs":189805,"articleLive":2,"columnArticles":1302,"formTitle":"[239]滑动窗口最大值","frequency":3.1791191028,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":382289,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.47658727994511724,"acs":166033,"articleLive":2,"columnArticles":749,"formTitle":"[240]搜索二维矩阵 II","frequency":2.9418965031,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":348379,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7372219452555611,"acs":31054,"articleLive":2,"columnArticles":279,"formTitle":"[241]为运算表达式设计优先级","frequency":2.6591284455,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":42123,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6447529438278213,"acs":286093,"articleLive":2,"columnArticles":1652,"formTitle":"[242]有效的字母异位词","frequency":2.6591284455,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":443725,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6561930783242259,"acs":8646,"articleLive":2,"columnArticles":103,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"","submitted":13176,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5488645350807818,"acs":4858,"articleLive":2,"columnArticles":57,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"","submitted":8851,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6041219407471018,"acs":4221,"articleLive":2,"columnArticles":59,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"","submitted":6987,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.47460639918740477,"acs":5607,"articleLive":2,"columnArticles":106,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"","submitted":11814,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.523902942694889,"acs":5074,"articleLive":2,"columnArticles":92,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"","submitted":9685,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46364932287954386,"acs":2602,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"","submitted":5612,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6375198728139905,"acs":5614,"articleLive":2,"columnArticles":99,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"ac","submitted":8806,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6335070952794671,"acs":4375,"articleLive":2,"columnArticles":75,"formTitle":"[250]统计同值子树","frequency":0.2477729518,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"","submitted":6906,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5427337241592102,"acs":3518,"articleLive":2,"columnArticles":67,"formTitle":"[251]展开二维向量","frequency":0.794816469,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"","submitted":6482,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5622538188106446,"acs":11705,"articleLive":2,"columnArticles":152,"formTitle":"[252]会议室","frequency":0.2477729518,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"","submitted":20818,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.49976830768739117,"acs":31277,"articleLive":2,"columnArticles":340,"formTitle":"[253]会议室 II","frequency":2.6923761887,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"","submitted":62583,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5679611650485437,"acs":5031,"articleLive":2,"columnArticles":73,"formTitle":"[254]因子的组合","frequency":0.8255314142,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"","submitted":8858,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4725887381527597,"acs":5086,"articleLive":2,"columnArticles":57,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"","submitted":10762,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.63698438461969,"acs":11381,"articleLive":2,"columnArticles":177,"formTitle":"[256]粉刷房子","frequency":0.2477729518,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"","submitted":17867,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6816155921164548,"acs":140239,"articleLive":2,"columnArticles":1043,"formTitle":"[257]二叉树的所有路径","frequency":2.8999792182,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":205745,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6917194727413706,"acs":77613,"articleLive":2,"columnArticles":642,"formTitle":"[258]各位相加","frequency":2.0802271379,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":112203,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5650151008080972,"acs":6922,"articleLive":2,"columnArticles":84,"formTitle":"[259]较小的三数之和","frequency":0.2750821312,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"","submitted":12251,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7245000211705926,"acs":51333,"articleLive":2,"columnArticles":437,"formTitle":"[260]只出现一次的数字 III","frequency":2.377961054,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":70853,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.4950636374449863,"acs":8324,"articleLive":2,"columnArticles":116,"formTitle":"[261]以图判树","frequency":1.1262855682,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"","submitted":16814,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43671902994994855,"acs":37781,"articleLive":2,"columnArticles":366,"formTitle":"[262]行程和用户","frequency":2.8381766769,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":86511,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5151358722119411,"acs":105778,"articleLive":2,"columnArticles":830,"formTitle":"[263]丑数","frequency":2.7224407249,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":205340,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5796918561995598,"acs":98765,"articleLive":2,"columnArticles":602,"formTitle":"[264]丑数 II","frequency":3.1217519674,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":170375,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5847018921813638,"acs":6551,"articleLive":2,"columnArticles":145,"formTitle":"[265]粉刷房子 II","frequency":0.2215934462,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"","submitted":11204,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6724067240672407,"acs":6560,"articleLive":2,"columnArticles":102,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"","submitted":9756,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.447364927651666,"acs":3370,"articleLive":2,"columnArticles":77,"formTitle":"[267]回文排列 II","frequency":0.3036065979,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"","submitted":7533,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6244057912896731,"acs":149479,"articleLive":2,"columnArticles":1081,"formTitle":"[268]丢失的数字","frequency":1.4542214982,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":239394,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.33807112127647987,"acs":6208,"articleLive":2,"columnArticles":102,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"","submitted":18363,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5523837041317539,"acs":9559,"articleLive":2,"columnArticles":135,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.7652722227,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"","submitted":17305,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5522483940042826,"acs":2579,"articleLive":2,"columnArticles":44,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"","submitted":4670,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6461095100864553,"acs":3363,"articleLive":2,"columnArticles":75,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.3036065979,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"","submitted":5205,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3097837228372284,"acs":12089,"articleLive":2,"columnArticles":158,"formTitle":"[273]整数转换英文表示","frequency":1.6309954146,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"","submitted":39024,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.44013199245757384,"acs":53219,"articleLive":2,"columnArticles":562,"formTitle":"[274]H 指数","frequency":2.7557285914,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":120916,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.46242096582058095,"acs":50464,"articleLive":2,"columnArticles":414,"formTitle":"[275]H 指数 II","frequency":1.6309954146,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":109130,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4884553301986104,"acs":6960,"articleLive":2,"columnArticles":124,"formTitle":"[276]栅栏涂色","frequency":1.1571522162,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"","submitted":14249,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5673039406944986,"acs":7270,"articleLive":2,"columnArticles":82,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"","submitted":12815,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4540520011987558,"acs":175749,"articleLive":2,"columnArticles":1008,"formTitle":"[278]第一个错误的版本","frequency":3.3836918223,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":387068,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6314025441012329,"acs":199688,"articleLive":2,"columnArticles":1177,"formTitle":"[279]完全平方数","frequency":3.4712682905,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":316261,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6858103899339728,"acs":5505,"articleLive":2,"columnArticles":70,"formTitle":"[280]摆动排序","frequency":0.794816469,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"ac","submitted":8027,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7576875768757687,"acs":2464,"articleLive":2,"columnArticles":61,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"","submitted":3252,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.3889911236198311,"acs":7187,"articleLive":2,"columnArticles":75,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":18476,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6383050038478761,"acs":476090,"articleLive":2,"columnArticles":3305,"formTitle":"[283]移动零","frequency":3.7841698326,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":745866,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.734056399132321,"acs":10152,"articleLive":2,"columnArticles":101,"formTitle":"[284]顶端迭代器","frequency":1.1571522162,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"","submitted":13830,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6357524704357687,"acs":7849,"articleLive":2,"columnArticles":101,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"","submitted":12346,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5083527932459134,"acs":11320,"articleLive":2,"columnArticles":145,"formTitle":"[286]墙与门","frequency":0.2477729518,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"ac","submitted":22268,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6608215795577836,"acs":176631,"articleLive":2,"columnArticles":1206,"formTitle":"[287]寻找重复数","frequency":2.9696567868,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":267290,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.42923991400025296,"acs":3394,"articleLive":2,"columnArticles":53,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"ac","submitted":7907,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7530414845597191,"acs":52551,"articleLive":2,"columnArticles":822,"formTitle":"[289]生命游戏","frequency":0.1964664962,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":69785,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45681691677115016,"acs":81249,"articleLive":2,"columnArticles":1076,"formTitle":"[290]单词规律","frequency":1.3898906398,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":177859,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.532730404823428,"acs":2474,"articleLive":2,"columnArticles":54,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"","submitted":4644,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7100852690385181,"acs":4830,"articleLive":2,"columnArticles":83,"formTitle":"[293]翻转游戏","frequency":0.2477729518,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"","submitted":6802,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5816091954022988,"acs":3542,"articleLive":2,"columnArticles":53,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"","submitted":6090,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5229920699891676,"acs":63247,"articleLive":2,"columnArticles":496,"formTitle":"[295]数据流的中位数","frequency":1.7718252505,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":120933,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.618214561358374,"acs":2403,"articleLive":2,"columnArticles":45,"formTitle":"[296]最佳的碰头地点","frequency":0.8575034469,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"","submitted":3887,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5589823963903381,"acs":103073,"articleLive":2,"columnArticles":742,"formTitle":"[297]二叉树的序列化与反序列化","frequency":2.891380713,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":184394,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5798349915069158,"acs":4779,"articleLive":2,"columnArticles":80,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"","submitted":8242,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5039294549248607,"acs":29945,"articleLive":2,"columnArticles":356,"formTitle":"[299]猜数字游戏","frequency":1.0965214663,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":59423,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5137059472658543,"acs":350068,"articleLive":2,"columnArticles":1959,"formTitle":"[300]最长递增子序列","frequency":3.6908832782,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":681456,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5233659998380173,"acs":32310,"articleLive":2,"columnArticles":227,"formTitle":"[301]删除无效的括号","frequency":2.2963497186,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":61735,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6657654613044948,"acs":1970,"articleLive":2,"columnArticles":37,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"","submitted":2959,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7253109969423108,"acs":128330,"articleLive":2,"columnArticles":783,"formTitle":"[303]区域和检索 - 数组不可变","frequency":2.2281300354,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":176931,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5438872294712571,"acs":62274,"articleLive":2,"columnArticles":553,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":1.7104563041,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":114498,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.37880301516665155,"acs":4171,"articleLive":2,"columnArticles":62,"formTitle":"[305]岛屿数量 II","frequency":0.2477729518,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"","submitted":11011,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3369622725977779,"acs":16559,"articleLive":2,"columnArticles":246,"formTitle":"[306]累加数","frequency":1.9461786376,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":49142,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5418315692590888,"acs":23548,"articleLive":2,"columnArticles":230,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.9619825169,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":43460,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6062795220894693,"acs":2182,"articleLive":2,"columnArticles":42,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"","submitted":3599,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6064650732866763,"acs":114819,"articleLive":2,"columnArticles":916,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":3.2952781391,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":189325,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.37921363179340634,"acs":21498,"articleLive":2,"columnArticles":209,"formTitle":"[310]最小高度树","frequency":2.114111457,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":56691,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7624090006618134,"acs":3456,"articleLive":2,"columnArticles":44,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.794816469,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"ac","submitted":4533,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6828817506376372,"acs":55422,"articleLive":2,"columnArticles":374,"formTitle":"[312]戳气球","frequency":2.4983206791,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":81159,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6367013960253592,"acs":40272,"articleLive":2,"columnArticles":351,"formTitle":"[313]超级丑数","frequency":2.5915351543,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":63251,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5429318068690892,"acs":4363,"articleLive":2,"columnArticles":87,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"","submitted":8036,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41843115559355565,"acs":49918,"articleLive":2,"columnArticles":477,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":2.6591284455,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":119298,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47697663568172843,"acs":66450,"articleLive":2,"columnArticles":520,"formTitle":"[316]去除重复字母","frequency":2.7747304552,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":139315,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4824571628394918,"acs":4139,"articleLive":2,"columnArticles":63,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"","submitted":8579,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6840957096852384,"acs":19756,"articleLive":2,"columnArticles":172,"formTitle":"[318]最大单词长度乘积","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":28879,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5176805650489861,"acs":22721,"articleLive":2,"columnArticles":224,"formTitle":"[319]灯泡开关","frequency":0.794816469,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":43890,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6744725249246464,"acs":2909,"articleLive":2,"columnArticles":49,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"","submitted":4313,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.425222494518251,"acs":26374,"articleLive":2,"columnArticles":228,"formTitle":"[321]拼接最大数","frequency":1.4542214982,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":62024,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4441522261146166,"acs":299089,"articleLive":2,"columnArticles":1795,"formTitle":"[322]零钱兑换","frequency":3.8447521111,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":673393,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.631515444015444,"acs":10468,"articleLive":2,"columnArticles":144,"formTitle":"[323]无向图中连通分量的数目","frequency":1.6309954146,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"","submitted":16576,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.37818391572300314,"acs":24914,"articleLive":2,"columnArticles":167,"formTitle":"[324]摆动排序 II","frequency":1.837638469,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":65878,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5374613725147221,"acs":9218,"articleLive":2,"columnArticles":103,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":1.3898906398,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"","submitted":17151,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.4898069242705604,"acs":96274,"articleLive":2,"columnArticles":382,"formTitle":"[326]3的幂","frequency":1.1262855682,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"","submitted":196555,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42307758934294176,"acs":24423,"articleLive":2,"columnArticles":204,"formTitle":"[327]区间和的个数","frequency":2.0203924243,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":57727,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6562516123040728,"acs":127196,"articleLive":2,"columnArticles":1052,"formTitle":"[328]奇偶链表","frequency":2.9899826898,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":193822,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4839602985520752,"acs":55050,"articleLive":2,"columnArticles":485,"formTitle":"[329]矩阵中的最长递增路径","frequency":2.6247371607,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":113749,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.533973705088972,"acs":18845,"articleLive":2,"columnArticles":149,"formTitle":"[330]按要求补齐数组","frequency":1.5989824376,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35292,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.479643793236798,"acs":44651,"articleLive":2,"columnArticles":501,"formTitle":"[331]验证二叉树的前序序列化","frequency":1.4542214982,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":93092,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4490699121775811,"acs":38964,"articleLive":2,"columnArticles":324,"formTitle":"[332]重新安排行程","frequency":2.3304687486,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":86766,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4681002130033472,"acs":4615,"articleLive":2,"columnArticles":77,"formTitle":"[333]最大 BST 子树","frequency":0.8255314142,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"","submitted":9859,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41214072158330123,"acs":44939,"articleLive":2,"columnArticles":292,"formTitle":"[334]递增的三元子序列","frequency":1.3898906398,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":109038,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.3673597983616887,"acs":2915,"articleLive":2,"columnArticles":37,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":7935,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.40106834879947495,"acs":21999,"articleLive":2,"columnArticles":190,"formTitle":"[336]回文对","frequency":1.6986664953,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":54851,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6080346522219221,"acs":128302,"articleLive":2,"columnArticles":916,"formTitle":"[337]打家劫舍 III","frequency":3.3099634853,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":211011,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7869060972678471,"acs":157142,"articleLive":2,"columnArticles":1354,"formTitle":"[338]比特位计数","frequency":2.8187018647,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":199696,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8063023358307625,"acs":3659,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"","submitted":4538,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.4936067965330816,"acs":11504,"articleLive":2,"columnArticles":174,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":1.1571522162,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"","submitted":23306,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7271785277398,"acs":50528,"articleLive":2,"columnArticles":487,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":3.3424233296,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":69485,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5156407366553163,"acs":86013,"articleLive":2,"columnArticles":760,"formTitle":"[342]4的幂","frequency":2.2634195123,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":166808,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6052718823575687,"acs":107716,"articleLive":2,"columnArticles":1027,"formTitle":"[343]整数拆分","frequency":3.3771731777,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":177963,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7671892356336175,"acs":359834,"articleLive":2,"columnArticles":1898,"formTitle":"[344]反转字符串","frequency":3.1322041138,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":469029,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5392648056483831,"acs":107311,"articleLive":2,"columnArticles":1022,"formTitle":"[345]反转字符串中的元音字母","frequency":2.4870014267,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":198995,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7068610735492974,"acs":12023,"articleLive":2,"columnArticles":134,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"ac","submitted":17009,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6221287690292497,"acs":198530,"articleLive":2,"columnArticles":1467,"formTitle":"[347]前 K 个高频元素","frequency":3.5915351138,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":319114,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.5986128625472887,"acs":4747,"articleLive":2,"columnArticles":78,"formTitle":"[348]设计井字棋","frequency":0.2215934462,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"","submitted":7930,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7385141174614859,"acs":210687,"articleLive":2,"columnArticles":1484,"formTitle":"[349]两个数组的交集","frequency":3.058036153,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":285285,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5497191879579132,"acs":243624,"articleLive":2,"columnArticles":1357,"formTitle":"[350]两个数组的交集 II","frequency":3.1154007235,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":443179,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5895646394150881,"acs":5322,"articleLive":2,"columnArticles":99,"formTitle":"[351]安卓系统手势解锁","frequency":0.5371296113,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"","submitted":9027,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.5923087450390037,"acs":4328,"articleLive":2,"columnArticles":82,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"","submitted":7307,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.42344689378757516,"acs":2113,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":0.9256148727,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"","submitted":4990,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4525949874489085,"acs":68875,"articleLive":2,"columnArticles":527,"formTitle":"[354]俄罗斯套娃信封问题","frequency":3.3424233296,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":152178,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4072137595205394,"acs":26091,"articleLive":2,"columnArticles":431,"formTitle":"[355]设计推特","frequency":1.7345074875,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":64072,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.3500905797101449,"acs":1546,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"","submitted":4416,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.519765708200213,"acs":24403,"articleLive":2,"columnArticles":382,"formTitle":"[357]计算各个位数不同的数字个数","frequency":2.1612900172,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":46950,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.3507288394942418,"acs":4355,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"","submitted":12417,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7254111076636673,"acs":4676,"articleLive":2,"columnArticles":55,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"","submitted":6446,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6082383873794917,"acs":2776,"articleLive":2,"columnArticles":60,"formTitle":"[360]有序转化数组","frequency":0.3036065979,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"","submitted":4564,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.562577228596646,"acs":3187,"articleLive":2,"columnArticles":62,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"","submitted":5665,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6929406669553919,"acs":3200,"articleLive":2,"columnArticles":62,"formTitle":"[362]敲击计数器","frequency":0.2750821312,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"","submitted":4618,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.49021282973621105,"acs":32707,"articleLive":2,"columnArticles":213,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":2.6591284455,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":66720,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7198868229587713,"acs":1781,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"","submitted":2474,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3645842422127214,"acs":33428,"articleLive":2,"columnArticles":480,"formTitle":"[365]水壶问题","frequency":2.3560783428,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":91688,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.763899049012436,"acs":4177,"articleLive":2,"columnArticles":119,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"","submitted":5468,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4393806568474342,"acs":75682,"articleLive":2,"columnArticles":601,"formTitle":"[367]有效的完全平方数","frequency":0.7652722227,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":172247,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.45919843336226274,"acs":41270,"articleLive":2,"columnArticles":447,"formTitle":"[368]最大整除子集","frequency":3.2716975035,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":89874,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.616810705324784,"acs":4425,"articleLive":2,"columnArticles":124,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"","submitted":7174,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7202715355805244,"acs":3077,"articleLive":2,"columnArticles":46,"formTitle":"[370]区间加法","frequency":0.794816469,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"","submitted":4272,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.5803212208526759,"acs":54379,"articleLive":2,"columnArticles":313,"formTitle":"[371]两整数之和","frequency":2.200820856,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":93705,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5097228884543006,"acs":13814,"articleLive":2,"columnArticles":135,"formTitle":"[372]超级次方","frequency":0.2215934462,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":27101,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.42019598771922445,"acs":19982,"articleLive":2,"columnArticles":202,"formTitle":"[373]查找和最小的K对数字","frequency":1.9853993508,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":47554,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5148043044237121,"acs":81997,"articleLive":2,"columnArticles":557,"formTitle":"[374]猜数字大小","frequency":1.5989824376,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":159278,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.46844438649106795,"acs":14370,"articleLive":2,"columnArticles":118,"formTitle":"[375]猜数字大小 II","frequency":1.6641945863,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":30676,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.46289264756644805,"acs":73755,"articleLive":2,"columnArticles":796,"formTitle":"[376]摆动序列","frequency":1.5382103993,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":159335,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5076167036643825,"acs":63113,"articleLive":2,"columnArticles":539,"formTitle":"[377]组合总和 Ⅳ","frequency":2.9095991698,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":124332,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.639019929925637,"acs":78972,"articleLive":2,"columnArticles":560,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":2.5190396523,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":123583,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6443037974683544,"acs":3054,"articleLive":2,"columnArticles":67,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"","submitted":4740,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5021663585951941,"acs":33959,"articleLive":2,"columnArticles":210,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":1.3299924982,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":67625,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.4418080761295212,"acs":20985,"articleLive":2,"columnArticles":175,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":47498,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6300639224787264,"acs":15475,"articleLive":2,"columnArticles":122,"formTitle":"[382]链表随机节点","frequency":1.1891993936,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":24561,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.5984762214630444,"acs":66219,"articleLive":2,"columnArticles":734,"formTitle":"[383]赎金信","frequency":0.1490979442,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":110646,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5770468971185899,"acs":50547,"articleLive":2,"columnArticles":196,"formTitle":"[384]打乱数组","frequency":2.377961054,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":87596,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4153033694965846,"acs":7235,"articleLive":2,"columnArticles":84,"formTitle":"[385]迷你语法分析器","frequency":0.2477729518,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17421,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7486056458511549,"acs":21878,"articleLive":2,"columnArticles":238,"formTitle":"[386]字典序排数","frequency":2.6902642109,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":29225,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5324021072707705,"acs":217178,"articleLive":2,"columnArticles":1171,"formTitle":"[387]字符串中的第一个唯一字符","frequency":2.9418965031,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":407921,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5262641576741283,"acs":5901,"articleLive":2,"columnArticles":106,"formTitle":"[388]文件的最长绝对路径","frequency":0.2477729518,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":11213,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6918971947011021,"acs":99445,"articleLive":2,"columnArticles":980,"formTitle":"[389]找不同","frequency":0.7652722227,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":143728,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.4670751413950983,"acs":6937,"articleLive":2,"columnArticles":93,"formTitle":"[390]消除游戏","frequency":1.9085566458,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":14852,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.3571652801757966,"acs":4551,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":12742,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5150179801521975,"acs":144221,"articleLive":2,"columnArticles":1554,"formTitle":"[392]判断子序列","frequency":2.5365762701,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":280031,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.39152947898439455,"acs":10964,"articleLive":2,"columnArticles":127,"formTitle":"[393]UTF-8 编码验证","frequency":1.5680776295,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":28003,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.552018425692579,"acs":119597,"articleLive":2,"columnArticles":1280,"formTitle":"[394]字符串解码","frequency":4.0306077208,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":216654,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5204980570079958,"acs":51166,"articleLive":2,"columnArticles":425,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":2.6591284455,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":98302,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.4267482433918073,"acs":8928,"articleLive":2,"columnArticles":143,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":20921,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.3775454182471551,"acs":15129,"articleLive":2,"columnArticles":186,"formTitle":"[397]整数替换","frequency":1.0965214663,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":40072,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6553012826427979,"acs":14203,"articleLive":2,"columnArticles":120,"formTitle":"[398]随机数索引","frequency":1.6309954146,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":21674,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5924024640657084,"acs":41544,"articleLive":2,"columnArticles":520,"formTitle":"[399]除法求值","frequency":1.1262855682,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":70128,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.414458519022634,"acs":18879,"articleLive":2,"columnArticles":192,"formTitle":"[400]第 N 位数字","frequency":2.1941157216,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":45551,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6137152578220189,"acs":53392,"articleLive":2,"columnArticles":654,"formTitle":"[401]二进制手表","frequency":2.2316000923,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":86998,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3274653392026988,"acs":79597,"articleLive":2,"columnArticles":580,"formTitle":"[402]移掉 K 位数字","frequency":3.3109939671,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":243070,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4559530379810346,"acs":45438,"articleLive":2,"columnArticles":456,"formTitle":"[403]青蛙过河","frequency":3.3828492061,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":99655,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5828399385997665,"acs":98342,"articleLive":2,"columnArticles":1105,"formTitle":"[404]左叶子之和","frequency":2.5997285636,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":168729,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5223506556580865,"acs":26888,"articleLive":2,"columnArticles":276,"formTitle":"[405]数字转换为十六进制数","frequency":2.2634195123,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"","submitted":51475,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.736846725947851,"acs":117502,"articleLive":2,"columnArticles":782,"formTitle":"[406]根据身高重建队列","frequency":2.8059331529,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":159466,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.484858664874982,"acs":10103,"articleLive":2,"columnArticles":125,"formTitle":"[407]接雨水 II","frequency":2.6591284455,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":20837,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3243927600112539,"acs":3459,"articleLive":2,"columnArticles":81,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"","submitted":10663,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5558475059239929,"acs":92657,"articleLive":2,"columnArticles":1300,"formTitle":"[409]最长回文串","frequency":3.1066744108,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":166695,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5635423664456582,"acs":38588,"articleLive":2,"columnArticles":310,"formTitle":"[410]分割数组的最大值","frequency":3.2417008934,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":68474,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.4971526195899772,"acs":873,"articleLive":2,"columnArticles":21,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"","submitted":1756,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6739344049539278,"acs":72700,"articleLive":2,"columnArticles":368,"formTitle":"[412]Fizz Buzz","frequency":1.1891993936,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":107874,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6871345029239766,"acs":69795,"articleLive":2,"columnArticles":901,"formTitle":"[413]等差数列划分","frequency":2.6269920039,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":101574,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.36388180590970454,"acs":60650,"articleLive":2,"columnArticles":830,"formTitle":"[414]第三大的数","frequency":1.0965214663,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":166675,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5374782189050694,"acs":145899,"articleLive":2,"columnArticles":1059,"formTitle":"[415]字符串相加","frequency":4.2624889011,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":271451,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.50692671930536,"acs":170007,"articleLive":2,"columnArticles":967,"formTitle":"[416]分割等和子集","frequency":3.5915351138,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":335368,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4790577317747836,"acs":26844,"articleLive":2,"columnArticles":313,"formTitle":"[417]太平洋大西洋水流问题","frequency":2.7224407249,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":56035,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3615934627170582,"acs":2124,"articleLive":2,"columnArticles":32,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"","submitted":5874,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7557464006062137,"acs":11968,"articleLive":2,"columnArticles":154,"formTitle":"[419]甲板上的战舰","frequency":0.2215934462,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":15836,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.2073040561146691,"acs":2719,"articleLive":2,"columnArticles":52,"formTitle":"[420]强密码检验器","frequency":1.2922521702,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13116,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6224852518529723,"acs":32922,"articleLive":2,"columnArticles":302,"formTitle":"[421]数组中两个数的最大异或值","frequency":2.8498182519,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":52888,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.42657036550667543,"acs":1949,"articleLive":2,"columnArticles":46,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"","submitted":4569,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5698969072164949,"acs":8292,"articleLive":2,"columnArticles":137,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14550,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5305309272973818,"acs":50862,"articleLive":2,"columnArticles":446,"formTitle":"[424]替换后的最长重复字符","frequency":3.0457780932,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":95870,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6120442441622286,"acs":1494,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"","submitted":2441,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6680008004802882,"acs":6676,"articleLive":2,"columnArticles":113,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":1.4214639017,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"","submitted":9994,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6115129596142255,"acs":4058,"articleLive":2,"columnArticles":67,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6636,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6493275818320223,"acs":2559,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"","submitted":3941,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6987356559621305,"acs":57420,"articleLive":2,"columnArticles":459,"formTitle":"[429]N 叉树的层序遍历","frequency":1.6309954146,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":82177,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5424595712673937,"acs":21636,"articleLive":2,"columnArticles":311,"formTitle":"[430]扁平化多级双向链表","frequency":1.1891993936,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":39885,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7284710017574693,"acs":829,"articleLive":2,"columnArticles":29,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"","submitted":1138,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.3782118358330427,"acs":6506,"articleLive":2,"columnArticles":85,"formTitle":"[432]全 O(1) 的数据结构","frequency":1.2225136003,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17202,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5322088518632795,"acs":15524,"articleLive":2,"columnArticles":210,"formTitle":"[433]最小基因变化","frequency":0.2477729518,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":29169,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3737732425419,"acs":38314,"articleLive":2,"columnArticles":523,"formTitle":"[434]字符串中的单词数","frequency":1.1262855682,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"","submitted":102506,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5086054410695489,"acs":93737,"articleLive":2,"columnArticles":829,"formTitle":"[435]无重叠区间","frequency":2.9418965031,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":184302,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.48553566354077865,"acs":8543,"articleLive":2,"columnArticles":140,"formTitle":"[436]寻找右区间","frequency":0.2215934462,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":17595,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5665290440965651,"acs":98797,"articleLive":2,"columnArticles":815,"formTitle":"[437]路径总和 III","frequency":2.2907810003,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"","submitted":174390,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5177332088502942,"acs":92054,"articleLive":2,"columnArticles":793,"formTitle":"[438]找到字符串中所有字母异位词","frequency":2.0772069,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":177802,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5890495867768595,"acs":2851,"articleLive":2,"columnArticles":67,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"","submitted":4840,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.3799196409690077,"acs":16169,"articleLive":2,"columnArticles":120,"formTitle":"[440]字典序的第K小数字","frequency":3.1620800128,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":42559,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4256344804789364,"acs":46355,"articleLive":2,"columnArticles":466,"formTitle":"[441]排列硬币","frequency":1.0965214663,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":108908,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6974912389873252,"acs":42593,"articleLive":2,"columnArticles":427,"formTitle":"[442]数组中重复的数据","frequency":2.9899826898,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":61066,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4769275625798595,"acs":55615,"articleLive":2,"columnArticles":689,"formTitle":"[443]压缩字符串","frequency":2.0075143609,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":116611,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.25155815874446197,"acs":3350,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":0.8255314142,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"","submitted":13317,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5884563039323565,"acs":81287,"articleLive":2,"columnArticles":923,"formTitle":"[445]两数相加 II","frequency":3.3064223215,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":138136,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.55207522136656,"acs":19141,"articleLive":2,"columnArticles":168,"formTitle":"[446]等差数列划分 II - 子序列","frequency":2.0802271379,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":34671,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6622704690802295,"acs":48257,"articleLive":2,"columnArticles":371,"formTitle":"[447]回旋镖的数量","frequency":0.7556706127,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":72866,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6479067627664469,"acs":135200,"articleLive":2,"columnArticles":1059,"formTitle":"[448]找到所有数组中消失的数字","frequency":2.8278779247,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":208672,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5564941532332436,"acs":15086,"articleLive":2,"columnArticles":134,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":27109,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.48558487072670764,"acs":58748,"articleLive":2,"columnArticles":604,"formTitle":"[450]删除二叉搜索树中的节点","frequency":2.2316000923,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":120984,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7113065482246976,"acs":80394,"articleLive":2,"columnArticles":939,"formTitle":"[451]根据字符出现频率排序","frequency":2.891380713,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":113023,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5092287373970559,"acs":94852,"articleLive":2,"columnArticles":829,"formTitle":"[452]用最少数量的箭引爆气球","frequency":2.4408748795,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":186266,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5544258373205742,"acs":26883,"articleLive":2,"columnArticles":296,"formTitle":"[453]最小操作次数使数组元素相等","frequency":1.0965214663,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":48488,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6016514917075523,"acs":77379,"articleLive":2,"columnArticles":482,"formTitle":"[454]四数相加 II","frequency":2.9418965031,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":128611,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5772067791884954,"acs":149070,"articleLive":2,"columnArticles":1213,"formTitle":"[455]分发饼干","frequency":2.7121631421,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":258261,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3623252533025523,"acs":56501,"articleLive":2,"columnArticles":455,"formTitle":"[456]132 模式","frequency":3.4432474042,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":155940,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43527701254973983,"acs":28441,"articleLive":2,"columnArticles":330,"formTitle":"[457]环形数组是否存在循环","frequency":2.3560783428,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":65340,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6096889622901184,"acs":6645,"articleLive":2,"columnArticles":61,"formTitle":"[458]可怜的小猪","frequency":0.794816469,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":10899,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5114428381641721,"acs":78150,"articleLive":2,"columnArticles":632,"formTitle":"[459]重复的子字符串","frequency":2.4232997346,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":152803,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.43905756811368346,"acs":33245,"articleLive":2,"columnArticles":399,"formTitle":"[460]LFU 缓存","frequency":2.8715316312,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":75719,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8119770406926575,"acs":167493,"articleLive":2,"columnArticles":1334,"formTitle":"[461]汉明距离","frequency":2.7976237305,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":206278,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6032279171210468,"acs":13829,"articleLive":2,"columnArticles":127,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":1.8041382395,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":22925,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7139175498389281,"acs":76457,"articleLive":2,"columnArticles":912,"formTitle":"[463]岛屿的周长","frequency":1.8041382395,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":107095,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3580843011875245,"acs":10976,"articleLive":2,"columnArticles":106,"formTitle":"[464]我能赢吗","frequency":1.5989824376,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":30652,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5326049846363947,"acs":1560,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"","submitted":2929,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.3736991791093013,"acs":11563,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.3334417464,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":30942,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44153039185436593,"acs":8586,"articleLive":2,"columnArticles":112,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.8255314142,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":19446,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.2501846911553458,"acs":24383,"articleLive":2,"columnArticles":295,"formTitle":"[468]验证IP地址","frequency":2.4259825715,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":97460,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4330637915543576,"acs":1446,"articleLive":2,"columnArticles":20,"formTitle":"[469]凸多边形","frequency":1.3299924982,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"","submitted":3339,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5464568727707202,"acs":62201,"articleLive":2,"columnArticles":333,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":2.1930387156,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":113826,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6168734491315137,"acs":1243,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":0.7652722227,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"","submitted":2015,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.40164593775137675,"acs":6491,"articleLive":2,"columnArticles":79,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":16161,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.42014535776435663,"acs":20522,"articleLive":2,"columnArticles":176,"formTitle":"[473]火柴拼正方形","frequency":1.9853993508,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":48845,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6108192800890612,"acs":74071,"articleLive":2,"columnArticles":589,"formTitle":"[474]一和零","frequency":3.0276755941,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":121265,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33181387734138,"acs":20673,"articleLive":2,"columnArticles":233,"formTitle":"[475]供暖器","frequency":2.6247371607,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":62303,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7015666579213673,"acs":37437,"articleLive":2,"columnArticles":472,"formTitle":"[476]数字的补数","frequency":0.2215934462,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":53362,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6038877968111329,"acs":38708,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":2.2634195123,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":64098,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4378531073446328,"acs":6510,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":1.4214639017,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":14868,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.4150186696169271,"acs":3001,"articleLive":2,"columnArticles":25,"formTitle":"[479]最大回文数乘积","frequency":0.4319465169,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","submitted":7231,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.44798593594741265,"acs":29305,"articleLive":2,"columnArticles":404,"formTitle":"[480]滑动窗口中位数","frequency":2.114111457,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":65415,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5372652582159625,"acs":5493,"articleLive":2,"columnArticles":95,"formTitle":"[481]神奇字符串","frequency":0.2477729518,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10224,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.426258068839204,"acs":19084,"articleLive":2,"columnArticles":223,"formTitle":"[482]密钥格式化","frequency":0.7368208014,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"","submitted":44771,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5906412478336222,"acs":15336,"articleLive":2,"columnArticles":116,"formTitle":"[483]最小好进制","frequency":1.6641945863,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":25965,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6407811080835604,"acs":1411,"articleLive":2,"columnArticles":33,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"","submitted":2202,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6067201912020928,"acs":120835,"articleLive":2,"columnArticles":980,"formTitle":"[485]最大连续 1 的个数","frequency":2.3480007545,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":199161,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5865964048516552,"acs":45751,"articleLive":2,"columnArticles":399,"formTitle":"[486]预测赢家","frequency":2.0475311319,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":77994,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5749921391887642,"acs":5486,"articleLive":2,"columnArticles":105,"formTitle":"[487]最大连续1的个数 II","frequency":1.7718252505,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"","submitted":9541,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3876455811829185,"acs":3395,"articleLive":2,"columnArticles":69,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":8758,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7186346863468634,"acs":1558,"articleLive":2,"columnArticles":23,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"","submitted":2168,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.48194006886951424,"acs":6578,"articleLive":2,"columnArticles":77,"formTitle":"[490]迷宫","frequency":0.8255314142,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"","submitted":13649,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5468306527909177,"acs":46240,"articleLive":2,"columnArticles":387,"formTitle":"[491]递增子序列","frequency":2.5190396523,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":84560,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5517765042979943,"acs":19257,"articleLive":2,"columnArticles":177,"formTitle":"[492]构造矩形","frequency":0.1964664962,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":34900,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3450168031926066,"acs":26282,"articleLive":2,"columnArticles":266,"formTitle":"[493]翻转对","frequency":1.7345074875,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":76176,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.49478905009322727,"acs":146748,"articleLive":2,"columnArticles":1017,"formTitle":"[494]目标和","frequency":3.6203021192,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":296587,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5420558925054118,"acs":27795,"articleLive":2,"columnArticles":428,"formTitle":"[495]提莫攻击","frequency":1.3898906398,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":51277,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6872723281356118,"acs":100183,"articleLive":2,"columnArticles":1022,"formTitle":"[496]下一个更大元素 I","frequency":2.2063426812,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":145769,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.40531468531468534,"acs":2898,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.2215934462,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7150,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4652407585423403,"acs":42590,"articleLive":2,"columnArticles":445,"formTitle":"[498]对角线遍历","frequency":2.4408748795,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":91544,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.37089871611982883,"acs":2600,"articleLive":2,"columnArticles":48,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"","submitted":7010,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7090528887949061,"acs":30178,"articleLive":2,"columnArticles":463,"formTitle":"[500]键盘行","frequency":0.7652722227,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":42561,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5120403255347274,"acs":64301,"articleLive":2,"columnArticles":532,"formTitle":"[501]二叉搜索树中的众数","frequency":2.200820856,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":125578,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.44055464030752334,"acs":28881,"articleLive":2,"columnArticles":352,"formTitle":"[502]IPO","frequency":1.1262855682,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":65556,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6347436940602116,"acs":101413,"articleLive":2,"columnArticles":957,"formTitle":"[503]下一个更大元素 II","frequency":2.1267442677,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":159770,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.50440093708166,"acs":30143,"articleLive":2,"columnArticles":313,"formTitle":"[504]七进制数","frequency":1.1262855682,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":59760,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4820087336244541,"acs":5519,"articleLive":2,"columnArticles":66,"formTitle":"[505]迷宫 II","frequency":0.794816469,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"","submitted":11450,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5640929233248287,"acs":21004,"articleLive":2,"columnArticles":282,"formTitle":"[506]相对名次","frequency":0.7652722227,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":37235,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.41178478474207447,"acs":28953,"articleLive":2,"columnArticles":227,"formTitle":"[507]完美数","frequency":0.794816469,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":70311,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6761368963900609,"acs":14422,"articleLive":2,"columnArticles":203,"formTitle":"[508]出现次数最多的子树元素和","frequency":1.1262855682,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":21330,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6757252321491282,"acs":234751,"articleLive":2,"columnArticles":1437,"formTitle":"[509]斐波那契数","frequency":2.9124912678,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":347406,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6082748149553995,"acs":3205,"articleLive":2,"columnArticles":54,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.3646942899,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"","submitted":5269,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7337841025237833,"acs":18666,"articleLive":2,"columnArticles":103,"formTitle":"[511]游戏玩法分析 I","frequency":1.9516807148,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"","submitted":25438,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5386922064808298,"acs":17605,"articleLive":2,"columnArticles":147,"formTitle":"[512]游戏玩法分析 II","frequency":0.2477729518,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"","submitted":32681,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7307394847998097,"acs":49132,"articleLive":2,"columnArticles":552,"formTitle":"[513]找树左下角的值","frequency":0.2215934462,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":67236,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5010833677259595,"acs":19426,"articleLive":2,"columnArticles":240,"formTitle":"[514]自由之路","frequency":2.3890945469,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":38768,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6437224669603524,"acs":37408,"articleLive":2,"columnArticles":412,"formTitle":"[515]在每个树行中找最大值","frequency":1.1571522162,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":58112,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6527698059351876,"acs":84159,"articleLive":2,"columnArticles":604,"formTitle":"[516]最长回文子序列","frequency":3.0099036673,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":128926,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.44091546006539,"acs":3776,"articleLive":2,"columnArticles":46,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"","submitted":8564,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6544360827186841,"acs":104876,"articleLive":2,"columnArticles":670,"formTitle":"[518]零钱兑换 II","frequency":3.3695546736,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":160254,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.3956390977443609,"acs":2631,"articleLive":2,"columnArticles":38,"formTitle":"[519]随机翻转矩阵","frequency":0.9619825169,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6650,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5636234154678821,"acs":39572,"articleLive":2,"columnArticles":636,"formTitle":"[520]检测大写字母","frequency":0.2477729518,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":70210,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7131965308089111,"acs":25163,"articleLive":2,"columnArticles":250,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.794816469,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":35282,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3599419448476052,"acs":6696,"articleLive":2,"columnArticles":105,"formTitle":"[522]最长特殊序列 II","frequency":0.794816469,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":18603,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2744731659975113,"acs":68158,"articleLive":2,"columnArticles":598,"formTitle":"[523]连续的子数组和","frequency":2.7224407249,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":248323,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.49433351698550076,"acs":70881,"articleLive":2,"columnArticles":747,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":1.523645621,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":143387,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5361658653846154,"acs":44609,"articleLive":2,"columnArticles":512,"formTitle":"[525]连续数组","frequency":3.3738625741,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":83200,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.734731247627342,"acs":32902,"articleLive":2,"columnArticles":379,"formTitle":"[526]优美的排列","frequency":2.7557285914,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":44781,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5771478667445938,"acs":1975,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"","submitted":3422,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.4767256202407271,"acs":31052,"articleLive":2,"columnArticles":256,"formTitle":"[528]按权重随机选择","frequency":1.0565709356,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":65136,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6460155171280163,"acs":39301,"articleLive":2,"columnArticles":459,"formTitle":"[529]扫雷游戏","frequency":1.8041382395,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":60836,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6206730189361959,"acs":77190,"articleLive":2,"columnArticles":634,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.2215934462,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":124365,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6610649212807359,"acs":3737,"articleLive":2,"columnArticles":75,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"","submitted":5653,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37351364992651753,"acs":25161,"articleLive":2,"columnArticles":273,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.794816469,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":67363,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5243664717348928,"acs":1614,"articleLive":2,"columnArticles":33,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"","submitted":3078,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6752887508492672,"acs":13915,"articleLive":2,"columnArticles":137,"formTitle":"[534]游戏玩法分析 III","frequency":0.794816469,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"","submitted":20606,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8414752507279197,"acs":15606,"articleLive":2,"columnArticles":100,"formTitle":"[535]TinyURL 的加密与解密","frequency":1.1262855682,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18546,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.535130278526505,"acs":2978,"articleLive":2,"columnArticles":46,"formTitle":"[536]从字符串生成二叉树","frequency":0.4319465169,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"","submitted":5565,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7125670923560985,"acs":11550,"articleLive":2,"columnArticles":170,"formTitle":"[537]复数乘法","frequency":0.2215934462,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16209,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.6983783783783784,"acs":107236,"articleLive":2,"columnArticles":820,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":1.4813381271,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":153550,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5964108108108108,"acs":13792,"articleLive":2,"columnArticles":177,"formTitle":"[539]最小时间差","frequency":1.5989824376,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":23125,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.581861103824968,"acs":37711,"articleLive":2,"columnArticles":392,"formTitle":"[540]有序数组中的单一元素","frequency":2.200820856,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":64811,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6081037110612574,"acs":71018,"articleLive":2,"columnArticles":788,"formTitle":"[541]反转字符串 II","frequency":1.3669406939,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":116786,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45827122676986615,"acs":67024,"articleLive":2,"columnArticles":628,"formTitle":"[542]01 矩阵","frequency":2.2281300354,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":146254,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5508284025897232,"acs":146251,"articleLive":2,"columnArticles":1219,"formTitle":"[543]二叉树的直径","frequency":3.6961235564,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":265511,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7089996864220759,"acs":2261,"articleLive":2,"columnArticles":51,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"","submitted":3189,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.41744701823558406,"acs":3388,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"","submitted":8116,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6307335581787521,"acs":14961,"articleLive":2,"columnArticles":120,"formTitle":"[546]移除盒子","frequency":1.2225136003,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":23720,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.618446162242927,"acs":159770,"articleLive":2,"columnArticles":1111,"formTitle":"[547]省份数量","frequency":2.3866977862,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":258341,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.35625704622322435,"acs":1580,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.4670075484,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"","submitted":4435,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.4850885368126747,"acs":2082,"articleLive":2,"columnArticles":51,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"","submitted":4292,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4389842043053118,"acs":12256,"articleLive":2,"columnArticles":175,"formTitle":"[550]游戏玩法分析 IV","frequency":1.1891993936,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"","submitted":27919,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.567374922311995,"acs":58426,"articleLive":2,"columnArticles":749,"formTitle":"[551]学生出勤记录 I","frequency":1.887729068,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":102976,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5784016124723766,"acs":23818,"articleLive":2,"columnArticles":285,"formTitle":"[552]学生出勤记录 II","frequency":2.1941157216,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":41179,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6034536565068137,"acs":5801,"articleLive":2,"columnArticles":85,"formTitle":"[553]最优除法","frequency":0.2477729518,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9613,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5022799211988401,"acs":45383,"articleLive":2,"columnArticles":487,"formTitle":"[554]砖墙","frequency":2.8153054685,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":90354,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3426878702837543,"acs":1099,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"","submitted":3207,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32580593861462614,"acs":14341,"articleLive":2,"columnArticles":210,"formTitle":"[556]下一个更大元素 III","frequency":1.9853993508,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":44017,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7456140350877193,"acs":156825,"articleLive":2,"columnArticles":1276,"formTitle":"[557]反转字符串中的单词 III","frequency":2.9032667483,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":210330,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5041177501314176,"acs":2877,"articleLive":2,"columnArticles":36,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5707,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7277825555057595,"acs":60085,"articleLive":2,"columnArticles":546,"formTitle":"[559]N 叉树的最大深度","frequency":1.6309954146,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":82559,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.44632692897322795,"acs":147025,"articleLive":2,"columnArticles":901,"formTitle":"[560]和为 K 的子数组","frequency":4.0612286068,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":329411,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7743108096356205,"acs":89038,"articleLive":2,"columnArticles":739,"formTitle":"[561]数组拆分 I","frequency":0.7093917643,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":114990,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.46323800171842394,"acs":3774,"articleLive":2,"columnArticles":58,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"","submitted":8147,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6053790380746308,"acs":31895,"articleLive":2,"columnArticles":319,"formTitle":"[563]二叉树的坡度","frequency":0.2477729518,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":52686,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17905806293219853,"acs":4376,"articleLive":2,"columnArticles":76,"formTitle":"[564]寻找最近的回文数","frequency":1.1891993936,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":24439,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6115364538019836,"acs":14058,"articleLive":2,"columnArticles":138,"formTitle":"[565]数组嵌套","frequency":0.7652722227,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":22988,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6923586115593066,"acs":66940,"articleLive":2,"columnArticles":622,"formTitle":"[566]重塑矩阵","frequency":1.8041382395,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":96684,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4310366857323242,"acs":114698,"articleLive":2,"columnArticles":1042,"formTitle":"[567]字符串的排列","frequency":2.9124912678,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":266098,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5034843205574913,"acs":1156,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"","submitted":2296,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5629800307219662,"acs":9529,"articleLive":2,"columnArticles":152,"formTitle":"[569]员工薪水中位数","frequency":1.4542214982,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"","submitted":16926,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6619260679663365,"acs":12427,"articleLive":2,"columnArticles":110,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.2215934462,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"","submitted":18774,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.48738252053578035,"acs":6586,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.2477729518,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"","submitted":13513,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4735160633653774,"acs":82111,"articleLive":2,"columnArticles":719,"formTitle":"[572]另一棵树的子树","frequency":2.3968795146,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":173407,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6614276358873609,"acs":1010,"articleLive":2,"columnArticles":30,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"","submitted":1527,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6475691689149871,"acs":12241,"articleLive":2,"columnArticles":112,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"","submitted":18903,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6848602561148237,"acs":41608,"articleLive":2,"columnArticles":425,"formTitle":"[575]分糖果","frequency":1.3898906398,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":60754,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4695381441019878,"acs":25487,"articleLive":2,"columnArticles":276,"formTitle":"[576]出界的路径数","frequency":2.0475311319,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":54281,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.705416949810698,"acs":14533,"articleLive":2,"columnArticles":83,"formTitle":"[577]员工奖金","frequency":1.1262855682,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"","submitted":20602,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.49756148178893844,"acs":9590,"articleLive":2,"columnArticles":111,"formTitle":"[578]查询回答率最高的问题","frequency":0.2477729518,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"","submitted":19274,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.41112209046991655,"acs":7489,"articleLive":2,"columnArticles":127,"formTitle":"[579]查询员工的累计薪水","frequency":1.2571911387,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"","submitted":18216,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5240127491761655,"acs":9700,"articleLive":2,"columnArticles":79,"formTitle":"[580]统计各专业学生人数","frequency":0.794816469,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"","submitted":18511,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.404472244459469,"acs":97513,"articleLive":2,"columnArticles":849,"formTitle":"[581]最短无序连续子数组","frequency":3.0830249595,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":241087,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.40585319801746517,"acs":8598,"articleLive":2,"columnArticles":131,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"","submitted":21185,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.5878076287912354,"acs":29187,"articleLive":2,"columnArticles":278,"formTitle":"[583]两个字符串的删除操作","frequency":2.3382207254,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":49654,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.774247978123,"acs":13307,"articleLive":2,"columnArticles":59,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"","submitted":17187,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.594983130409271,"acs":8112,"articleLive":2,"columnArticles":98,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"","submitted":13634,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7479067783051571,"acs":14024,"articleLive":2,"columnArticles":85,"formTitle":"[586]订单最多的客户","frequency":1.1571522162,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"","submitted":18751,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.38443179731962546,"acs":2094,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.3974841127,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5447,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.42346938775510207,"acs":1411,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":0.4319465169,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"","submitted":3332,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7453445343679762,"acs":87215,"articleLive":2,"columnArticles":559,"formTitle":"[589]N 叉树的前序遍历","frequency":2.0159454031,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":117013,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7604996981606278,"acs":61729,"articleLive":2,"columnArticles":451,"formTitle":"[590]N 叉树的后序遍历","frequency":0.1964664962,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":81169,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.33993015133876603,"acs":1752,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5154,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5217753450737744,"acs":4385,"articleLive":2,"columnArticles":106,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8404,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44172210503542647,"acs":8167,"articleLive":2,"columnArticles":130,"formTitle":"[593]有效的正方形","frequency":1.1262855682,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":18489,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5171698589618728,"acs":28675,"articleLive":2,"columnArticles":267,"formTitle":"[594]最长和谐子序列","frequency":0.2750821312,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":55446,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.796625701999671,"acs":101706,"articleLive":2,"columnArticles":235,"formTitle":"[595]大的国家","frequency":2.0159454031,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":127671,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4208169586884831,"acs":79882,"articleLive":2,"columnArticles":279,"formTitle":"[596]超过5名学生的课","frequency":1.3299924982,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":189826,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.44157457950561396,"acs":9950,"articleLive":2,"columnArticles":79,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.7652722227,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"","submitted":22533,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5178711447987454,"acs":15851,"articleLive":2,"columnArticles":207,"formTitle":"[598]范围求和 II","frequency":0.7652722227,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":30608,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5220150077245641,"acs":28383,"articleLive":2,"columnArticles":267,"formTitle":"[599]两个列表的最小索引总和","frequency":0.7368208014,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":54372,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.48083916083916084,"acs":18909,"articleLive":2,"columnArticles":229,"formTitle":"[600]不含连续1的非负整数","frequency":1.4788381258,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":39325,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.4990822733859282,"acs":30998,"articleLive":2,"columnArticles":367,"formTitle":"[601]体育馆的人流量","frequency":2.4870014267,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":62110,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6274038461538461,"acs":7830,"articleLive":2,"columnArticles":86,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.794816469,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"","submitted":12480,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6712838762660827,"acs":12261,"articleLive":2,"columnArticles":106,"formTitle":"[603]连续空余座位","frequency":1.1571522162,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"","submitted":18265,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37181503617489775,"acs":2364,"articleLive":2,"columnArticles":52,"formTitle":"[604]迭代压缩字符串","frequency":0.3036065979,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"","submitted":6358,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.334083827270296,"acs":107430,"articleLive":2,"columnArticles":1244,"formTitle":"[605]种花问题","frequency":2.4870014267,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":321566,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.568901303538175,"acs":28106,"articleLive":2,"columnArticles":308,"formTitle":"[606]根据二叉树创建字符串","frequency":0.2477729518,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":49404,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6634403124469349,"acs":11721,"articleLive":2,"columnArticles":84,"formTitle":"[607]销售员","frequency":0.2750821312,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"","submitted":17667,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.657033270894657,"acs":7366,"articleLive":2,"columnArticles":97,"formTitle":"[608]树节点","frequency":0.2477729518,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"","submitted":11211,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.48518742442563484,"acs":6420,"articleLive":2,"columnArticles":99,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13232,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6676319599842043,"acs":10144,"articleLive":2,"columnArticles":71,"formTitle":"[610]判断三角形","frequency":0.3334417464,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"","submitted":15194,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5316975828514414,"acs":49559,"articleLive":2,"columnArticles":385,"formTitle":"[611]有效三角形的个数","frequency":3.8214760254,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":93209,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6680082366154998,"acs":7137,"articleLive":2,"columnArticles":62,"formTitle":"[612]平面上的最近距离","frequency":0.2750821312,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"","submitted":10684,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8168749548508272,"acs":11308,"articleLive":2,"columnArticles":80,"formTitle":"[613]直线上的最近距离","frequency":0.2477729518,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"","submitted":13843,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.34648309946165384,"acs":7852,"articleLive":2,"columnArticles":66,"formTitle":"[614]二级关注者","frequency":0.794816469,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"","submitted":22662,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.4252530280404845,"acs":5126,"articleLive":2,"columnArticles":89,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"","submitted":12054,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.4603081438004402,"acs":3137,"articleLive":2,"columnArticles":53,"formTitle":"[616]给字符串添加加粗标签","frequency":1.837638469,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"","submitted":6815,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7880172458216672,"acs":183504,"articleLive":2,"columnArticles":1214,"formTitle":"[617]合并二叉树","frequency":3.2537389582,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":232868,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6194174757281553,"acs":4466,"articleLive":2,"columnArticles":44,"formTitle":"[618]学生地理信息报告","frequency":0.794816469,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"","submitted":7210,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.465896100596977,"acs":11004,"articleLive":2,"columnArticles":79,"formTitle":"[619]只出现一次的最大数字","frequency":0.2477729518,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"","submitted":23619,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7729523937872713,"acs":91768,"articleLive":2,"columnArticles":307,"formTitle":"[620]有趣的电影","frequency":1.9191499652,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":118724,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5698657199726687,"acs":76729,"articleLive":2,"columnArticles":494,"formTitle":"[621]任务调度器","frequency":2.9060760546,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":134644,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.43681732322264505,"acs":63826,"articleLive":2,"columnArticles":406,"formTitle":"[622]设计循环队列","frequency":2.0159454031,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":146116,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5457021791767555,"acs":10818,"articleLive":2,"columnArticles":184,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":19824,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.416293120249464,"acs":2136,"articleLive":2,"columnArticles":48,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"","submitted":5131,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3404666574623775,"acs":2466,"articleLive":2,"columnArticles":52,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"","submitted":7243,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6835020973863339,"acs":44483,"articleLive":2,"columnArticles":343,"formTitle":"[626]换座位","frequency":1.7406214708,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":65081,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8077262862739826,"acs":84115,"articleLive":2,"columnArticles":332,"formTitle":"[627]变更性别","frequency":1.3594236984,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":104138,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5250675213845368,"acs":79124,"articleLive":2,"columnArticles":755,"formTitle":"[628]三个数的最大乘积","frequency":1.5989824376,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":150693,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40372297838270615,"acs":4034,"articleLive":2,"columnArticles":57,"formTitle":"[629]K个逆序对数组","frequency":1.1891993936,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":9992,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.36712150747238464,"acs":6215,"articleLive":2,"columnArticles":73,"formTitle":"[630]课程表 III","frequency":0.3036065979,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":16929,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28548256285482565,"acs":1056,"articleLive":2,"columnArticles":34,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"","submitted":3699,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5975013579576317,"acs":18700,"articleLive":2,"columnArticles":238,"formTitle":"[632]最小区间","frequency":0.794816469,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":31297,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.3986959485238326,"acs":93005,"articleLive":2,"columnArticles":758,"formTitle":"[633]平方数之和","frequency":3.0234146477,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":233273,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.4399345335515548,"acs":1344,"articleLive":2,"columnArticles":20,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"","submitted":3055,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5556347057985468,"acs":3900,"articleLive":2,"columnArticles":64,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"","submitted":7019,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5501865136298422,"acs":9587,"articleLive":2,"columnArticles":110,"formTitle":"[636]函数的独占时间","frequency":0.2477729518,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":17425,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6895237737690763,"acs":73466,"articleLive":2,"columnArticles":642,"formTitle":"[637]二叉树的层平均值","frequency":1.3299924982,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":106546,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5930147058823529,"acs":11291,"articleLive":2,"columnArticles":115,"formTitle":"[638]大礼包","frequency":0.2477729518,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":19040,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.30994756664943507,"acs":4197,"articleLive":2,"columnArticles":83,"formTitle":"[639]解码方法 II","frequency":1.3898906398,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"","submitted":13541,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4246308937926655,"acs":10699,"articleLive":2,"columnArticles":205,"formTitle":"[640]求解方程","frequency":1.0965214663,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25196,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5329693936866581,"acs":21088,"articleLive":2,"columnArticles":235,"formTitle":"[641]设计循环双端队列","frequency":0.7652722227,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":39567,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.48887973640856675,"acs":2374,"articleLive":2,"columnArticles":53,"formTitle":"[642]设计搜索自动补全系统","frequency":0.3334417464,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"","submitted":4856,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.45103616707969685,"acs":62791,"articleLive":2,"columnArticles":569,"formTitle":"[643]子数组最大平均数 I","frequency":1.7718252505,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":139215,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.3997852541159628,"acs":1117,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"","submitted":2794,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.434841098505474,"acs":67880,"articleLive":2,"columnArticles":691,"formTitle":"[645]错误的集合","frequency":1.9853993508,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":156103,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5764239460816704,"acs":21809,"articleLive":2,"columnArticles":190,"formTitle":"[646]最长数对链","frequency":0.1964664962,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":37835,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6566219309761204,"acs":121043,"articleLive":2,"columnArticles":894,"formTitle":"[647]回文子串","frequency":2.7318348757,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":184342,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.583595424309054,"acs":20968,"articleLive":2,"columnArticles":274,"formTitle":"[648]单词替换","frequency":0.1964664962,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":35929,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4817649407693332,"acs":28956,"articleLive":2,"columnArticles":307,"formTitle":"[649]Dota2 参议院","frequency":0.2477729518,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":60104,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5365952777664892,"acs":26408,"articleLive":2,"columnArticles":307,"formTitle":"[650]只有两个键的键盘","frequency":0.794816469,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"","submitted":49214,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.580568720379147,"acs":3675,"articleLive":2,"columnArticles":62,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"","submitted":6330,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5711032800216861,"acs":31602,"articleLive":2,"columnArticles":228,"formTitle":"[652]寻找重复的子树","frequency":2.5283942575,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":55335,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5967182736565246,"acs":39930,"articleLive":2,"columnArticles":375,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":66916,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8096061827769485,"acs":58035,"articleLive":2,"columnArticles":590,"formTitle":"[654]最大二叉树","frequency":2.0988997246,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":71683,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5967958987504005,"acs":9313,"articleLive":2,"columnArticles":135,"formTitle":"[655]输出二叉树","frequency":0.794816469,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15605,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.30723117272386663,"acs":820,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"","submitted":2669,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7835245728343808,"acs":81532,"articleLive":2,"columnArticles":616,"formTitle":"[657]机器人能否返回原点","frequency":0.2215934462,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":104058,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45404267900311307,"acs":26107,"articleLive":2,"columnArticles":235,"formTitle":"[658]找到 K 个最接近的元素","frequency":1.48824996,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":57499,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5418877354863514,"acs":28189,"articleLive":2,"columnArticles":260,"formTitle":"[659]分割数组为连续子序列","frequency":0.1964664962,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":52020,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6507317073170732,"acs":667,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":0.6743307328,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"","submitted":1025,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5602186017735615,"acs":16299,"articleLive":2,"columnArticles":211,"formTitle":"[661]图片平滑器","frequency":0.2477729518,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":29094,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.40773368904003165,"acs":27816,"articleLive":2,"columnArticles":264,"formTitle":"[662]二叉树最大宽度","frequency":2.4691653093,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":68221,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4613111230521225,"acs":1717,"articleLive":2,"columnArticles":35,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"","submitted":3722,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6547693779332198,"acs":21904,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":2.5915351543,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33453,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.27038894485567866,"acs":74079,"articleLive":2,"columnArticles":925,"formTitle":"[665]非递减数列","frequency":2.3560783428,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":273972,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6178614823815309,"acs":2034,"articleLive":2,"columnArticles":75,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"","submitted":3292,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6242309512541411,"acs":7914,"articleLive":2,"columnArticles":118,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12678,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.507492053882246,"acs":6706,"articleLive":2,"columnArticles":66,"formTitle":"[668]乘法表中第k小的数","frequency":1.4214639017,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":13214,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6657380042542778,"acs":35366,"articleLive":2,"columnArticles":299,"formTitle":"[669]修剪二叉搜索树","frequency":0.7652722227,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":53123,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.44993977532509033,"acs":18304,"articleLive":2,"columnArticles":277,"formTitle":"[670]最大交换","frequency":2.7819821186,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":40681,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48637173996949035,"acs":52926,"articleLive":2,"columnArticles":662,"formTitle":"[671]二叉树中第二小的节点","frequency":2.2634195123,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":108818,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5494572695306528,"acs":3594,"articleLive":2,"columnArticles":42,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.2215934462,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6541,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.3925323376450193,"acs":29436,"articleLive":2,"columnArticles":276,"formTitle":"[673]最长递增子序列的个数","frequency":2.5865276326,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":74990,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.49413911010607503,"acs":90466,"articleLive":2,"columnArticles":749,"formTitle":"[674]最长连续递增序列","frequency":1.8279409532,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":183078,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.3996334930927544,"acs":2835,"articleLive":2,"columnArticles":47,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.3036065979,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7094,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5883257841210153,"acs":6884,"articleLive":2,"columnArticles":122,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":11701,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6164209992820037,"acs":14595,"articleLive":2,"columnArticles":240,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":23677,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.38516709488229367,"acs":42425,"articleLive":2,"columnArticles":465,"formTitle":"[678]有效的括号字符串","frequency":2.7193295767,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":110147,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.541215141554448,"acs":25521,"articleLive":2,"columnArticles":260,"formTitle":"[679]24 点游戏","frequency":3.4368330141,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":47155,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.40152943838871497,"acs":85166,"articleLive":2,"columnArticles":808,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":2.2063426812,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":212104,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5006979062811565,"acs":2511,"articleLive":2,"columnArticles":60,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"","submitted":5015,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6951738930595985,"acs":45374,"articleLive":2,"columnArticles":507,"formTitle":"[682]棒球比赛","frequency":1.4214639017,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":65270,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4312625250501002,"acs":2152,"articleLive":2,"columnArticles":48,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"","submitted":4990,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6656832053332132,"acs":59114,"articleLive":2,"columnArticles":599,"formTitle":"[684]冗余连接","frequency":1.3299924982,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":88802,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.43189722632814537,"acs":19869,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":1.4214639017,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":46004,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.35530366056572377,"acs":17083,"articleLive":2,"columnArticles":192,"formTitle":"[686]重复叠加字符串匹配","frequency":0.2215934462,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":48080,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.44057896218447967,"acs":37562,"articleLive":2,"columnArticles":267,"formTitle":"[687]最长同值路径","frequency":2.4739630923,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":85256,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5109060402684564,"acs":7917,"articleLive":2,"columnArticles":105,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.794816469,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15496,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.4851141000453378,"acs":3210,"articleLive":2,"columnArticles":69,"formTitle":"[689]三个无重叠子数组的最大和","frequency":1.6641945863,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6617,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6471839960715079,"acs":55353,"articleLive":2,"columnArticles":562,"formTitle":"[690]员工的重要性","frequency":3.0797289777,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":85529,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.49113004609582345,"acs":3516,"articleLive":2,"columnArticles":45,"formTitle":"[691]贴纸拼词","frequency":0.3036065979,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7159,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.578629554760794,"acs":66981,"articleLive":2,"columnArticles":729,"formTitle":"[692]前K个高频单词","frequency":3.1217519674,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":115758,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6094090865977426,"acs":25700,"articleLive":2,"columnArticles":276,"formTitle":"[693]交替位二进制数","frequency":0.2215934462,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":42172,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5321187584345479,"acs":3943,"articleLive":2,"columnArticles":75,"formTitle":"[694]不同岛屿的数量","frequency":0.2477729518,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"","submitted":7410,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6632507631273864,"acs":124719,"articleLive":2,"columnArticles":1245,"formTitle":"[695]岛屿的最大面积","frequency":3.1161244906,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":188042,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6310165031112422,"acs":51313,"articleLive":2,"columnArticles":472,"formTitle":"[696]计数二进制子串","frequency":1.1262855682,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":81318,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6052488953803474,"acs":65888,"articleLive":2,"columnArticles":836,"formTitle":"[697]数组的度","frequency":0.794816469,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":108861,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.4452698745414753,"acs":28890,"articleLive":2,"columnArticles":213,"formTitle":"[698]划分为k个相等的子集","frequency":2.6269920039,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":64882,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.4759498082955734,"acs":2731,"articleLive":2,"columnArticles":40,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5738,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.759399145750348,"acs":79118,"articleLive":2,"columnArticles":501,"formTitle":"[700]二叉搜索树中的搜索","frequency":1.0131707638,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":104185,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7238280063120547,"acs":73850,"articleLive":2,"columnArticles":554,"formTitle":"[701]二叉搜索树中的插入操作","frequency":1.4542214982,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":102027,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7404472618418736,"acs":4205,"articleLive":2,"columnArticles":76,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"","submitted":5679,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5126908372241544,"acs":59406,"articleLive":2,"columnArticles":535,"formTitle":"[703]数据流中的第 K 大元素","frequency":1.5989824376,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":115871,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5582772793292061,"acs":270985,"articleLive":2,"columnArticles":1359,"formTitle":"[704]二分查找","frequency":3.3306369948,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":485395,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6453621409280629,"acs":65714,"articleLive":2,"columnArticles":427,"formTitle":"[705]设计哈希集合","frequency":2.1612900172,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":101825,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.644554794520548,"acs":56463,"articleLive":2,"columnArticles":381,"formTitle":"[706]设计哈希映射","frequency":1.3898906398,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":87600,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.31972671678254,"acs":61118,"articleLive":2,"columnArticles":428,"formTitle":"[707]设计链表","frequency":2.7819821186,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":191157,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.3359375,"acs":2150,"articleLive":2,"columnArticles":51,"formTitle":"[708]循环有序列表的插入","frequency":0.3036065979,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"","submitted":6400,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.759155689915785,"acs":70313,"articleLive":2,"columnArticles":504,"formTitle":"[709]转换成小写字母","frequency":0.2477729518,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":92620,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3508638035107195,"acs":5057,"articleLive":2,"columnArticles":61,"formTitle":"[710]黑名单中的随机数","frequency":1.2225136003,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":14413,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5589414595028067,"acs":697,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"","submitted":1247,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6712153127575785,"acs":14658,"articleLive":2,"columnArticles":161,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.8575034469,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":21838,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.40943598859385993,"acs":22112,"articleLive":2,"columnArticles":204,"formTitle":"[713]乘积小于K的子数组","frequency":1.887729068,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":54006,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.719630450849963,"acs":97366,"articleLive":2,"columnArticles":655,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":2.2063426812,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":135300,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.40325964176214296,"acs":2499,"articleLive":2,"columnArticles":41,"formTitle":"[715]Range 模块","frequency":0.2750821312,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6197,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.46264196054991036,"acs":3870,"articleLive":2,"columnArticles":69,"formTitle":"[716]最大栈","frequency":0.8575034469,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"ac","submitted":8365,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5109072840129681,"acs":31360,"articleLive":2,"columnArticles":378,"formTitle":"[717]1比特与2比特字符","frequency":0.2477729518,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":61381,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5645244605456186,"acs":81965,"articleLive":2,"columnArticles":572,"formTitle":"[718]最长重复子数组","frequency":3.2057387297,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":145193,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3690229130490026,"acs":8713,"articleLive":2,"columnArticles":83,"formTitle":"[719]找出第 k 小的距离对","frequency":2.2281300354,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":23611,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4856907655803593,"acs":20060,"articleLive":2,"columnArticles":265,"formTitle":"[720]词典中最长的单词","frequency":0.2477729518,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":41302,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4691730309089121,"acs":28628,"articleLive":2,"columnArticles":335,"formTitle":"[721]账户合并","frequency":1.7718252505,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":61018,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.32090571930509465,"acs":4932,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":1.837638469,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15369,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.721302113078241,"acs":1263,"articleLive":2,"columnArticles":39,"formTitle":"[723]粉碎糖果","frequency":0.5371296113,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"","submitted":1751,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.46017355132379767,"acs":134962,"articleLive":2,"columnArticles":846,"formTitle":"[724]寻找数组的中心下标","frequency":1.6641945863,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":293285,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.5623988933955407,"acs":23988,"articleLive":2,"columnArticles":310,"formTitle":"[725]分隔链表","frequency":0.7652722227,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":42653,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.553968619621695,"acs":21643,"articleLive":2,"columnArticles":393,"formTitle":"[726]原子的数量","frequency":2.5437933915,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39069,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4079233783195472,"acs":2811,"articleLive":2,"columnArticles":48,"formTitle":"[727]最小窗口子序列","frequency":1.523645621,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"","submitted":6891,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7597631531368649,"acs":33618,"articleLive":2,"columnArticles":306,"formTitle":"[728]自除数","frequency":0.2477729518,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":44248,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5106273347932501,"acs":7928,"articleLive":2,"columnArticles":87,"formTitle":"[729]我的日程安排表 I","frequency":1.1571522162,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":15526,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4892622536634664,"acs":3873,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":1.8724124874,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":7916,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5086922677737415,"acs":3921,"articleLive":2,"columnArticles":39,"formTitle":"[731]我的日程安排表 II","frequency":0.2477729518,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":7708,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6097876269621422,"acs":3302,"articleLive":2,"columnArticles":52,"formTitle":"[732]我的日程安排表 III","frequency":0.7652722227,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5415,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5803073851926471,"acs":62791,"articleLive":2,"columnArticles":533,"formTitle":"[733]图像渲染","frequency":2.2063426812,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":108203,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4784389303782221,"acs":1986,"articleLive":2,"columnArticles":36,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"","submitted":4151,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4054356409581469,"acs":18483,"articleLive":2,"columnArticles":237,"formTitle":"[735]行星碰撞","frequency":1.7406214708,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":45588,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.4604553624925105,"acs":1537,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3338,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4602576567817209,"acs":3787,"articleLive":2,"columnArticles":65,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"","submitted":8228,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5022047712240196,"acs":40545,"articleLive":2,"columnArticles":581,"formTitle":"[738]单调递增的数字","frequency":0.794816469,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":80734,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.679095416537121,"acs":207501,"articleLive":2,"columnArticles":1486,"formTitle":"[739]每日温度","frequency":3.857704989,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":305555,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6297377985462098,"acs":48515,"articleLive":2,"columnArticles":562,"formTitle":"[740]删除并获得点数","frequency":3.0858414661,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":77040,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.36662595132951237,"acs":3902,"articleLive":2,"columnArticles":45,"formTitle":"[741]摘樱桃","frequency":1.1891993936,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10643,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4911184210526316,"acs":1493,"articleLive":2,"columnArticles":43,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"","submitted":3040,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5190014591484893,"acs":55843,"articleLive":2,"columnArticles":515,"formTitle":"[743]网络延迟时间","frequency":2.4408748795,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":107597,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4591991255735577,"acs":40331,"articleLive":2,"columnArticles":361,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":1.2571911387,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":87829,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.39143176109405525,"acs":2805,"articleLive":2,"columnArticles":54,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7166,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5845925885770302,"acs":129406,"articleLive":2,"columnArticles":1249,"formTitle":"[746]使用最小花费爬楼梯","frequency":2.3354448735,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":221361,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4157256687010073,"acs":45026,"articleLive":2,"columnArticles":400,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.2477729518,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":108307,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6002251701013266,"acs":12262,"articleLive":2,"columnArticles":172,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":20429,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5057736720554272,"acs":1314,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2598,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7213967310549777,"acs":1942,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.8908287567,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"","submitted":2692,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5027203482045702,"acs":1386,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"","submitted":2757,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5305302354447073,"acs":68388,"articleLive":2,"columnArticles":580,"formTitle":"[752]打开转盘锁","frequency":1.9516807148,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":128905,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5884003741814781,"acs":3145,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.2477729518,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5345,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.42982980805828935,"acs":7905,"articleLive":2,"columnArticles":92,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18391,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.5011746280344558,"acs":1280,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"","submitted":2554,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5671548379021154,"acs":4531,"articleLive":2,"columnArticles":67,"formTitle":"[756]金字塔转换矩阵","frequency":0.3646942899,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":7989,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4165067178502879,"acs":2387,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.4319465169,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5731,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4597426714418358,"acs":3466,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":0.6256830086,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"","submitted":7539,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6586169045005489,"acs":1800,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":0.3036065979,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"","submitted":2733,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8395353839535384,"acs":3903,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"","submitted":4649,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.58946464357286,"acs":2059,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":0.4670075484,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3493,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.6990414827188481,"acs":17576,"articleLive":2,"columnArticles":138,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":25143,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.762784594312424,"acs":79637,"articleLive":2,"columnArticles":959,"formTitle":"[763]划分字母区间","frequency":3.2103053648,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":104403,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.49542829643888353,"acs":4118,"articleLive":2,"columnArticles":53,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8312,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6654518614199382,"acs":28850,"articleLive":2,"columnArticles":437,"formTitle":"[765]情侣牵手","frequency":2.6591284455,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":43354,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7081598505778435,"acs":54597,"articleLive":2,"columnArticles":632,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":77097,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47774687902536506,"acs":39685,"articleLive":2,"columnArticles":496,"formTitle":"[767]重构字符串","frequency":1.9085566458,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":83067,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5036532385466035,"acs":5101,"articleLive":2,"columnArticles":78,"formTitle":"[768]最多能完成排序的块 II","frequency":1.1571522162,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10128,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5878598918497588,"acs":12067,"articleLive":2,"columnArticles":139,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":20527,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5525070955534531,"acs":1168,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2114,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8515728272802635,"acs":152033,"articleLive":2,"columnArticles":1105,"formTitle":"[771]宝石与石头","frequency":1.9191499652,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":178532,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.49108469539375926,"acs":5949,"articleLive":2,"columnArticles":121,"formTitle":"[772]基本计算器 III","frequency":0.8575034469,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"","submitted":12114,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7138565411298315,"acs":23049,"articleLive":2,"columnArticles":326,"formTitle":"[773]滑动谜题","frequency":2.4956330834,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":32288,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5904079382579934,"acs":1071,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.6256830086,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"","submitted":1814,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4605130091017744,"acs":5009,"articleLive":2,"columnArticles":77,"formTitle":"[775]全局倒置与局部倒置","frequency":0.3036065979,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":10877,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5690661478599222,"acs":1755,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"","submitted":3084,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.32317501169864293,"acs":5525,"articleLive":2,"columnArticles":60,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.794816469,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17096,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5953525231351297,"acs":23289,"articleLive":2,"columnArticles":346,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.3334417464,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":39118,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.43619716018684207,"acs":18770,"articleLive":2,"columnArticles":230,"formTitle":"[779]第K个语法符号","frequency":1.6641945863,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43031,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2851601262967975,"acs":3161,"articleLive":2,"columnArticles":49,"formTitle":"[780]到达终点","frequency":0.9256148727,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11085,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6186858435307081,"acs":42672,"articleLive":2,"columnArticles":650,"formTitle":"[781]森林中的兔子","frequency":4.4049533133,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":68972,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4228841049837806,"acs":1434,"articleLive":2,"columnArticles":29,"formTitle":"[782]变为棋盘","frequency":1.5989824376,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3391,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5957433959659748,"acs":69055,"articleLive":2,"columnArticles":666,"formTitle":"[783]二叉搜索树节点最小距离","frequency":1.5989824376,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":115914,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6856976781735395,"acs":42468,"articleLive":2,"columnArticles":465,"formTitle":"[784]字母大小写全排列","frequency":1.3594236984,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":61934,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5120972424739022,"acs":39686,"articleLive":2,"columnArticles":403,"formTitle":"[785]判断二分图","frequency":2.1941157216,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":77497,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.46901153585161726,"acs":4147,"articleLive":2,"columnArticles":57,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":8842,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3916860777638416,"acs":41534,"articleLive":2,"columnArticles":393,"formTitle":"[787]K 站中转内最便宜的航班","frequency":1.5133870165,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":106039,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6072516556291391,"acs":18339,"articleLive":2,"columnArticles":190,"formTitle":"[788]旋转数字","frequency":0.8255314142,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30200,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6923306971489334,"acs":20835,"articleLive":2,"columnArticles":294,"formTitle":"[789]逃脱阻碍者","frequency":1.1149987667,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30094,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4488281710045931,"acs":3811,"articleLive":2,"columnArticles":63,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.2477729518,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8491,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6946759547207364,"acs":11169,"articleLive":2,"columnArticles":200,"formTitle":"[791]自定义字符串排序","frequency":1.6309954146,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16078,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.45170212765957446,"acs":8492,"articleLive":2,"columnArticles":95,"formTitle":"[792]匹配子序列的单词数","frequency":0.7368208014,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":18800,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.39437184318127155,"acs":4919,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.2477729518,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":12473,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.34065262365995863,"acs":7245,"articleLive":2,"columnArticles":100,"formTitle":"[794]有效的井字游戏","frequency":0.2477729518,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21268,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5348120764017252,"acs":7812,"articleLive":2,"columnArticles":87,"formTitle":"[795]区间子数组个数","frequency":0.8908287567,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":14607,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5275375616469778,"acs":22998,"articleLive":2,"columnArticles":270,"formTitle":"[796]旋转字符串","frequency":2.2634195123,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":43595,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7936888128504895,"acs":41752,"articleLive":2,"columnArticles":514,"formTitle":"[797]所有可能的路径","frequency":1.1686647912,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":52605,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4635149023638232,"acs":1353,"articleLive":2,"columnArticles":33,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2919,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.40754836663495086,"acs":5140,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":2.3560783428,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":12612,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7062624254473161,"acs":1421,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"","submitted":2012,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4189776733254994,"acs":7131,"articleLive":2,"columnArticles":85,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.7652722227,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17020,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5764828886689942,"acs":30877,"articleLive":2,"columnArticles":332,"formTitle":"[802]找到最终的安全状态","frequency":2.1941157216,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":53561,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4825224654605914,"acs":12189,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25261,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7705126449821034,"acs":39394,"articleLive":2,"columnArticles":395,"formTitle":"[804]唯一摩尔斯密码词","frequency":1.1262855682,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":51127,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.29048958919527296,"acs":2581,"articleLive":2,"columnArticles":40,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":8885,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6568442010950721,"acs":13196,"articleLive":2,"columnArticles":149,"formTitle":"[806]写字符串需要的行数","frequency":0.794816469,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":20090,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8442656979761287,"acs":16269,"articleLive":2,"columnArticles":214,"formTitle":"[807]保持城市天际线","frequency":0.2215934462,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":19270,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4799156679982246,"acs":4325,"articleLive":2,"columnArticles":41,"formTitle":"[808]分汤","frequency":1.4214639017,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9012,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4188775063479555,"acs":4784,"articleLive":2,"columnArticles":88,"formTitle":"[809]情感丰富的文字","frequency":0.794816469,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11421,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7353491271820449,"acs":16513,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":1.9853993508,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22456,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7040269066448505,"acs":15490,"articleLive":2,"columnArticles":197,"formTitle":"[811]子域名访问计数","frequency":0.794816469,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22002,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6302206929283342,"acs":10623,"articleLive":2,"columnArticles":96,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":16856,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5482591093117409,"acs":6771,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":0.2477729518,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":12350,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6994440475820729,"acs":22520,"articleLive":2,"columnArticles":345,"formTitle":"[814]二叉树剪枝","frequency":0.2215934462,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":32197,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4344659795170226,"acs":26429,"articleLive":2,"columnArticles":314,"formTitle":"[815]公交路线","frequency":3.4399347535,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":60831,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5090063916327716,"acs":3504,"articleLive":2,"columnArticles":63,"formTitle":"[816]模糊坐标","frequency":0.3646942899,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":6884,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5911802394944987,"acs":13379,"articleLive":2,"columnArticles":165,"formTitle":"[817]链表组件","frequency":0.2477729518,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22631,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.4304133028075672,"acs":3572,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8299,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42092142198143023,"acs":21443,"articleLive":2,"columnArticles":245,"formTitle":"[819]最常见的单词","frequency":0.794816469,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":50943,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5068578611667209,"acs":54434,"articleLive":2,"columnArticles":598,"formTitle":"[820]单词的压缩编码","frequency":1.6641945863,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":107395,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6933434959349594,"acs":24561,"articleLive":2,"columnArticles":329,"formTitle":"[821]字符的最短距离","frequency":1.6309954146,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":35424,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5019685039370079,"acs":2805,"articleLive":2,"columnArticles":39,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5588,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4297583081570997,"acs":2845,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":0.8575034469,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6620,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6149683063350261,"acs":16590,"articleLive":2,"columnArticles":237,"formTitle":"[824]山羊拉丁文","frequency":0.2477729518,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":26977,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.39171568924737704,"acs":6459,"articleLive":2,"columnArticles":89,"formTitle":"[825]适龄的朋友","frequency":0.2750821312,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":16489,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3730719474574585,"acs":7498,"articleLive":2,"columnArticles":110,"formTitle":"[826]安排工作以达到最大收益","frequency":0.794816469,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":20098,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3907148909601748,"acs":8761,"articleLive":2,"columnArticles":177,"formTitle":"[827]最大人工岛","frequency":1.3898906398,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":22423,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4931181775035596,"acs":3117,"articleLive":2,"columnArticles":53,"formTitle":"[828]统计子串中的唯一字符","frequency":0.2750821312,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6321,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3625556564215623,"acs":8387,"articleLive":2,"columnArticles":98,"formTitle":"[829]连续整数求和","frequency":1.3898906398,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":23133,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5431494475022058,"acs":51710,"articleLive":2,"columnArticles":580,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":95204,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.40434259461824545,"acs":7393,"articleLive":2,"columnArticles":72,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18284,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7956118584301946,"acs":85288,"articleLive":2,"columnArticles":914,"formTitle":"[832]翻转图像","frequency":2.1612900172,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":107198,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4274179840217576,"acs":5029,"articleLive":2,"columnArticles":76,"formTitle":"[833]字符串中的查找与替换","frequency":0.2477729518,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":11766,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5288763464366628,"acs":13306,"articleLive":2,"columnArticles":130,"formTitle":"[834]树中距离之和","frequency":1.2922521702,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25159,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5730199701127564,"acs":4218,"articleLive":2,"columnArticles":48,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7361,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.47824021162662284,"acs":37242,"articleLive":2,"columnArticles":653,"formTitle":"[836]矩形重叠","frequency":0.8908287567,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":77873,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.3963023829087921,"acs":19292,"articleLive":2,"columnArticles":242,"formTitle":"[837]新21点","frequency":0.8255314142,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":48680,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5011822024790428,"acs":6995,"articleLive":2,"columnArticles":123,"formTitle":"[838]推多米诺","frequency":1.6309954146,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":13957,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5745073147140611,"acs":19007,"articleLive":2,"columnArticles":267,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33084,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3589516486170941,"acs":8916,"articleLive":2,"columnArticles":112,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":24839,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6567877514259982,"acs":54694,"articleLive":2,"columnArticles":539,"formTitle":"[841]钥匙和房间","frequency":1.1571522162,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":83275,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48905020753373507,"acs":28160,"articleLive":2,"columnArticles":320,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":2.0475311319,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":57581,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3780301980883779,"acs":2729,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.3334417464,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7219,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.51401979682825,"acs":86930,"articleLive":2,"columnArticles":962,"formTitle":"[844]比较含退格的字符串","frequency":1.4214639017,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":169118,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4210472824184387,"acs":37285,"articleLive":2,"columnArticles":552,"formTitle":"[845]数组中的最长山脉","frequency":1.837638469,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":88553,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5105401844532279,"acs":8525,"articleLive":2,"columnArticles":119,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":16698,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6830843017893378,"acs":18515,"articleLive":2,"columnArticles":157,"formTitle":"[847]访问所有节点的最短路径","frequency":2.7557285914,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27105,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44761373999392035,"acs":8835,"articleLive":2,"columnArticles":94,"formTitle":"[848]字母移位","frequency":0.794816469,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":19738,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.4259778041159358,"acs":15814,"articleLive":2,"columnArticles":184,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":37124,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.44785620670286463,"acs":2392,"articleLive":2,"columnArticles":41,"formTitle":"[850]矩形面积 II","frequency":0.8575034469,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5341,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.47876579756347487,"acs":4205,"articleLive":2,"columnArticles":71,"formTitle":"[851]喧闹和富有","frequency":0.2750821312,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":8783,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7148016912305928,"acs":83516,"articleLive":2,"columnArticles":716,"formTitle":"[852]山脉数组的峰顶索引","frequency":2.8498182519,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":116838,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.382488831188667,"acs":10017,"articleLive":2,"columnArticles":123,"formTitle":"[853]车队","frequency":1.6986664953,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":26189,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.3588421227749127,"acs":4314,"articleLive":2,"columnArticles":67,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12022,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.40683669854764437,"acs":4594,"articleLive":2,"columnArticles":55,"formTitle":"[855]考场就座","frequency":0.7368208014,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":11292,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6263514039044878,"acs":16106,"articleLive":2,"columnArticles":217,"formTitle":"[856]括号的分数","frequency":2.114111457,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":25714,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.4662055957246149,"acs":2966,"articleLive":2,"columnArticles":47,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.2750821312,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6362,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5539157811885085,"acs":2815,"articleLive":2,"columnArticles":48,"formTitle":"[858]镜面反射","frequency":1.4542214982,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5082,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3019229505683436,"acs":27571,"articleLive":2,"columnArticles":359,"formTitle":"[859]亲密字符串","frequency":0.2477729518,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":91318,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5873833987878141,"acs":88094,"articleLive":2,"columnArticles":758,"formTitle":"[860]柠檬水找零","frequency":1.0677893615,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":149977,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8089542213495918,"acs":31313,"articleLive":2,"columnArticles":438,"formTitle":"[861]翻转矩阵后的得分","frequency":0.1964664962,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":38708,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.19030212964849413,"acs":15879,"articleLive":2,"columnArticles":127,"formTitle":"[862]和至少为 K 的最短子数组","frequency":2.3658631567,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":83441,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6036741297427065,"acs":34701,"articleLive":2,"columnArticles":559,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":2.762526252,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":57483,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.4541277377852657,"acs":2965,"articleLive":2,"columnArticles":43,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6529,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6556828324903302,"acs":8815,"articleLive":2,"columnArticles":127,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13444,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22423490988266603,"acs":7415,"articleLive":2,"columnArticles":83,"formTitle":"[866]回文素数","frequency":0.8575034469,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":33068,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6704129492119935,"acs":83333,"articleLive":2,"columnArticles":750,"formTitle":"[867]转置矩阵","frequency":1.4214639017,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":124301,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6242262457443516,"acs":16135,"articleLive":2,"columnArticles":232,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":25848,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5514310494362532,"acs":6358,"articleLive":2,"columnArticles":95,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.2477729518,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11530,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.42749601464249865,"acs":14481,"articleLive":2,"columnArticles":184,"formTitle":"[870]优势洗牌","frequency":0.2477729518,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":33874,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3407278901520744,"acs":9231,"articleLive":2,"columnArticles":122,"formTitle":"[871]最低加油次数","frequency":2.0203924243,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":27092,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6519474318208949,"acs":60075,"articleLive":2,"columnArticles":716,"formTitle":"[872]叶子相似的树","frequency":2.5958962603,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":92147,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5090815627141878,"acs":14855,"articleLive":2,"columnArticles":108,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":1.9853993508,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":29180,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41457383983488977,"acs":20288,"articleLive":2,"columnArticles":222,"formTitle":"[874]模拟行走机器人","frequency":1.7718252505,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","questionId":"906","status":"","submitted":48937,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.4786622942160401,"acs":43497,"articleLive":2,"columnArticles":343,"formTitle":"[875]爱吃香蕉的珂珂","frequency":1.887729068,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":90872,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7058368860866564,"acs":145197,"articleLive":2,"columnArticles":1592,"formTitle":"[876]链表的中间结点","frequency":2.3304687486,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":205709,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7569206195655842,"acs":67291,"articleLive":2,"columnArticles":479,"formTitle":"[877]石子游戏","frequency":2.9418965031,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":88901,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.28048466099510183,"acs":4352,"articleLive":2,"columnArticles":61,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15516,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5549918039185076,"acs":21330,"articleLive":2,"columnArticles":181,"formTitle":"[879]盈利计划","frequency":2.9593367777,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":38433,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2519923290006392,"acs":5913,"articleLive":2,"columnArticles":76,"formTitle":"[880]索引处的解码字符串","frequency":0.2750821312,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23465,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5378812459441921,"acs":46417,"articleLive":2,"columnArticles":570,"formTitle":"[881]救生艇","frequency":2.0191635304,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":86296,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4881422924901186,"acs":1729,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3542,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6877854248408053,"acs":10693,"articleLive":2,"columnArticles":108,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15547,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6610356477970075,"acs":19174,"articleLive":2,"columnArticles":248,"formTitle":"[884]两句话中的不常见单词","frequency":0.8575034469,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":29006,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6901172529313233,"acs":4532,"articleLive":2,"columnArticles":68,"formTitle":"[885]螺旋矩阵 III","frequency":1.4214639017,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6567,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4236590816741162,"acs":8341,"articleLive":2,"columnArticles":110,"formTitle":"[886]可能的二分法","frequency":0.2750821312,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":19688,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2916388268092067,"acs":50632,"articleLive":2,"columnArticles":334,"formTitle":"[887]鸡蛋掉落","frequency":3.0693153162,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":173612,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6399966835254125,"acs":54033,"articleLive":2,"columnArticles":453,"formTitle":"[888]公平的糖果棒交换","frequency":0.2477729518,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":84427,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6773305658334086,"acs":15011,"articleLive":2,"columnArticles":146,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":2.0802271379,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":22162,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7264686248331108,"acs":8706,"articleLive":2,"columnArticles":121,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":11984,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3297063297063297,"acs":2818,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8547,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6387390164945275,"acs":33148,"articleLive":2,"columnArticles":681,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":51896,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7241519398740606,"acs":10695,"articleLive":2,"columnArticles":104,"formTitle":"[893]特殊等价字符串组","frequency":0.3036065979,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14769,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7747196738022426,"acs":12920,"articleLive":2,"columnArticles":121,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":16677,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5424012764260072,"acs":6799,"articleLive":2,"columnArticles":80,"formTitle":"[895]最大频率栈","frequency":1.4214639017,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":12535,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5864725092562263,"acs":59083,"articleLive":2,"columnArticles":715,"formTitle":"[896]单调数列","frequency":0.8575034469,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":100743,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7449014152655135,"acs":61581,"articleLive":2,"columnArticles":701,"formTitle":"[897]递增顺序搜索树","frequency":2.6591284455,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":82670,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3370253164556962,"acs":5325,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":1.1891993936,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15800,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5367275553828216,"acs":4143,"articleLive":2,"columnArticles":45,"formTitle":"[899]有序队列","frequency":0.2477729518,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7719,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4928165219994014,"acs":3293,"articleLive":2,"columnArticles":44,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6682,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5439457141178544,"acs":18517,"articleLive":2,"columnArticles":226,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":34042,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.3277260438570141,"acs":3273,"articleLive":2,"columnArticles":74,"formTitle":"[902]最大为 N 的数字组合","frequency":0.8908287567,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":9987,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.529981718464351,"acs":2899,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.580054656,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5470,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.45367532651232967,"acs":19244,"articleLive":2,"columnArticles":264,"formTitle":"[904]水果成篮","frequency":1.8041382395,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":42418,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7012287473128787,"acs":57411,"articleLive":2,"columnArticles":594,"formTitle":"[905]按奇偶排序数组","frequency":1.1262855682,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":81872,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2753306793373571,"acs":2144,"articleLive":2,"columnArticles":37,"formTitle":"[906]超级回文数","frequency":1.5605161568,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7787,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.31664419131782057,"acs":11036,"articleLive":2,"columnArticles":124,"formTitle":"[907]子数组的最小值之和","frequency":1.6986664953,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":34853,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6982694011037678,"acs":20497,"articleLive":2,"columnArticles":187,"formTitle":"[908]最小差值 I","frequency":0.2477729518,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":29354,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.45938718028962416,"acs":16147,"articleLive":2,"columnArticles":191,"formTitle":"[909]蛇梯棋","frequency":1.8724124874,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35149,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.31813739861233264,"acs":6511,"articleLive":2,"columnArticles":66,"formTitle":"[910]最小差值 II","frequency":0.2750821312,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20466,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4256848649698854,"acs":4382,"articleLive":2,"columnArticles":66,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":10294,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5621708202299062,"acs":220412,"articleLive":2,"columnArticles":1023,"formTitle":"[912]排序数组","frequency":4.1124529689,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":392073,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.4061891365505302,"acs":1877,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":0.4319465169,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4621,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.38887913701209587,"acs":48739,"articleLive":2,"columnArticles":612,"formTitle":"[914]卡牌分组","frequency":0.794816469,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":125332,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46778612012987014,"acs":9221,"articleLive":2,"columnArticles":113,"formTitle":"[915]分割数组","frequency":0.7652722227,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":19712,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4407420371018551,"acs":6296,"articleLive":2,"columnArticles":70,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14285,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5702774939077117,"acs":29018,"articleLive":2,"columnArticles":433,"formTitle":"[917]仅仅反转字母","frequency":1.1571522162,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":50884,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.35767099714453204,"acs":18914,"articleLive":2,"columnArticles":213,"formTitle":"[918]环形子数组的最大和","frequency":1.9085566458,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":52881,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6292736342620757,"acs":5172,"articleLive":2,"columnArticles":92,"formTitle":"[919]完全二叉树插入器","frequency":0.3036065979,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8219,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.4819499341238472,"acs":1829,"articleLive":2,"columnArticles":19,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3795,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7363880436728119,"acs":20571,"articleLive":2,"columnArticles":300,"formTitle":"[921]使括号有效的最少添加","frequency":0.2215934462,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":27935,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7141190384861271,"acs":89362,"articleLive":2,"columnArticles":820,"formTitle":"[922]按奇偶排序数组 II","frequency":1.1891993936,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":125136,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.33800494641385,"acs":6150,"articleLive":2,"columnArticles":81,"formTitle":"[923]三数之和的多种可能","frequency":0.8255314142,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18195,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35952492394102503,"acs":6145,"articleLive":2,"columnArticles":89,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":17092,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.38789260267175274,"acs":50030,"articleLive":2,"columnArticles":669,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":128979,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5185863249223911,"acs":6515,"articleLive":2,"columnArticles":118,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.8255314142,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":12563,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.33901665344964316,"acs":3420,"articleLive":2,"columnArticles":68,"formTitle":"[927]三等分","frequency":1.7345074875,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10088,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.41986933128362797,"acs":2185,"articleLive":2,"columnArticles":41,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5204,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.643256002842784,"acs":25343,"articleLive":2,"columnArticles":227,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":39398,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5451453862049889,"acs":33503,"articleLive":2,"columnArticles":337,"formTitle":"[930]和相同的二元子数组","frequency":2.6221419811,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":61457,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.661513949625411,"acs":19514,"articleLive":2,"columnArticles":251,"formTitle":"[931]下降路径最小和","frequency":1.1262855682,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":29499,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.629505192425168,"acs":8244,"articleLive":2,"columnArticles":79,"formTitle":"[932]漂亮数组","frequency":0.2477729518,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13096,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.724714250472823,"acs":35253,"articleLive":2,"columnArticles":299,"formTitle":"[933]最近的请求次数","frequency":1.6309954146,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":48644,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4751238602772805,"acs":22824,"articleLive":2,"columnArticles":257,"formTitle":"[934]最短的桥","frequency":1.8041382395,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":48038,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4743599904890227,"acs":5985,"articleLive":2,"columnArticles":79,"formTitle":"[935]骑士拨号器","frequency":0.2750821312,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12617,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37862633275477314,"acs":1527,"articleLive":2,"columnArticles":24,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4033,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.587368210663069,"acs":11755,"articleLive":2,"columnArticles":124,"formTitle":"[937]重新排列日志文件","frequency":0.8255314142,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":20013,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8183735247100439,"acs":96244,"articleLive":2,"columnArticles":793,"formTitle":"[938]二叉搜索树的范围和","frequency":2.2634195123,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":117604,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.45129732028923863,"acs":5305,"articleLive":2,"columnArticles":61,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":11755,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.4193078636285763,"acs":4895,"articleLive":2,"columnArticles":63,"formTitle":"[940]不同的子序列 II","frequency":0.2215934462,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":11674,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.39237225533649195,"acs":61615,"articleLive":2,"columnArticles":610,"formTitle":"[941]有效的山脉数组","frequency":0.2750821312,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":157032,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7299346405228758,"acs":22336,"articleLive":2,"columnArticles":210,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":30600,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4710765239948119,"acs":1816,"articleLive":2,"columnArticles":41,"formTitle":"[943]最短超级串","frequency":0.5371296113,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":3855,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6893760650150741,"acs":21037,"articleLive":2,"columnArticles":179,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30516,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4861746705629376,"acs":35271,"articleLive":2,"columnArticles":535,"formTitle":"[945]使数组唯一的最小增量","frequency":0.8255314142,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":72548,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6227446947742358,"acs":26646,"articleLive":2,"columnArticles":292,"formTitle":"[946]验证栈序列","frequency":2.3560783428,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":42788,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6126072732445119,"acs":25841,"articleLive":2,"columnArticles":333,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":42182,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.39127141358815987,"acs":6715,"articleLive":2,"columnArticles":93,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17162,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.37057870578705787,"acs":8235,"articleLive":2,"columnArticles":115,"formTitle":"[949]给定数字能组成的最大时间","frequency":1.8041382395,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":22222,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7734625240230621,"acs":9659,"articleLive":2,"columnArticles":141,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.8255314142,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12488,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6636962890625,"acs":10874,"articleLive":2,"columnArticles":162,"formTitle":"[951]翻转等价二叉树","frequency":0.8575034469,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":16384,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3496266915538964,"acs":2997,"articleLive":2,"columnArticles":54,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8572,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5529747351263243,"acs":13570,"articleLive":2,"columnArticles":161,"formTitle":"[953]验证外星语词典","frequency":1.1262855682,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":24540,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.29983155530600786,"acs":6942,"articleLive":2,"columnArticles":102,"formTitle":"[954]二倍数对数组","frequency":1.4214639017,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":23153,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3293381969775925,"acs":3160,"articleLive":2,"columnArticles":47,"formTitle":"[955]删列造序 II","frequency":0.3646942899,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9595,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.43630573248407645,"acs":3973,"articleLive":2,"columnArticles":50,"formTitle":"[956]最高的广告牌","frequency":1.1891993936,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9106,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.35978126289723483,"acs":13948,"articleLive":2,"columnArticles":137,"formTitle":"[957]N 天后的牢房","frequency":1.4214639017,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":38768,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5361945892725279,"acs":23962,"articleLive":2,"columnArticles":219,"formTitle":"[958]二叉树的完全性检验","frequency":1.5093166755,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":44689,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7433157114060777,"acs":19544,"articleLive":2,"columnArticles":303,"formTitle":"[959]由斜杠划分区域","frequency":1.2225136003,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26293,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5529980107985223,"acs":1946,"articleLive":2,"columnArticles":31,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3519,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6763992989521572,"acs":36278,"articleLive":2,"columnArticles":295,"formTitle":"[961]重复 N 次的元素","frequency":0.8255314142,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":53634,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.44175491679273826,"acs":13140,"articleLive":2,"columnArticles":124,"formTitle":"[962]最大宽度坡","frequency":0.8575034469,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":29745,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5010076582023377,"acs":2486,"articleLive":2,"columnArticles":31,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":4962,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.42620481927710846,"acs":1415,"articleLive":2,"columnArticles":25,"formTitle":"[964]表示数字的最少运算符","frequency":0.6743307328,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3320,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6837619397501837,"acs":32571,"articleLive":2,"columnArticles":383,"formTitle":"[965]单值二叉树","frequency":0.2477729518,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":47635,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.4015464604719371,"acs":3012,"articleLive":2,"columnArticles":48,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7501,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.4618208516886931,"acs":7548,"articleLive":2,"columnArticles":147,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16344,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.49789458695254174,"acs":24476,"articleLive":2,"columnArticles":322,"formTitle":"[968]监控二叉树","frequency":1.887729068,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":49159,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6527904650050024,"acs":15007,"articleLive":2,"columnArticles":194,"formTitle":"[969]煎饼排序","frequency":0.2215934462,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":22989,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4145584002423875,"acs":10946,"articleLive":2,"columnArticles":123,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26404,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4415250888976689,"acs":6705,"articleLive":2,"columnArticles":102,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.3036065979,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15186,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.41050583657587547,"acs":1266,"articleLive":2,"columnArticles":26,"formTitle":"[972]相等的有理数","frequency":0.6256830086,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3084,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6398183441667546,"acs":66639,"articleLive":2,"columnArticles":634,"formTitle":"[973]最接近原点的 K 个点","frequency":0.2215934462,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":104153,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4657851448816905,"acs":36811,"articleLive":2,"columnArticles":382,"formTitle":"[974]和可被 K 整除的子数组","frequency":2.5915351543,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":79030,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4458944281524927,"acs":3041,"articleLive":2,"columnArticles":45,"formTitle":"[975]奇偶跳","frequency":0.2750821312,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6820,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5973537307230066,"acs":53183,"articleLive":2,"columnArticles":495,"formTitle":"[976]三角形的最大周长","frequency":1.1571522162,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":89031,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7128623228410792,"acs":161407,"articleLive":2,"columnArticles":1263,"formTitle":"[977]有序数组的平方","frequency":2.4909479174,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":226421,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47336971501019787,"acs":42937,"articleLive":2,"columnArticles":595,"formTitle":"[978]最长湍流子数组","frequency":0.2477729518,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":90705,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7118251928020566,"acs":8307,"articleLive":2,"columnArticles":131,"formTitle":"[979]在二叉树中分配硬币","frequency":1.1891993936,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11670,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7339234574329602,"acs":14095,"articleLive":2,"columnArticles":207,"formTitle":"[980]不同路径 III","frequency":1.6641945863,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":19205,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5330437637314074,"acs":21108,"articleLive":2,"columnArticles":309,"formTitle":"[981]基于时间的键值存储","frequency":2.6191231109,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":39599,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5453951665578054,"acs":2505,"articleLive":2,"columnArticles":25,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4593,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6339926103021082,"acs":32087,"articleLive":2,"columnArticles":451,"formTitle":"[983]最低票价","frequency":2.0802271379,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":50611,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4163629567330156,"acs":8911,"articleLive":2,"columnArticles":139,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":21402,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.5996957554170377,"acs":16163,"articleLive":2,"columnArticles":184,"formTitle":"[985]查询后的偶数和","frequency":0.2477729518,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":26952,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6764631931834055,"acs":24214,"articleLive":2,"columnArticles":230,"formTitle":"[986]区间列表的交集","frequency":2.2634195123,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":35795,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5325796938632215,"acs":22755,"articleLive":2,"columnArticles":406,"formTitle":"[987]二叉树的垂序遍历","frequency":2.5521890415,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":42726,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4983523725834798,"acs":9074,"articleLive":2,"columnArticles":109,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.2215934462,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":18208,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.47172220210068816,"acs":52097,"articleLive":2,"columnArticles":589,"formTitle":"[989]数组形式的整数加法","frequency":0.8255314142,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":110440,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5022207349720127,"acs":33018,"articleLive":2,"columnArticles":494,"formTitle":"[990]等式方程的可满足性","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":65744,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5174261120809005,"acs":8596,"articleLive":2,"columnArticles":108,"formTitle":"[991]坏了的计算器","frequency":0.2477729518,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16613,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.4520896847142361,"acs":23430,"articleLive":2,"columnArticles":270,"formTitle":"[992]K 个不同整数的子数组","frequency":0.8255314142,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":51826,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5569723576518344,"acs":50494,"articleLive":2,"columnArticles":796,"formTitle":"[993]二叉树的堂兄弟节点","frequency":2.4408748795,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":90658,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5088078813942525,"acs":52886,"articleLive":2,"columnArticles":1377,"formTitle":"[994]腐烂的橘子","frequency":1.5382103993,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":103941,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5396729101893278,"acs":21350,"articleLive":2,"columnArticles":250,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.2750821312,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39561,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49463243873978996,"acs":4239,"articleLive":2,"columnArticles":84,"formTitle":"[996]正方形数组的数目","frequency":0.8575034469,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8570,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.511317663094703,"acs":35262,"articleLive":2,"columnArticles":380,"formTitle":"[997]找到小镇的法官","frequency":0.7368208014,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":68963,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6146171317326411,"acs":7577,"articleLive":2,"columnArticles":108,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12328,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6908157444381061,"acs":30275,"articleLive":2,"columnArticles":567,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.2477729518,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":43825,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4089950808151792,"acs":3492,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":1.6641945863,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8538,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2921839729119639,"acs":2071,"articleLive":2,"columnArticles":50,"formTitle":"[1001]网格照明","frequency":0.5371296113,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7088,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.736785639522713,"acs":56314,"articleLive":2,"columnArticles":595,"formTitle":"[1002]查找常用字符","frequency":1.887729068,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":76432,"title":"查找常用字符","titleSlug":"find-common-characters"},{"acceptance":0.5766668264391507,"acs":12031,"articleLive":2,"columnArticles":181,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":20863,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5972111984991703,"acs":66214,"articleLive":2,"columnArticles":693,"formTitle":"[1004]最大连续1的个数 III","frequency":2.4088977345,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":110872,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5335532130461963,"acs":24751,"articleLive":2,"columnArticles":405,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":1.0677893615,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":46389,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6274373259052924,"acs":44149,"articleLive":2,"columnArticles":599,"formTitle":"[1006]笨阶乘","frequency":2.4232997346,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70364,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.464721643346234,"acs":6244,"articleLive":2,"columnArticles":82,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13436,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7255493321844033,"acs":16840,"articleLive":2,"columnArticles":216,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":1.7718252505,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":23210,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5931020968058005,"acs":15133,"articleLive":2,"columnArticles":206,"formTitle":"[1009]十进制整数的反码","frequency":0.2477729518,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":25515,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.4509474930911962,"acs":18276,"articleLive":2,"columnArticles":240,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.2750821312,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40528,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6269719244297479,"acs":59536,"articleLive":2,"columnArticles":571,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":3.3728949132,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":94958,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3305056736807315,"acs":3000,"articleLive":2,"columnArticles":63,"formTitle":"[1012]至少有 1 位重复的数字","frequency":1.2571911387,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9077,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.3976497896416655,"acs":46597,"articleLive":2,"columnArticles":915,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":1.7718252505,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":117181,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.548626610719281,"acs":36871,"articleLive":2,"columnArticles":435,"formTitle":"[1014]最佳观光组合","frequency":0.7368208014,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":67206,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35401432897555213,"acs":4793,"articleLive":2,"columnArticles":40,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.8575034469,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13539,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5832480963745881,"acs":5132,"articleLive":2,"columnArticles":78,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8799,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5610656395442144,"acs":3496,"articleLive":2,"columnArticles":55,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6231,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5164691314346365,"acs":43794,"articleLive":2,"columnArticles":375,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":84795,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.597553663508814,"acs":19932,"articleLive":2,"columnArticles":259,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.2215934462,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":33356,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5365595196043801,"acs":9114,"articleLive":2,"columnArticles":133,"formTitle":"[1020]飞地的数量","frequency":0.794816469,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":16986,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7835083976147492,"acs":57287,"articleLive":2,"columnArticles":648,"formTitle":"[1021]删除最外层的括号","frequency":1.1262855682,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":73116,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7035144927536232,"acs":19417,"articleLive":2,"columnArticles":256,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.2215934462,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":27600,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5651926516013657,"acs":6953,"articleLive":2,"columnArticles":150,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12302,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5578424414478353,"acs":33012,"articleLive":2,"columnArticles":377,"formTitle":"[1024]视频拼接","frequency":0.8255314142,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":59178,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7096140150975645,"acs":74733,"articleLive":2,"columnArticles":643,"formTitle":"[1025]除数博弈","frequency":1.887729068,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":105315,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6695860417379405,"acs":9786,"articleLive":2,"columnArticles":164,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14615,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4331176195876976,"acs":12984,"articleLive":2,"columnArticles":118,"formTitle":"[1027]最长等差数列","frequency":1.6986664953,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":29978,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7315974870174674,"acs":20146,"articleLive":2,"columnArticles":420,"formTitle":"[1028]从先序遍历还原二叉树","frequency":1.1571522162,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27537,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6549532119872074,"acs":16588,"articleLive":2,"columnArticles":179,"formTitle":"[1029]两地调度","frequency":0.1964664962,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":25327,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7113325690096128,"acs":40329,"articleLive":2,"columnArticles":442,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":56695,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5666983147400902,"acs":4775,"articleLive":2,"columnArticles":71,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.2750821312,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8426,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39650238473767885,"acs":2494,"articleLive":2,"columnArticles":38,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6290,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.39010851269562724,"acs":10893,"articleLive":2,"columnArticles":163,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":27923,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.43277975484381176,"acs":4378,"articleLive":2,"columnArticles":93,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10116,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6310383624287736,"acs":34774,"articleLive":2,"columnArticles":373,"formTitle":"[1035]不相交的线","frequency":2.7445044991,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":55106,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.2990320458603515,"acs":3182,"articleLive":2,"columnArticles":52,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10641,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43876794812413156,"acs":9473,"articleLive":2,"columnArticles":109,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":21590,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7933137492815633,"acs":24845,"articleLive":2,"columnArticles":315,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.1490979442,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":31318,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5543982933868742,"acs":4418,"articleLive":2,"columnArticles":58,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":7969,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5228406144025534,"acs":2621,"articleLive":2,"columnArticles":29,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5013,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.4814335990806579,"acs":6703,"articleLive":2,"columnArticles":110,"formTitle":"[1041]困于环中的机器人","frequency":1.4214639017,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":13923,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5288425403983464,"acs":11258,"articleLive":2,"columnArticles":149,"formTitle":"[1042]不邻接植花","frequency":0.8575034469,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":21288,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6902920571376581,"acs":7587,"articleLive":2,"columnArticles":98,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":10991,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20902738432483475,"acs":5534,"articleLive":2,"columnArticles":71,"formTitle":"[1044]最长重复子串","frequency":2.6923761887,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":26475,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6422923353949738,"acs":8204,"articleLive":2,"columnArticles":104,"formTitle":"[1045]买下所有产品的客户","frequency":0.2477729518,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"","submitted":12773,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6596337055673109,"acs":65154,"articleLive":2,"columnArticles":905,"formTitle":"[1046]最后一块石头的重量","frequency":1.3299924982,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":98773,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.725068236515833,"acs":103336,"articleLive":2,"columnArticles":965,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":2.8059331529,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":142519,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.45159726598477873,"acs":9316,"articleLive":2,"columnArticles":128,"formTitle":"[1048]最长字符串链","frequency":1.9853993508,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":20629,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6435297573948943,"acs":41619,"articleLive":2,"columnArticles":395,"formTitle":"[1049]最后一块石头的重量 II","frequency":2.8856070249,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":64673,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7578940095349962,"acs":10969,"articleLive":2,"columnArticles":53,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.794816469,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"","submitted":14473,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7532816083540721,"acs":30874,"articleLive":2,"columnArticles":363,"formTitle":"[1051]高度检查器","frequency":0.2750821312,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":40986,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.581126918665658,"acs":47628,"articleLive":2,"columnArticles":744,"formTitle":"[1052]爱生气的书店老板","frequency":0.8575034469,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":81958,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4585115483319076,"acs":5896,"articleLive":2,"columnArticles":94,"formTitle":"[1053]交换一次的先前排列","frequency":0.8255314142,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":12859,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37576657723265616,"acs":7843,"articleLive":2,"columnArticles":105,"formTitle":"[1054]距离相等的条形码","frequency":0.794816469,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":20872,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5841571279916753,"acs":4491,"articleLive":2,"columnArticles":81,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"","submitted":7688,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4087213599408721,"acs":3318,"articleLive":2,"columnArticles":61,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"","submitted":8118,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.46570453134698947,"acs":3001,"articleLive":2,"columnArticles":36,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"","submitted":6444,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3405250844814141,"acs":1310,"articleLive":2,"columnArticles":28,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"","submitted":3847,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.3596002621231979,"acs":2195,"articleLive":2,"columnArticles":36,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"","submitted":6104,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.528508495909377,"acs":4199,"articleLive":2,"columnArticles":61,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.3036065979,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"","submitted":7945,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6025726325127523,"acs":2717,"articleLive":2,"columnArticles":57,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"","submitted":4509,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5402243589743589,"acs":3371,"articleLive":2,"columnArticles":43,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"","submitted":6240,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7016725009723843,"acs":1804,"articleLive":2,"columnArticles":38,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"","submitted":2571,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6511276127612762,"acs":4735,"articleLive":2,"columnArticles":67,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"","submitted":7272,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5391539153915391,"acs":2396,"articleLive":2,"columnArticles":68,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"","submitted":4444,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.4745042492917847,"acs":2010,"articleLive":2,"columnArticles":40,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"","submitted":4236,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.42171189979123175,"acs":808,"articleLive":2,"columnArticles":25,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"","submitted":1916,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8638234698697618,"acs":12801,"articleLive":2,"columnArticles":61,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"","submitted":14819,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8202911737943585,"acs":10818,"articleLive":2,"columnArticles":53,"formTitle":"[1069]产品销售分析 II","frequency":0.2750821312,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"","submitted":13188,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48386065835730263,"acs":7570,"articleLive":2,"columnArticles":70,"formTitle":"[1070]产品销售分析 III","frequency":0.2477729518,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"","submitted":15645,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5866666666666667,"acs":34452,"articleLive":2,"columnArticles":668,"formTitle":"[1071]字符串的最大公因子","frequency":0.8255314142,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":58725,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5791991495393338,"acs":3269,"articleLive":2,"columnArticles":52,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.3334417464,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5644,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.33629692351114876,"acs":2383,"articleLive":2,"columnArticles":51,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7086,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6695718765954343,"acs":18361,"articleLive":2,"columnArticles":184,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":2.1941157216,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27422,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6925789750131313,"acs":9230,"articleLive":2,"columnArticles":69,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"","submitted":13327,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.49589178356713426,"acs":9898,"articleLive":2,"columnArticles":84,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"","submitted":19960,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7217107217107217,"acs":7290,"articleLive":2,"columnArticles":87,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"","submitted":10101,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6219551454018671,"acs":11592,"articleLive":2,"columnArticles":176,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":18638,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7336736723463502,"acs":11066,"articleLive":2,"columnArticles":186,"formTitle":"[1079]活字印刷","frequency":0.2477729518,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15083,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.490356170867353,"acs":4144,"articleLive":2,"columnArticles":86,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8451,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5712634054937608,"acs":14329,"articleLive":2,"columnArticles":138,"formTitle":"[1081]不同字符的最小子序列","frequency":1.9516807148,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":25083,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.760772761526341,"acs":11105,"articleLive":2,"columnArticles":91,"formTitle":"[1082]销售分析 I ","frequency":0.2477729518,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"","submitted":14597,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5279564315352697,"acs":10179,"articleLive":2,"columnArticles":94,"formTitle":"[1083]销售分析 II","frequency":0.794816469,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"","submitted":19280,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5370788935529006,"acs":9980,"articleLive":2,"columnArticles":93,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"","submitted":18582,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7730802415875755,"acs":3584,"articleLive":2,"columnArticles":72,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"","submitted":4636,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6892468676855293,"acs":5006,"articleLive":2,"columnArticles":79,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"","submitted":7263,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5312033442818752,"acs":1779,"articleLive":2,"columnArticles":52,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"","submitted":3349,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.44609991235758106,"acs":1018,"articleLive":2,"columnArticles":33,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"","submitted":2282,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5857472679698322,"acs":19028,"articleLive":2,"columnArticles":279,"formTitle":"[1089]复写零","frequency":0.2477729518,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":32485,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5430575035063113,"acs":3872,"articleLive":2,"columnArticles":77,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7130,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3780935631375308,"acs":26873,"articleLive":2,"columnArticles":274,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":1.9853993508,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":71075,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4881110899752711,"acs":2566,"articleLive":2,"columnArticles":48,"formTitle":"[1092]最短公共超序列","frequency":0.8575034469,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5257,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.38003958745702676,"acs":3648,"articleLive":2,"columnArticles":56,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9599,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6110915946509285,"acs":26093,"articleLive":2,"columnArticles":369,"formTitle":"[1094]拼车","frequency":1.3299924982,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":42699,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3726252489658342,"acs":19457,"articleLive":2,"columnArticles":381,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":52216,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5498338870431894,"acs":1655,"articleLive":2,"columnArticles":46,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3010,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5184275184275184,"acs":5908,"articleLive":2,"columnArticles":104,"formTitle":"[1097]游戏玩法分析 V","frequency":1.6641945863,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"","submitted":11396,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.47191310721663227,"acs":7082,"articleLive":2,"columnArticles":99,"formTitle":"[1098]小众书籍","frequency":0.2215934462,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"","submitted":15007,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.579958399608467,"acs":4740,"articleLive":2,"columnArticles":87,"formTitle":"[1099]小于 K 的两数之和","frequency":0.2750821312,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"","submitted":8173,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.7009906515976001,"acs":5024,"articleLive":2,"columnArticles":96,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"","submitted":7167,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6698113207547169,"acs":2343,"articleLive":2,"columnArticles":50,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"","submitted":3498,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.36780445472953427,"acs":5086,"articleLive":2,"columnArticles":65,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"","submitted":13828,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6369897591230348,"acs":35330,"articleLive":2,"columnArticles":1095,"formTitle":"[1103]分糖果 II","frequency":0.7652722227,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":55464,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7609898185510809,"acs":28477,"articleLive":2,"columnArticles":666,"formTitle":"[1104]二叉树寻路","frequency":2.1612900172,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37421,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5579004920721706,"acs":5102,"articleLive":2,"columnArticles":65,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9145,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.573840830449827,"acs":4146,"articleLive":2,"columnArticles":123,"formTitle":"[1106]解析布尔表达式","frequency":0.8908287567,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7225,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4104109237771652,"acs":6402,"articleLive":2,"columnArticles":87,"formTitle":"[1107]每日新用户统计","frequency":0.2477729518,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"","submitted":15599,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8392584844551424,"acs":66596,"articleLive":2,"columnArticles":677,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":79351,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5760223698007689,"acs":57680,"articleLive":2,"columnArticles":575,"formTitle":"[1109]航班预订统计","frequency":1.3109152313,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":100135,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6291565987803475,"acs":10936,"articleLive":2,"columnArticles":200,"formTitle":"[1110]删点成林","frequency":1.1262855682,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":17382,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.771417570429314,"acs":24042,"articleLive":2,"columnArticles":396,"formTitle":"[1111]有效括号的嵌套深度","frequency":1.1891993936,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31166,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6428757942379667,"acs":7386,"articleLive":2,"columnArticles":82,"formTitle":"[1112]每位学生的最高成绩","frequency":0.2750821312,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"","submitted":11489,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5401217038539554,"acs":6657,"articleLive":2,"columnArticles":47,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"","submitted":12325,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.653146348999279,"acs":76102,"articleLive":2,"columnArticles":570,"formTitle":"[1114]按序打印","frequency":3.9134463824,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":116516,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.562405275333032,"acs":42303,"articleLive":2,"columnArticles":476,"formTitle":"[1115]交替打印FooBar","frequency":2.3560783428,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":75218,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5179251231987295,"acs":22176,"articleLive":2,"columnArticles":363,"formTitle":"[1116]打印零与奇偶数","frequency":2.7268132723,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":42817,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.520702634880803,"acs":17015,"articleLive":2,"columnArticles":250,"formTitle":"[1117]H2O 生成","frequency":2.1941157216,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":32677,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6417785234899329,"acs":2295,"articleLive":2,"columnArticles":36,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"","submitted":3576,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8663174436877946,"acs":8269,"articleLive":2,"columnArticles":143,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"","submitted":9545,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6082230623818525,"acs":2574,"articleLive":2,"columnArticles":47,"formTitle":"[1120]子树的最大平均值","frequency":0.3646942899,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"","submitted":4232,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.575451647183847,"acs":1083,"articleLive":2,"columnArticles":17,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"","submitted":1882,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7072113692361844,"acs":64294,"articleLive":2,"columnArticles":863,"formTitle":"[1122]数组的相对排序","frequency":2.3890945469,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":90912,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7055896205456322,"acs":7940,"articleLive":2,"columnArticles":102,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11253,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.31705535687301667,"acs":12589,"articleLive":2,"columnArticles":128,"formTitle":"[1124]表现良好的最长时间段","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":39706,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4908196721311475,"acs":2994,"articleLive":2,"columnArticles":49,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6100,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6934852260590958,"acs":5844,"articleLive":2,"columnArticles":87,"formTitle":"[1126]查询活跃业务","frequency":0.794816469,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"","submitted":8427,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4132348147343258,"acs":3803,"articleLive":2,"columnArticles":69,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"","submitted":9203,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5446790926934373,"acs":36908,"articleLive":2,"columnArticles":476,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.7652722227,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":67761,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3799034772924143,"acs":6140,"articleLive":2,"columnArticles":110,"formTitle":"[1129]颜色交替的最短路径","frequency":0.8908287567,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16162,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6272048479601775,"acs":5796,"articleLive":2,"columnArticles":98,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.3334417464,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9241,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.45412224057666317,"acs":3024,"articleLive":2,"columnArticles":45,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6659,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3885907202216066,"acs":4489,"articleLive":2,"columnArticles":51,"formTitle":"[1132]报告的记录 II","frequency":0.794816469,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"","submitted":11552,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6441855254313242,"acs":2875,"articleLive":2,"columnArticles":61,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"","submitted":4463,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7746653445711452,"acs":3125,"articleLive":2,"columnArticles":52,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"","submitted":4034,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5341067690160503,"acs":6123,"articleLive":2,"columnArticles":70,"formTitle":"[1135]最低成本联通所有城市","frequency":0.8575034469,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"","submitted":11464,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5689398767792649,"acs":2678,"articleLive":2,"columnArticles":47,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"","submitted":4707,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6072704123813618,"acs":73453,"articleLive":2,"columnArticles":827,"formTitle":"[1137]第 N 个泰波那契数","frequency":1.7189727923,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":120956,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43257342957192885,"acs":6053,"articleLive":2,"columnArticles":137,"formTitle":"[1138]字母板上的路径","frequency":0.3036065979,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":13993,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.47701831312870774,"acs":9247,"articleLive":2,"columnArticles":148,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.794816469,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":19385,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6532940019665683,"acs":6644,"articleLive":2,"columnArticles":93,"formTitle":"[1140]石子游戏 II","frequency":0.3646942899,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10170,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5109600590157024,"acs":9697,"articleLive":2,"columnArticles":64,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.8255314142,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"","submitted":18978,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.37107889078780526,"acs":6731,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"","submitted":18139,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6341765328328708,"acs":158820,"articleLive":2,"columnArticles":1072,"formTitle":"[1143]最长公共子序列","frequency":3.905235077,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":250435,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44163028914725333,"acs":10218,"articleLive":2,"columnArticles":144,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":1.1571522162,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23137,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4690773425168604,"acs":6538,"articleLive":2,"columnArticles":105,"formTitle":"[1145]二叉树着色游戏","frequency":0.9619825169,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":13938,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2856745092579702,"acs":4104,"articleLive":2,"columnArticles":60,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":14366,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5608250315700856,"acs":3997,"articleLive":2,"columnArticles":77,"formTitle":"[1147]段式回文","frequency":1.6986664953,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7127,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7169775589432819,"acs":7572,"articleLive":2,"columnArticles":35,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"","submitted":10561,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.4421786267423851,"acs":5139,"articleLive":2,"columnArticles":45,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"","submitted":11622,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6058878132873624,"acs":4569,"articleLive":2,"columnArticles":80,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.8575034469,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"","submitted":7541,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.4831284646902868,"acs":4009,"articleLive":2,"columnArticles":56,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.8575034469,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"","submitted":8298,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3861788617886179,"acs":1330,"articleLive":2,"columnArticles":31,"formTitle":"[1152]用户网站访问行为分析","frequency":0.580054656,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"","submitted":3444,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.37053472376303526,"acs":1670,"articleLive":2,"columnArticles":23,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"","submitted":4507,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5682139538641781,"acs":14065,"articleLive":2,"columnArticles":219,"formTitle":"[1154]一年中的第几天","frequency":1.3898906398,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":24753,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4800853485064011,"acs":9450,"articleLive":2,"columnArticles":124,"formTitle":"[1155]掷骰子的N种方法","frequency":0.2750821312,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":19684,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4338379341050757,"acs":4872,"articleLive":2,"columnArticles":78,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11230,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.3172669491525424,"acs":2995,"articleLive":2,"columnArticles":44,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9440,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5499843961302403,"acs":5287,"articleLive":2,"columnArticles":60,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"","submitted":9613,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.4875016708996123,"acs":3647,"articleLive":2,"columnArticles":80,"formTitle":"[1159]市场分析 II","frequency":0.794816469,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"","submitted":7481,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6872055008086002,"acs":59066,"articleLive":2,"columnArticles":904,"formTitle":"[1160]拼写单词","frequency":0.7652722227,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":85951,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.632687961888475,"acs":10359,"articleLive":2,"columnArticles":169,"formTitle":"[1161]最大层内元素和","frequency":0.794816469,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16373,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4690812830123329,"acs":37921,"articleLive":2,"columnArticles":491,"formTitle":"[1162]地图分析","frequency":1.1571522162,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":80841,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.26729805526182704,"acs":5814,"articleLive":2,"columnArticles":96,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":21751,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6093663300410609,"acs":5491,"articleLive":2,"columnArticles":80,"formTitle":"[1164]指定日期的产品价格","frequency":0.8575034469,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"","submitted":9011,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8389546571364753,"acs":7512,"articleLive":2,"columnArticles":112,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"","submitted":8954,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4851687059695958,"acs":2617,"articleLive":2,"columnArticles":47,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"","submitted":5394,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.42897835169008736,"acs":2259,"articleLive":2,"columnArticles":34,"formTitle":"[1167]连接棒材的最低费用","frequency":0.3974841127,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"","submitted":5266,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5719557195571956,"acs":1550,"articleLive":2,"columnArticles":25,"formTitle":"[1168]水资源分配优化","frequency":0.4670075484,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"","submitted":2710,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3225007286505392,"acs":6639,"articleLive":2,"columnArticles":79,"formTitle":"[1169]查询无效交易","frequency":0.8255314142,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20586,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6168966769566007,"acs":13589,"articleLive":2,"columnArticles":211,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.2750821312,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22028,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.4735609973616737,"acs":12744,"articleLive":2,"columnArticles":151,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":1.1571522162,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":26911,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.26927324939253366,"acs":2438,"articleLive":2,"columnArticles":50,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9054,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7563000868977503,"acs":7833,"articleLive":2,"columnArticles":73,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"","submitted":10357,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6197813775846174,"acs":4706,"articleLive":2,"columnArticles":58,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"","submitted":7593,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.4900157826116791,"acs":7141,"articleLive":2,"columnArticles":110,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14573,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.44769344452654913,"acs":4241,"articleLive":2,"columnArticles":57,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"","submitted":9473,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26410089149815175,"acs":6073,"articleLive":2,"columnArticles":93,"formTitle":"[1177]构建回文串检测","frequency":0.3036065979,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":22995,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4619508302997058,"acs":18527,"articleLive":2,"columnArticles":182,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40106,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6352951196661273,"acs":29836,"articleLive":2,"columnArticles":179,"formTitle":"[1179]重新格式化部门表","frequency":2.5521890415,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":46964,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7751449458028737,"acs":3075,"articleLive":2,"columnArticles":66,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.4319465169,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"","submitted":3967,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3705481182116696,"acs":1467,"articleLive":2,"columnArticles":27,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"","submitted":3959,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.3894074675324675,"acs":1919,"articleLive":2,"columnArticles":38,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"","submitted":4928,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.6024667931688804,"acs":635,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"","submitted":1054,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5856686768357574,"acs":13208,"articleLive":2,"columnArticles":254,"formTitle":"[1184]公交站间的距离","frequency":0.2215934462,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22552,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6098098649765775,"acs":11065,"articleLive":2,"columnArticles":198,"formTitle":"[1185]一周中的第几天","frequency":0.2477729518,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":18145,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39322359982898675,"acs":7358,"articleLive":2,"columnArticles":104,"formTitle":"[1186]删除一次得到子数组最大和","frequency":1.4214639017,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":18712,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4419167473378509,"acs":1826,"articleLive":2,"columnArticles":31,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4132,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6927410617551463,"acs":3197,"articleLive":2,"columnArticles":64,"formTitle":"[1188]设计有限阻塞队列","frequency":1.0000678509,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"","submitted":4615,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6448114833735544,"acs":20574,"articleLive":2,"columnArticles":320,"formTitle":"[1189]“气球” 的最大数量","frequency":0.2215934462,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":31907,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.650710315009265,"acs":44247,"articleLive":2,"columnArticles":608,"formTitle":"[1190]反转每对括号间的子串","frequency":4.4272180143,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":67998,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.26738571235164044,"acs":5925,"articleLive":2,"columnArticles":93,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22159,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.4993351867520851,"acs":4131,"articleLive":2,"columnArticles":46,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8273,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.606231655001129,"acs":5370,"articleLive":2,"columnArticles":67,"formTitle":"[1193]每月交易 I","frequency":0.3036065979,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"","submitted":8858,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5107180332783691,"acs":3407,"articleLive":2,"columnArticles":59,"formTitle":"[1194]锦标赛优胜者","frequency":0.3036065979,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"","submitted":6671,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6357494722026742,"acs":13551,"articleLive":2,"columnArticles":261,"formTitle":"[1195]交替打印字符串","frequency":1.4214639017,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":21315,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6906021155410903,"acs":3395,"articleLive":2,"columnArticles":55,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"","submitted":4916,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.3684873288210294,"acs":4682,"articleLive":2,"columnArticles":58,"formTitle":"[1197]进击的骑士","frequency":0.8255314142,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"","submitted":12706,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7472959685349065,"acs":3800,"articleLive":2,"columnArticles":55,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"","submitted":5085,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.4343918514080288,"acs":725,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"","submitted":1669,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6867121951219513,"acs":17597,"articleLive":2,"columnArticles":246,"formTitle":"[1200]最小绝对差","frequency":1.1262855682,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":25625,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.2472101932045303,"acs":5937,"articleLive":2,"columnArticles":84,"formTitle":"[1201]丑数 III","frequency":0.794816469,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24016,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5032406360690331,"acs":26710,"articleLive":2,"columnArticles":292,"formTitle":"[1202]交换字符串中的元素","frequency":0.2477729518,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53076,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6220500903692229,"acs":12046,"articleLive":2,"columnArticles":143,"formTitle":"[1203]项目管理","frequency":0.3334417464,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19365,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7274428552332576,"acs":5442,"articleLive":2,"columnArticles":78,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.2750821312,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"","submitted":7481,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4606792589901925,"acs":5073,"articleLive":2,"columnArticles":81,"formTitle":"[1205]每月交易II","frequency":1.1891993936,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"","submitted":11012,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6178089994304158,"acs":6508,"articleLive":2,"columnArticles":86,"formTitle":"[1206]设计跳表","frequency":0.8255314142,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":10534,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7304750328434442,"acs":59495,"articleLive":2,"columnArticles":825,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":81447,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4968634372474801,"acs":46731,"articleLive":2,"columnArticles":602,"formTitle":"[1208]尽可能使字符串相等","frequency":0.8255314142,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":94052,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5317766224453209,"acs":11865,"articleLive":2,"columnArticles":158,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":1.6309954146,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":22312,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4491089787525703,"acs":2621,"articleLive":2,"columnArticles":53,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.4670075484,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5836,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6544884214410923,"acs":7094,"articleLive":2,"columnArticles":60,"formTitle":"[1211]查询结果的质量和占比","frequency":0.8255314142,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"","submitted":10839,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5107408571727968,"acs":4874,"articleLive":2,"columnArticles":94,"formTitle":"[1212]查询球队积分","frequency":0.2477729518,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"","submitted":9543,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7733616908148345,"acs":5818,"articleLive":2,"columnArticles":122,"formTitle":"[1213]三个有序数组的交集","frequency":0.9256148727,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"","submitted":7523,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6345158197507191,"acs":3309,"articleLive":2,"columnArticles":70,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.3036065979,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"","submitted":5215,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4105397365065873,"acs":1932,"articleLive":2,"columnArticles":39,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"","submitted":4706,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5343597446488922,"acs":1423,"articleLive":2,"columnArticles":37,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"","submitted":2663,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6954316360816748,"acs":21525,"articleLive":2,"columnArticles":347,"formTitle":"[1217]玩筹码","frequency":1.6309954146,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":30952,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.4208466371407972,"acs":8172,"articleLive":2,"columnArticles":108,"formTitle":"[1218]最长定差子序列","frequency":0.2477729518,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":19418,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6308706983671082,"acs":11861,"articleLive":2,"columnArticles":167,"formTitle":"[1219]黄金矿工","frequency":1.6309954146,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":18801,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5256392536281963,"acs":3803,"articleLive":2,"columnArticles":71,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7235,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.843932055088056,"acs":75618,"articleLive":2,"columnArticles":1102,"formTitle":"[1221]分割平衡字符串","frequency":0.911517723,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":89602,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6731037691949744,"acs":5786,"articleLive":2,"columnArticles":126,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8596,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.47339055793991414,"acs":3309,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":6990,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.32592852137351086,"acs":4651,"articleLive":2,"columnArticles":68,"formTitle":"[1224]最大相等频率","frequency":1.4108119049,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14270,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5429250084832032,"acs":3200,"articleLive":2,"columnArticles":74,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.8255314142,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"","submitted":5894,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5988135156048491,"acs":11608,"articleLive":2,"columnArticles":134,"formTitle":"[1226]哲学家进餐","frequency":2.3890945469,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":19385,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6625635536526626,"acs":9904,"articleLive":2,"columnArticles":153,"formTitle":"[1227]飞机座位分配概率","frequency":0.1723223972,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":14948,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.539646017699115,"acs":3049,"articleLive":2,"columnArticles":50,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"","submitted":5650,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.4152947424322889,"acs":2346,"articleLive":2,"columnArticles":42,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"","submitted":5649,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.4905945582801478,"acs":2921,"articleLive":2,"columnArticles":56,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"","submitted":5954,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5600693107431652,"acs":2909,"articleLive":2,"columnArticles":41,"formTitle":"[1231]分享巧克力","frequency":0.794816469,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"","submitted":5194,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.46932476782347604,"acs":33606,"articleLive":2,"columnArticles":418,"formTitle":"[1232]缀点成线","frequency":0.7368208014,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":71605,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4810647977376122,"acs":7825,"articleLive":2,"columnArticles":110,"formTitle":"[1233]删除子文件夹","frequency":0.2750821312,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":16266,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.34203393825123735,"acs":5805,"articleLive":2,"columnArticles":87,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.794816469,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":16972,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.455074487895717,"acs":5865,"articleLive":2,"columnArticles":103,"formTitle":"[1235]规划兼职工作","frequency":1.8724124874,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":12888,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5602941176470588,"acs":1143,"articleLive":2,"columnArticles":31,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"","submitted":2040,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7108026213797477,"acs":10087,"articleLive":2,"columnArticles":128,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14191,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6579917588375623,"acs":3034,"articleLive":2,"columnArticles":70,"formTitle":"[1238]循环码排列","frequency":0.2477729518,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4611,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4907133090246126,"acs":34452,"articleLive":2,"columnArticles":384,"formTitle":"[1239]串联字符串的最大长度","frequency":1.9085566458,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":70208,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4959349593495935,"acs":2501,"articleLive":2,"columnArticles":38,"formTitle":"[1240]铺瓷砖","frequency":1.3299924982,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5043,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5947272202443953,"acs":6181,"articleLive":2,"columnArticles":63,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"","submitted":10393,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.47113163972286376,"acs":1224,"articleLive":2,"columnArticles":20,"formTitle":"[1242]多线程网页爬虫","frequency":0.7093917643,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"","submitted":2598,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5401475237091675,"acs":2563,"articleLive":2,"columnArticles":53,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"","submitted":4745,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6183146360553091,"acs":2370,"articleLive":2,"columnArticles":39,"formTitle":"[1244]力扣排行榜","frequency":0.4670075484,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"","submitted":3833,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5083382094792276,"acs":3475,"articleLive":2,"columnArticles":61,"formTitle":"[1245]树的直径","frequency":0.3036065979,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"","submitted":6836,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4802446685402546,"acs":2905,"articleLive":2,"columnArticles":41,"formTitle":"[1246]删除回文子数组","frequency":0.5020685798,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"","submitted":6049,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6168496038380461,"acs":8486,"articleLive":2,"columnArticles":154,"formTitle":"[1247]交换字符使得字符串相同","frequency":1.1571522162,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":13757,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.55926958099744,"acs":34517,"articleLive":2,"columnArticles":470,"formTitle":"[1248]统计「优美子数组」","frequency":0.7652722227,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":61718,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5729525210856827,"acs":21806,"articleLive":2,"columnArticles":312,"formTitle":"[1249]移除无效的括号","frequency":1.8573474239,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":38059,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5617764681119765,"acs":2669,"articleLive":2,"columnArticles":37,"formTitle":"[1250]检查「好数组」","frequency":0.4319465169,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4751,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7707942772570301,"acs":7812,"articleLive":2,"columnArticles":93,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"","submitted":10135,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7497590613869684,"acs":17893,"articleLive":2,"columnArticles":310,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":23865,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3935037273695421,"acs":5173,"articleLive":2,"columnArticles":78,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.8908287567,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13146,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5983651226158038,"acs":14274,"articleLive":2,"columnArticles":221,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.2477729518,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":23855,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6787864752200092,"acs":2931,"articleLive":2,"columnArticles":63,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4318,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6650570676031606,"acs":1515,"articleLive":2,"columnArticles":35,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"","submitted":2278,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5621486570893192,"acs":1800,"articleLive":2,"columnArticles":37,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"","submitted":3202,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5590551181102362,"acs":1207,"articleLive":2,"columnArticles":43,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"","submitted":2159,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4767270945614895,"acs":1946,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.6256830086,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"","submitted":4082,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6044839045682258,"acs":12187,"articleLive":2,"columnArticles":248,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":20161,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7277556440903055,"acs":7672,"articleLive":2,"columnArticles":97,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10542,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5254967975036952,"acs":12799,"articleLive":2,"columnArticles":195,"formTitle":"[1262]可被三整除的最大和","frequency":2.0802271379,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":24356,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4160483649354218,"acs":3028,"articleLive":2,"columnArticles":57,"formTitle":"[1263]推箱子","frequency":0.8908287567,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7278,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5687862669245648,"acs":4705,"articleLive":2,"columnArticles":82,"formTitle":"[1264]页面推荐","frequency":0.2477729518,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"","submitted":8272,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9201812478215406,"acs":2640,"articleLive":2,"columnArticles":64,"formTitle":"[1265]逆序打印不可变链表","frequency":0.3646942899,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"","submitted":2869,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8237984367204391,"acs":29721,"articleLive":2,"columnArticles":453,"formTitle":"[1266]访问所有点的最小时间","frequency":0.2477729518,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36078,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6079448456992778,"acs":9259,"articleLive":2,"columnArticles":144,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15230,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.583632824198862,"acs":7795,"articleLive":2,"columnArticles":143,"formTitle":"[1268]搜索推荐系统","frequency":0.2750821312,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":13356,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4914612862711837,"acs":30131,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":2.3000805094,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61309,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8040895274937828,"acs":5820,"articleLive":2,"columnArticles":81,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"","submitted":7238,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5057279733388877,"acs":2428,"articleLive":2,"columnArticles":39,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"","submitted":4801,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.519053876478318,"acs":1580,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"","submitted":3044,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5442726633872101,"acs":1549,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"","submitted":2846,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6006269592476489,"acs":958,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"","submitted":1595,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5400781355247205,"acs":8018,"articleLive":2,"columnArticles":167,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.794816469,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":14846,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5012422360248447,"acs":6456,"articleLive":2,"columnArticles":97,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":12880,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7245703669298653,"acs":18720,"articleLive":2,"columnArticles":231,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":1.5680776295,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":25836,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5972904318374259,"acs":3527,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":2.8153054685,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":5905,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.623581847649919,"acs":1539,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"","submitted":2468,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5054022541780023,"acs":6502,"articleLive":2,"columnArticles":67,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.794816469,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"","submitted":12865,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8318732904561248,"acs":45011,"articleLive":2,"columnArticles":613,"formTitle":"[1281]整数的各位积和之差","frequency":0.2477729518,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":54108,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8108669435883693,"acs":12103,"articleLive":2,"columnArticles":226,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":14926,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41705557912600766,"acs":6881,"articleLive":2,"columnArticles":98,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.794816469,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16499,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6599023889031596,"acs":2569,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.6256830086,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3893,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8116771608471666,"acs":4254,"articleLive":2,"columnArticles":59,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"","submitted":5241,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6461835216313034,"acs":4690,"articleLive":2,"columnArticles":88,"formTitle":"[1286]字母组合迭代器","frequency":0.2750821312,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7258,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6037885079289753,"acs":15268,"articleLive":2,"columnArticles":215,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.7652722227,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":25287,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5635159797971223,"acs":13277,"articleLive":2,"columnArticles":168,"formTitle":"[1288]删除被覆盖区间","frequency":1.1571522162,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":23561,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6260660178589345,"acs":6240,"articleLive":2,"columnArticles":92,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":9967,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8093898579749583,"acs":52943,"articleLive":2,"columnArticles":692,"formTitle":"[1290]二进制链表转整数","frequency":0.1964664962,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":65411,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5193074896499812,"acs":6899,"articleLive":2,"columnArticles":150,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13285,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.4687052078356426,"acs":5886,"articleLive":2,"columnArticles":94,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.2477729518,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12558,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.35710928644494205,"acs":12917,"articleLive":2,"columnArticles":126,"formTitle":"[1293]网格中的最短路径","frequency":2.7224407249,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":36171,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.656364689974889,"acs":6796,"articleLive":2,"columnArticles":72,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"","submitted":10354,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8088919056507721,"acs":47668,"articleLive":2,"columnArticles":629,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.7652722227,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":58930,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.45315943064737063,"acs":7609,"articleLive":2,"columnArticles":121,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":16791,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.45776059564719357,"acs":6394,"articleLive":2,"columnArticles":90,"formTitle":"[1297]子串的最大出现次数","frequency":1.2571911387,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":13968,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5965556831228473,"acs":2598,"articleLive":2,"columnArticles":87,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4355,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7857236001356179,"acs":30127,"articleLive":2,"columnArticles":427,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":38343,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4673108392425777,"acs":23988,"articleLive":2,"columnArticles":362,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.1723223972,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":51332,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.36199095022624433,"acs":3120,"articleLive":2,"columnArticles":69,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8619,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8174307262096433,"acs":19293,"articleLive":2,"columnArticles":292,"formTitle":"[1302]层数最深叶子节点的和","frequency":1.1571522162,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":23602,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8223389021479713,"acs":8614,"articleLive":2,"columnArticles":80,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"","submitted":10475,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7246856158484065,"acs":21034,"articleLive":2,"columnArticles":379,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.2477729518,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29025,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7457832542167457,"acs":14768,"articleLive":2,"columnArticles":223,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.2215934462,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":19802,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5749671418461227,"acs":17061,"articleLive":2,"columnArticles":266,"formTitle":"[1306]跳跃游戏 III","frequency":1.4542214982,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":29673,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33266386708051854,"acs":1822,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5477,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7522548734361362,"acs":5171,"articleLive":2,"columnArticles":58,"formTitle":"[1308]不同性别每日分数总计","frequency":0.2477729518,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"","submitted":6874,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7560267342705692,"acs":16402,"articleLive":2,"columnArticles":286,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":21695,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7127084620135886,"acs":36924,"articleLive":2,"columnArticles":497,"formTitle":"[1310]子数组异或查询","frequency":2.5521890415,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":51808,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3778053146082886,"acs":5488,"articleLive":2,"columnArticles":86,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.2750821312,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14526,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6661908778304029,"acs":10268,"articleLive":2,"columnArticles":145,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":1.7718252505,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":15413,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8317636372328728,"acs":34796,"articleLive":2,"columnArticles":541,"formTitle":"[1313]解压缩编码列表","frequency":0.1964664962,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":41834,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.736309127248501,"acs":11052,"articleLive":2,"columnArticles":185,"formTitle":"[1314]矩阵区域和","frequency":1.5989824376,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":15010,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.810099846390169,"acs":12657,"articleLive":2,"columnArticles":260,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15624,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.4389270317739103,"acs":2749,"articleLive":2,"columnArticles":57,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6263,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.613738876020968,"acs":10069,"articleLive":2,"columnArticles":190,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16406,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6543521734554257,"acs":6217,"articleLive":2,"columnArticles":111,"formTitle":"[1318]或运算的最小翻转次数","frequency":1.9853993508,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9501,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6170337205550177,"acs":30595,"articleLive":2,"columnArticles":510,"formTitle":"[1319]连通网络的操作次数","frequency":0.2477729518,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":49584,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5894071914480078,"acs":2426,"articleLive":2,"columnArticles":56,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4116,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6159953803955537,"acs":4267,"articleLive":2,"columnArticles":75,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.1964664962,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"","submitted":6927,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5929295255642562,"acs":5149,"articleLive":2,"columnArticles":63,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"","submitted":8684,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7549521268246743,"acs":24049,"articleLive":2,"columnArticles":473,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":1.1571522162,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":31855,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5896555207596726,"acs":5837,"articleLive":2,"columnArticles":114,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":9899,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7286793549324423,"acs":10031,"articleLive":2,"columnArticles":179,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.2477729518,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":13766,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47455470737913485,"acs":5595,"articleLive":2,"columnArticles":91,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.2750821312,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":11790,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6895795718338922,"acs":5347,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"","submitted":7754,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.4593566788147679,"acs":5798,"articleLive":2,"columnArticles":115,"formTitle":"[1328]破坏回文串","frequency":0.8575034469,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12622,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7703778450498935,"acs":6871,"articleLive":2,"columnArticles":156,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.3036065979,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":8919,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3782894736842105,"acs":1150,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.6256830086,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3040,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5360443622920518,"acs":11600,"articleLive":2,"columnArticles":199,"formTitle":"[1331]数组序号转换","frequency":0.794816469,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":21640,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6852784360189573,"acs":9254,"articleLive":2,"columnArticles":132,"formTitle":"[1332]删除回文子序列","frequency":0.2477729518,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13504,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.543746330005872,"acs":5556,"articleLive":2,"columnArticles":117,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10218,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4902359282495361,"acs":5548,"articleLive":2,"columnArticles":92,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":2.3560783428,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11317,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5856182100362132,"acs":3396,"articleLive":2,"columnArticles":56,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":5799,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4237454100367197,"acs":1731,"articleLive":2,"columnArticles":47,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"","submitted":4085,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7061811404871097,"acs":38650,"articleLive":2,"columnArticles":615,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":1.8041382395,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":54731,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6408486156058971,"acs":8911,"articleLive":2,"columnArticles":127,"formTitle":"[1338]数组大小减半","frequency":0.2477729518,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":13905,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.39792101811822994,"acs":8192,"articleLive":2,"columnArticles":130,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.2750821312,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":20587,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5724193118164844,"acs":4292,"articleLive":2,"columnArticles":95,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7498,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.47998246639392167,"acs":3285,"articleLive":2,"columnArticles":45,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"","submitted":6844,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8204754208223283,"acs":41626,"articleLive":2,"columnArticles":634,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":50734,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5438521066208083,"acs":12650,"articleLive":2,"columnArticles":212,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23260,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5922466606407553,"acs":5897,"articleLive":2,"columnArticles":121,"formTitle":"[1344]时钟指针的夹角","frequency":0.2215934462,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":9957,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.36669232743135743,"acs":5716,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":0.2750821312,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15588,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43532802169859297,"acs":15408,"articleLive":2,"columnArticles":265,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":35394,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7394990366088632,"acs":7676,"articleLive":2,"columnArticles":113,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10380,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3048662272198527,"acs":3145,"articleLive":2,"columnArticles":49,"formTitle":"[1348]推文计数","frequency":0.3646942899,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":10316,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5050587467362925,"acs":3095,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.3334417464,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6128,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8487794786925942,"acs":8206,"articleLive":2,"columnArticles":83,"formTitle":"[1350]院系无效的学生","frequency":0.2477729518,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"","submitted":9668,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7551282051282051,"acs":29450,"articleLive":2,"columnArticles":541,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.2477729518,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":39000,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.4431872401335969,"acs":6502,"articleLive":2,"columnArticles":70,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.2477729518,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":14671,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28299347367886435,"acs":11144,"articleLive":2,"columnArticles":149,"formTitle":"[1353]最多可以参加的会议数目","frequency":2.5521890415,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":39379,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.28254656548733614,"acs":2867,"articleLive":2,"columnArticles":70,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10147,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6627492877492878,"acs":3722,"articleLive":2,"columnArticles":56,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"","submitted":5616,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7314223349276153,"acs":45572,"articleLive":2,"columnArticles":504,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.7652722227,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":62306,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5291419320021586,"acs":3922,"articleLive":2,"columnArticles":41,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7412,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4898581942200682,"acs":5458,"articleLive":2,"columnArticles":110,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.2750821312,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":11142,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5487343033685469,"acs":2753,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5017,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5042663141449345,"acs":8392,"articleLive":2,"columnArticles":137,"formTitle":"[1360]日期之间隔几天","frequency":1.4214639017,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":16642,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4027099676339898,"acs":7341,"articleLive":2,"columnArticles":195,"formTitle":"[1361]验证二叉树","frequency":0.2477729518,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":18229,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5242445537596627,"acs":5222,"articleLive":2,"columnArticles":68,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":9961,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.36550060313630883,"acs":4848,"articleLive":2,"columnArticles":98,"formTitle":"[1363]形成三的最大倍数","frequency":1.48824996,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":13264,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.675642087821044,"acs":3262,"articleLive":2,"columnArticles":63,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.2750821312,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"","submitted":4828,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8249435632824181,"acs":84414,"articleLive":2,"columnArticles":1081,"formTitle":"[1365]有多少小于当前数字的数字","frequency":1.1571522162,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":102327,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5383903078941277,"acs":6977,"articleLive":2,"columnArticles":140,"formTitle":"[1366]通过投票对团队排名","frequency":0.8255314142,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":12959,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4172842257758957,"acs":14978,"articleLive":2,"columnArticles":219,"formTitle":"[1367]二叉树中的列表","frequency":0.2750821312,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":35894,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5234432776216535,"acs":3539,"articleLive":2,"columnArticles":87,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6761,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6102408230067805,"acs":2610,"articleLive":2,"columnArticles":40,"formTitle":"[1369]获取最近第二次的活动","frequency":0.2750821312,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"","submitted":4277,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7905107682151993,"acs":47901,"articleLive":2,"columnArticles":575,"formTitle":"[1370]上升下降字符串","frequency":0.2215934462,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60595,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5798800286170271,"acs":21074,"articleLive":2,"columnArticles":263,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":2.114111457,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36342,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5130823229100191,"acs":8040,"articleLive":2,"columnArticles":161,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.2750821312,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":15670,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.398731622946094,"acs":6916,"articleLive":2,"columnArticles":156,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":1.1262855682,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":17345,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7398438533809713,"acs":16773,"articleLive":2,"columnArticles":224,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22671,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5732240069897171,"acs":8529,"articleLive":2,"columnArticles":170,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":14879,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5025057564675606,"acs":7420,"articleLive":2,"columnArticles":152,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14766,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32468245256390155,"acs":4141,"articleLive":2,"columnArticles":129,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12754,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8621026894865526,"acs":7052,"articleLive":2,"columnArticles":60,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"","submitted":8180,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8369813786344332,"acs":10248,"articleLive":2,"columnArticles":160,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12244,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7279480037140205,"acs":16464,"articleLive":2,"columnArticles":248,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22617,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7316401851620168,"acs":11696,"articleLive":2,"columnArticles":151,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":15986,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6916352963695528,"acs":10840,"articleLive":2,"columnArticles":172,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":15673,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.3240627911977636,"acs":4521,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":0.3334417464,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":13951,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5446660884648742,"acs":1884,"articleLive":2,"columnArticles":44,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"","submitted":3459,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.70266256497295,"acs":13248,"articleLive":2,"columnArticles":197,"formTitle":"[1385]两个数组间的距离值","frequency":0.2477729518,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":18854,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3108467600261005,"acs":6193,"articleLive":2,"columnArticles":129,"formTitle":"[1386]安排电影院座位","frequency":0.8908287567,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":19923,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6941946622545141,"acs":9650,"articleLive":2,"columnArticles":167,"formTitle":"[1387]将整数按权重排序","frequency":0.8575034469,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":13901,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5390285639068053,"acs":4095,"articleLive":2,"columnArticles":52,"formTitle":"[1388]3n 块披萨","frequency":0.794816469,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7597,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8309193111857954,"acs":27938,"articleLive":2,"columnArticles":477,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.7652722227,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33623,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3519801701312602,"acs":6248,"articleLive":2,"columnArticles":114,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17751,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.3998056837503036,"acs":6584,"articleLive":2,"columnArticles":202,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.8575034469,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16468,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.40097669727692553,"acs":7554,"articleLive":2,"columnArticles":138,"formTitle":"[1392]最长快乐前缀","frequency":0.3036065979,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":18839,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8566456384598651,"acs":3938,"articleLive":2,"columnArticles":57,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"","submitted":4597,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.664510020514439,"acs":16844,"articleLive":2,"columnArticles":270,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":25348,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7493487852852054,"acs":14096,"articleLive":2,"columnArticles":210,"formTitle":"[1395]统计作战单位数","frequency":0.2750821312,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":18811,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.41429731925264013,"acs":9690,"articleLive":2,"columnArticles":139,"formTitle":"[1396]设计地铁系统","frequency":0.8908287567,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":23389,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.37122884473877854,"acs":1009,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2718,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7700145560407569,"acs":4232,"articleLive":2,"columnArticles":63,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"","submitted":5496,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6702381814232969,"acs":9258,"articleLive":2,"columnArticles":150,"formTitle":"[1399]统计最大组的数目","frequency":0.2477729518,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":13813,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6055720083360755,"acs":5521,"articleLive":2,"columnArticles":92,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.2477729518,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9117,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41675652361440585,"acs":3865,"articleLive":2,"columnArticles":88,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9274,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7527885452100308,"acs":9516,"articleLive":2,"columnArticles":170,"formTitle":"[1402]做菜顺序","frequency":0.2215934462,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12641,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6915557610382749,"acs":20941,"articleLive":2,"columnArticles":359,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.7652722227,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":30281,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4929528810280503,"acs":7135,"articleLive":2,"columnArticles":152,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.2750821312,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14474,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5069604498939799,"acs":5499,"articleLive":2,"columnArticles":138,"formTitle":"[1405]最长快乐字符串","frequency":0.8255314142,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":10847,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5688751191611058,"acs":4774,"articleLive":2,"columnArticles":79,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8392,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6668608037274316,"acs":5725,"articleLive":2,"columnArticles":64,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"","submitted":8585,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6147801683816652,"acs":13144,"articleLive":2,"columnArticles":200,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":21380,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.80616961414791,"acs":8023,"articleLive":2,"columnArticles":128,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":9952,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4751402592377636,"acs":7368,"articleLive":2,"columnArticles":118,"formTitle":"[1410]HTML 实体解析器","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15507,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5505007153075823,"acs":7696,"articleLive":2,"columnArticles":140,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":1.1571522162,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":13980,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5571457779595175,"acs":2725,"articleLive":2,"columnArticles":65,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"","submitted":4891,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6928627145085804,"acs":10659,"articleLive":2,"columnArticles":216,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.794816469,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":15384,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6026320145671247,"acs":7281,"articleLive":2,"columnArticles":145,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":1.1891993936,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12082,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6842160682320733,"acs":6498,"articleLive":2,"columnArticles":174,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.3334417464,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9497,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.408506867523261,"acs":2766,"articleLive":2,"columnArticles":48,"formTitle":"[1416]恢复数组","frequency":0.794816469,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6771,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5188282811798784,"acs":12717,"articleLive":2,"columnArticles":182,"formTitle":"[1417]重新格式化字符串","frequency":0.3036065979,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24511,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7325531854460761,"acs":25791,"articleLive":2,"columnArticles":412,"formTitle":"[1418]点菜展示表","frequency":2.3658631567,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35207,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.41876037927894144,"acs":7817,"articleLive":2,"columnArticles":150,"formTitle":"[1419]数青蛙","frequency":1.4214639017,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18667,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5953685258964143,"acs":2391,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":0.5371296113,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4016,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7491582491582491,"acs":2670,"articleLive":2,"columnArticles":33,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"","submitted":3564,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.540872290415252,"acs":10355,"articleLive":2,"columnArticles":191,"formTitle":"[1422]分割字符串的最大得分","frequency":1.1891993936,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19145,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5542742582197273,"acs":34559,"articleLive":2,"columnArticles":503,"formTitle":"[1423]可获得的最大点数","frequency":0.2477729518,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":62350,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.3969084566341874,"acs":6599,"articleLive":2,"columnArticles":139,"formTitle":"[1424]对角线遍历 II","frequency":1.2225136003,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16626,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.4353007149866816,"acs":3105,"articleLive":2,"columnArticles":67,"formTitle":"[1425]带限制的子序列和","frequency":0.3334417464,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7133,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7086026852312283,"acs":1425,"articleLive":2,"columnArticles":46,"formTitle":"[1426]数元素","frequency":0.8908287567,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"","submitted":2011,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6590062111801243,"acs":1061,"articleLive":2,"columnArticles":44,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"","submitted":1610,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5859434682964094,"acs":767,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"","submitted":1309,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.49955555555555553,"acs":1124,"articleLive":2,"columnArticles":38,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"","submitted":2250,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5842696629213483,"acs":676,"articleLive":2,"columnArticles":25,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"","submitted":1157,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8463822777127498,"acs":78094,"articleLive":2,"columnArticles":1027,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.2477729518,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":92268,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3935119887165021,"acs":4464,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11344,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6439262472885032,"acs":5937,"articleLive":2,"columnArticles":101,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9220,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.46315015622128286,"acs":2520,"articleLive":2,"columnArticles":44,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5441,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6193058568329718,"acs":3997,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"","submitted":6454,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.784315886134068,"acs":21353,"articleLive":2,"columnArticles":371,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"","submitted":27225,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5889698231009365,"acs":10188,"articleLive":2,"columnArticles":172,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.2750821312,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":17298,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4825423126997278,"acs":32616,"articleLive":2,"columnArticles":461,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":1.6391807759,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":67592,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.561132364192808,"acs":3667,"articleLive":2,"columnArticles":56,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6535,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6986486486486486,"acs":2585,"articleLive":2,"columnArticles":34,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"","submitted":3700,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6477126820499651,"acs":17656,"articleLive":2,"columnArticles":370,"formTitle":"[1441]用栈操作构建数组","frequency":0.2750821312,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":27259,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7916828960934815,"acs":34553,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":2.4408748795,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43645,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.410186077544666,"acs":5533,"articleLive":2,"columnArticles":137,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13489,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5238775510204081,"acs":2567,"articleLive":2,"columnArticles":59,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":4900,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8603089321692411,"acs":3843,"articleLive":2,"columnArticles":47,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"","submitted":4467,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5724347465819638,"acs":12435,"articleLive":2,"columnArticles":213,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":21723,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6168838046817074,"acs":5824,"articleLive":2,"columnArticles":70,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9441,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7126419379258138,"acs":9414,"articleLive":2,"columnArticles":150,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.2477729518,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":13210,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6276256672170808,"acs":16344,"articleLive":2,"columnArticles":206,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":1.6986664953,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26041,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8023103529332751,"acs":23892,"articleLive":2,"columnArticles":340,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.2215934462,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":29779,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5220820189274448,"acs":9930,"articleLive":2,"columnArticles":150,"formTitle":"[1451]重新排列句子中的单词","frequency":0.2750821312,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19020,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.4985610292872863,"acs":5890,"articleLive":2,"columnArticles":88,"formTitle":"[1452]收藏清单","frequency":0.2750821312,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11814,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36330935251798563,"acs":1616,"articleLive":2,"columnArticles":30,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4448,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.4022627797505987,"acs":4871,"articleLive":2,"columnArticles":76,"formTitle":"[1454]活跃用户","frequency":0.8575034469,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"","submitted":12109,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6326968461703497,"acs":11796,"articleLive":2,"columnArticles":200,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":18644,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5213568847852268,"acs":12987,"articleLive":2,"columnArticles":203,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":24910,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6344710723795691,"acs":7863,"articleLive":2,"columnArticles":136,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12393,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4415594727648086,"acs":5561,"articleLive":2,"columnArticles":88,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12594,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5951153324287652,"acs":2193,"articleLive":2,"columnArticles":46,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"","submitted":3685,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7447355412753337,"acs":15066,"articleLive":2,"columnArticles":308,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":20230,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5004763967085318,"acs":5778,"articleLive":2,"columnArticles":83,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11545,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.42735283750440606,"acs":6062,"articleLive":2,"columnArticles":124,"formTitle":"[1462]课程表 IV","frequency":0.2215934462,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":14185,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5904231625835189,"acs":2651,"articleLive":2,"columnArticles":63,"formTitle":"[1463]摘樱桃 II","frequency":0.3974841127,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4490,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7684185759242376,"acs":26127,"articleLive":2,"columnArticles":362,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.7652722227,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":34001,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3084314788350663,"acs":6259,"articleLive":2,"columnArticles":79,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20293,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.48466115447028824,"acs":6272,"articleLive":2,"columnArticles":123,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":12941,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6149752945648043,"acs":1618,"articleLive":2,"columnArticles":47,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2631,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7111386138613861,"acs":2873,"articleLive":2,"columnArticles":49,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"","submitted":4040,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.801113172541744,"acs":2159,"articleLive":2,"columnArticles":83,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"","submitted":2695,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8433505056286968,"acs":53040,"articleLive":2,"columnArticles":723,"formTitle":"[1470]重新排列数组","frequency":1.9516807148,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":62892,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5432567135312059,"acs":7303,"articleLive":2,"columnArticles":104,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13443,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6173535093367676,"acs":7670,"articleLive":2,"columnArticles":127,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":12424,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6745456134218805,"acs":15439,"articleLive":2,"columnArticles":163,"formTitle":"[1473]粉刷房子 III","frequency":2.2238103742,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":22888,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7195685670261941,"acs":1868,"articleLive":2,"columnArticles":61,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"","submitted":2596,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7206751054852321,"acs":14518,"articleLive":2,"columnArticles":224,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":20145,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8646835005188516,"acs":12499,"articleLive":2,"columnArticles":115,"formTitle":"[1476]子矩形查询","frequency":0.8575034469,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14455,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.28886345841113054,"acs":4796,"articleLive":2,"columnArticles":96,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.794816469,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":16603,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.57718715393134,"acs":2606,"articleLive":2,"columnArticles":56,"formTitle":"[1478]安排邮筒","frequency":0.9256148727,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4515,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5671191553544495,"acs":1880,"articleLive":2,"columnArticles":37,"formTitle":"[1479]周内每天的销售情况","frequency":0.2477729518,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"","submitted":3315,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.869281357224552,"acs":127687,"articleLive":2,"columnArticles":1281,"formTitle":"[1480]一维数组的动态和","frequency":1.3862503008,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":146888,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5130569147566315,"acs":9961,"articleLive":2,"columnArticles":144,"formTitle":"[1481]不同整数的最少数目","frequency":1.6309954146,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":19415,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.586931796641013,"acs":30963,"articleLive":2,"columnArticles":401,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":2.2634195123,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":52754,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.30000918864283743,"acs":3265,"articleLive":2,"columnArticles":68,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":10883,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8058761804826863,"acs":768,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"","submitted":953,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6599058312205722,"acs":3644,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"","submitted":5522,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8586498917090502,"acs":70569,"articleLive":2,"columnArticles":675,"formTitle":"[1486]数组异或操作","frequency":2.2963497186,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":82186,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.3091995609577625,"acs":7606,"articleLive":2,"columnArticles":104,"formTitle":"[1487]保证文件名唯一","frequency":1.1571522162,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24599,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23577073786278807,"acs":7100,"articleLive":2,"columnArticles":110,"formTitle":"[1488]避免洪水泛滥","frequency":2.9247639957,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":30114,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6920440194840339,"acs":11508,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16629,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8581183611532626,"acs":1131,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"","submitted":1318,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6718232421541509,"acs":19673,"articleLive":2,"columnArticles":296,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":29283,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6649746192893401,"acs":6419,"articleLive":2,"columnArticles":77,"formTitle":"[1492]n 的第 k 个因子","frequency":0.2477729518,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":9653,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5663427964171853,"acs":7461,"articleLive":2,"columnArticles":140,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":1.1571522162,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":13174,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3674185463659148,"acs":2199,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":1.5605161568,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":5985,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5427841634738186,"acs":3825,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"","submitted":7047,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5369669190912715,"acs":10778,"articleLive":2,"columnArticles":163,"formTitle":"[1496]判断路径是否相交","frequency":0.2750821312,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":20072,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3901498511251037,"acs":7993,"articleLive":2,"columnArticles":108,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.2215934462,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":20487,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3330304996755354,"acs":5132,"articleLive":2,"columnArticles":65,"formTitle":"[1498]满足条件的子序列数目","frequency":0.8908287567,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15410,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3750713877784123,"acs":2627,"articleLive":2,"columnArticles":58,"formTitle":"[1499]满足不等式的最大值","frequency":0.3334417464,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7004,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.30283778060144007,"acs":715,"articleLive":2,"columnArticles":26,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"","submitted":2361,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5918733193904989,"acs":3962,"articleLive":2,"columnArticles":57,"formTitle":"[1501]可以放心投资的国家","frequency":1.1571522162,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"","submitted":6694,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7168260311117454,"acs":25114,"articleLive":2,"columnArticles":300,"formTitle":"[1502]判断能否形成等差数列","frequency":1.6309954146,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":35035,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5121921630474342,"acs":8444,"articleLive":2,"columnArticles":85,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.8255314142,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16486,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5927066450567261,"acs":7314,"articleLive":2,"columnArticles":131,"formTitle":"[1504]统计全 1 子矩形","frequency":1.4214639017,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12340,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3620421753607103,"acs":3262,"articleLive":2,"columnArticles":72,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":1.523645621,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9010,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8434108527131783,"acs":544,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":1.1730230461,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"","submitted":645,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5884138785625774,"acs":9497,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":1.4214639017,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16140,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5523765574526995,"acs":5985,"articleLive":2,"columnArticles":52,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.2750821312,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":10835,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5461387434554974,"acs":5007,"articleLive":2,"columnArticles":74,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.2477729518,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9168,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5779529384490553,"acs":4986,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":1.4214639017,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8627,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6820040899795501,"acs":4002,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":0.3036065979,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"","submitted":5868,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8485975040821087,"acs":58207,"articleLive":2,"columnArticles":740,"formTitle":"[1512]好数对的数目","frequency":0.1964664962,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":68592,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37890517003041196,"acs":10964,"articleLive":2,"columnArticles":147,"formTitle":"[1513]仅含 1 的子串数","frequency":0.2215934462,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":28936,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.31969568892645817,"acs":7564,"articleLive":2,"columnArticles":133,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":23660,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34188315247177464,"acs":3119,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9123,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5767326732673267,"acs":233,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"","submitted":404,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7323288278307113,"acs":3305,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"","submitted":4513,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6741311259730293,"acs":24595,"articleLive":2,"columnArticles":393,"formTitle":"[1518]换酒问题","frequency":0.794816469,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":36484,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2965479749932047,"acs":5455,"articleLive":2,"columnArticles":123,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18395,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.3321376378371197,"acs":2500,"articleLive":2,"columnArticles":70,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7527,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.39594676346037505,"acs":2618,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.580054656,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6612,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7018633540372671,"acs":678,"articleLive":2,"columnArticles":27,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"","submitted":966,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5768958603608916,"acs":9783,"articleLive":2,"columnArticles":168,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":16958,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.42600856836843987,"acs":4773,"articleLive":2,"columnArticles":98,"formTitle":"[1524]和为奇数的子数组数目","frequency":1.1262855682,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":11204,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6630188679245284,"acs":5271,"articleLive":2,"columnArticles":109,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":7950,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6128261302529376,"acs":3077,"articleLive":2,"columnArticles":49,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5021,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5055393586005831,"acs":3468,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"","submitted":6860,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7847330668854715,"acs":29648,"articleLive":2,"columnArticles":354,"formTitle":"[1528]重新排列字符串","frequency":0.794816469,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":37781,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6896605662443297,"acs":8818,"articleLive":2,"columnArticles":134,"formTitle":"[1529]灯泡开关 IV","frequency":0.3036065979,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12786,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5662118515588953,"acs":8590,"articleLive":2,"columnArticles":145,"formTitle":"[1530]好叶子节点对的数量","frequency":0.8255314142,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15171,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3252663897417374,"acs":1801,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":1.0000678509,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5537,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6194795894008116,"acs":2595,"articleLive":2,"columnArticles":46,"formTitle":"[1532]最近的三笔订单","frequency":0.2477729518,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"","submitted":4189,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6131868131868132,"acs":279,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"","submitted":455,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7898537221652846,"acs":16955,"articleLive":2,"columnArticles":158,"formTitle":"[1534]统计好三元组","frequency":0.2750821312,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21466,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4526221487147681,"acs":13136,"articleLive":2,"columnArticles":181,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.2750821312,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29022,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4388822958247923,"acs":4068,"articleLive":2,"columnArticles":77,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9269,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3651479880279348,"acs":4392,"articleLive":2,"columnArticles":88,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12028,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.6060606060606061,"acs":120,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"","submitted":198,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5383424745112554,"acs":15999,"articleLive":2,"columnArticles":242,"formTitle":"[1539]第 k 个缺失的正整数","frequency":1.3898906398,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":29719,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3167151547209733,"acs":4790,"articleLive":2,"columnArticles":84,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15124,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.45969274627811213,"acs":5805,"articleLive":2,"columnArticles":92,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12628,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.3819520601597995,"acs":2438,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6383,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5483558994197292,"acs":2835,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"","submitted":5170,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.544855920756416,"acs":19362,"articleLive":2,"columnArticles":314,"formTitle":"[1544]整理字符串","frequency":1.6641945863,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":35536,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5524569383342033,"acs":7409,"articleLive":2,"columnArticles":100,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.8575034469,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13411,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.41228425573292277,"acs":5088,"articleLive":2,"columnArticles":77,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12341,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5353359259755934,"acs":3992,"articleLive":2,"columnArticles":69,"formTitle":"[1547]切棍子的最小成本","frequency":1.2922521702,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7457,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7133757961783439,"acs":336,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"","submitted":471,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6691072937200788,"acs":2376,"articleLive":2,"columnArticles":47,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"","submitted":3551,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6598305138140692,"acs":20945,"articleLive":2,"columnArticles":286,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.2215934462,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":31743,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.816962962962963,"acs":11029,"articleLive":2,"columnArticles":152,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.2477729518,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13500,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5089544601739724,"acs":8952,"articleLive":2,"columnArticles":122,"formTitle":"[1552]两球之间的磁力","frequency":0.7652722227,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17589,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.2951034908866234,"acs":7642,"articleLive":2,"columnArticles":121,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":2.6591284455,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":25896,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7080394922425952,"acs":502,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"","submitted":709,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4355964938344971,"acs":2932,"articleLive":2,"columnArticles":56,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"","submitted":6731,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5783541256292405,"acs":10570,"articleLive":2,"columnArticles":161,"formTitle":"[1556]千位分隔数","frequency":2.2281300354,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":18276,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7654826491964377,"acs":7478,"articleLive":2,"columnArticles":102,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":9769,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6226175349428208,"acs":4410,"articleLive":2,"columnArticles":68,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.3036065979,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7083,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.3665001086248099,"acs":3374,"articleLive":2,"columnArticles":61,"formTitle":"[1559]二维网格图中探测环","frequency":0.3646942899,"frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","questionId":"1663","status":"","submitted":9206,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5741726764170655,"acs":8519,"articleLive":2,"columnArticles":89,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.3036065979,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":14837,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7798626691141478,"acs":11471,"articleLive":2,"columnArticles":157,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":1.1262855682,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":14709,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3092775944261093,"acs":4217,"articleLive":2,"columnArticles":84,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.5020685798,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13635,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3776074512467255,"acs":3892,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":1.837638469,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10307,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.534740545294635,"acs":608,"articleLive":2,"columnArticles":23,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"","submitted":1137,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7246039142590867,"acs":3110,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.3334417464,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"","submitted":4292,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4464787924008495,"acs":7779,"articleLive":2,"columnArticles":119,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.2477729518,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17423,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.396078431372549,"acs":11413,"articleLive":2,"columnArticles":187,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":1.1262855682,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":28815,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45516377304456773,"acs":2543,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5587,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.4723384472338447,"acs":2032,"articleLive":2,"columnArticles":45,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4302,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8965936739659367,"acs":1474,"articleLive":2,"columnArticles":37,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"","submitted":1644,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7570479028191611,"acs":3303,"articleLive":2,"columnArticles":42,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"","submitted":4363,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8050502888936444,"acs":18810,"articleLive":2,"columnArticles":317,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.794816469,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":23365,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.29564280422924105,"acs":4390,"articleLive":2,"columnArticles":64,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":14849,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3260732544295819,"acs":4656,"articleLive":2,"columnArticles":81,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.794816469,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14279,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.596551724137931,"acs":3979,"articleLive":2,"columnArticles":65,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":6670,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47591382231905105,"acs":17694,"articleLive":2,"columnArticles":251,"formTitle":"[1576]替换所有的问号","frequency":0.2477729518,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":37179,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3246244704069842,"acs":5057,"articleLive":2,"columnArticles":78,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.3974841127,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15578,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5814394966643163,"acs":10720,"articleLive":2,"columnArticles":201,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18437,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6196943972835314,"acs":16060,"articleLive":2,"columnArticles":294,"formTitle":"[1579]保证图可完全遍历","frequency":0.3334417464,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":25916,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6308068459657702,"acs":258,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"","submitted":409,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8092152627789777,"acs":3372,"articleLive":2,"columnArticles":44,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"","submitted":4167,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6710263007432818,"acs":9389,"articleLive":2,"columnArticles":108,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.2750821312,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":13992,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6859769605671245,"acs":18579,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":2.3658631567,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27084,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.665722011335864,"acs":25605,"articleLive":2,"columnArticles":327,"formTitle":"[1584]连接所有点的最小费用","frequency":0.8908287567,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":38462,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4291431690012734,"acs":2359,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5497,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6188034188034188,"acs":362,"articleLive":2,"columnArticles":23,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"","submitted":585,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8246527777777778,"acs":3325,"articleLive":2,"columnArticles":41,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"","submitted":4032,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8390126313759522,"acs":43507,"articleLive":2,"columnArticles":692,"formTitle":"[1588]所有奇数长度子数组的和","frequency":1.0198020878,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":51855,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.29360031409501375,"acs":3739,"articleLive":2,"columnArticles":53,"formTitle":"[1589]所有排列中的最大和","frequency":0.3036065979,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":12735,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.26633999246136447,"acs":3533,"articleLive":2,"columnArticles":56,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.8255314142,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13265,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5813333333333334,"acs":1090,"articleLive":2,"columnArticles":32,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1875,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.44409226976580385,"acs":7566,"articleLive":2,"columnArticles":124,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17037,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5296835760924159,"acs":5273,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.3334417464,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":9955,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.31377899045020463,"acs":4140,"articleLive":2,"columnArticles":99,"formTitle":"[1594]矩阵的最大非负积","frequency":0.3036065979,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13194,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4631422189128816,"acs":1866,"articleLive":2,"columnArticles":38,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4029,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7583958265405935,"acs":2326,"articleLive":2,"columnArticles":39,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"","submitted":3067,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6635294117647059,"acs":282,"articleLive":2,"columnArticles":19,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"","submitted":425,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6714684880471903,"acs":10814,"articleLive":2,"columnArticles":148,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.2477729518,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16105,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4192421098613083,"acs":3839,"articleLive":2,"columnArticles":69,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9157,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6798849643551523,"acs":16785,"articleLive":2,"columnArticles":204,"formTitle":"[1600]皇位继承顺序","frequency":0.794816469,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24688,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4884782112708191,"acs":2141,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4383,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7847058823529411,"acs":667,"articleLive":2,"columnArticles":28,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"","submitted":850,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8446434980260796,"acs":56483,"articleLive":2,"columnArticles":452,"formTitle":"[1603]设计停车系统","frequency":2.0802271379,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":66872,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.41455160744500846,"acs":3675,"articleLive":2,"columnArticles":61,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":8865,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.734188412206988,"acs":3320,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4522,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3418313150626726,"acs":1609,"articleLive":2,"columnArticles":33,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4707,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5446251487504958,"acs":2746,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"","submitted":5042,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6396594159515732,"acs":9616,"articleLive":2,"columnArticles":159,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15033,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5124690097710369,"acs":7028,"articleLive":2,"columnArticles":119,"formTitle":"[1609]奇偶树","frequency":0.2215934462,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":13714,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.2710934764850041,"acs":2323,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8569,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6103092783505155,"acs":2072,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3395,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7325383304940375,"acs":430,"articleLive":2,"columnArticles":20,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"","submitted":587,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7236544549977386,"acs":1600,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"","submitted":2211,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8208977407847801,"acs":16569,"articleLive":2,"columnArticles":282,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.1964664962,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":20184,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.4953989185086804,"acs":5222,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10541,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.2754114768683274,"acs":4953,"articleLive":2,"columnArticles":92,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.3036065979,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":17984,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6192857142857143,"acs":1734,"articleLive":2,"columnArticles":32,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2800,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5938104448742747,"acs":307,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"","submitted":517,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.674191121143717,"acs":7168,"articleLive":2,"columnArticles":125,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10632,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3712666564558125,"acs":2424,"articleLive":2,"columnArticles":41,"formTitle":"[1620]网络信号最好的坐标","frequency":0.3974841127,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6529,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4377996467322735,"acs":1735,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":3963,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14852336219070425,"acs":2419,"articleLive":2,"columnArticles":53,"formTitle":"[1622]奇妙序列","frequency":0.2750821312,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":16287,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.782639545884579,"acs":3309,"articleLive":2,"columnArticles":42,"formTitle":"[1623]三人国家代表队","frequency":0.2750821312,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"","submitted":4228,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6269049753473779,"acs":11189,"articleLive":2,"columnArticles":193,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.794816469,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":17848,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5418535127055306,"acs":2900,"articleLive":2,"columnArticles":65,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5352,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.38457671425698775,"acs":3825,"articleLive":2,"columnArticles":82,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.3036065979,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":9946,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.38010043942247335,"acs":2422,"articleLive":2,"columnArticles":37,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6372,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8371040723981901,"acs":370,"articleLive":2,"columnArticles":17,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"","submitted":442,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5239997422846466,"acs":8133,"articleLive":2,"columnArticles":95,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":15521,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7689969604863222,"acs":7337,"articleLive":2,"columnArticles":114,"formTitle":"[1630]等差子数组","frequency":0.2477729518,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9541,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.492556493545007,"acs":24914,"articleLive":2,"columnArticles":298,"formTitle":"[1631]最小体力消耗路径","frequency":1.4214639017,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":50581,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3181119648737651,"acs":1449,"articleLive":2,"columnArticles":26,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4555,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6532663316582915,"acs":2600,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"","submitted":3980,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5204216073781291,"acs":395,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"","submitted":759,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5446472619634929,"acs":1104,"articleLive":2,"columnArticles":29,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.3974841127,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"","submitted":2027,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7066900846239821,"acs":8852,"articleLive":2,"columnArticles":172,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.2477729518,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12526,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8060661764705882,"acs":5262,"articleLive":2,"columnArticles":69,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6528,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7095616508587541,"acs":2768,"articleLive":2,"columnArticles":46,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.3974841127,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3901,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4033832140533507,"acs":1240,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3074,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6620522033181866,"acs":12530,"articleLive":2,"columnArticles":215,"formTitle":"[1640]能否连接形成数组","frequency":0.2215934462,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":18926,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7699768756423433,"acs":11987,"articleLive":2,"columnArticles":273,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":1.837638469,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15568,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4507705479452055,"acs":6318,"articleLive":2,"columnArticles":103,"formTitle":"[1642]可以到达的最远建筑","frequency":0.3036065979,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14016,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4502350296341713,"acs":2203,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":4893,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5410350235232619,"acs":1035,"articleLive":2,"columnArticles":22,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.8908287567,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"","submitted":1913,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4116066630843632,"acs":766,"articleLive":2,"columnArticles":24,"formTitle":"[1645]Hopper Company Queries II","frequency":0.4319465169,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"","submitted":1861,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5370174016091811,"acs":34440,"articleLive":2,"columnArticles":353,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.978688552,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":64132,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5136604101746504,"acs":7088,"articleLive":2,"columnArticles":104,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.794816469,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":13799,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.27710843373493976,"acs":3404,"articleLive":2,"columnArticles":87,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.8908287567,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12284,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.47445117335352005,"acs":2507,"articleLive":2,"columnArticles":63,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5284,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7922168172341905,"acs":1140,"articleLive":2,"columnArticles":28,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.3334417464,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"","submitted":1439,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6867119301648884,"acs":708,"articleLive":2,"columnArticles":23,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"","submitted":1031,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6597405131206712,"acs":6763,"articleLive":2,"columnArticles":175,"formTitle":"[1652]拆炸弹","frequency":0.7652722227,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":10251,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5041216600341103,"acs":3547,"articleLive":2,"columnArticles":84,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.2477729518,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7036,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2734903430853231,"acs":3356,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":0.8255314142,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":12271,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3888997842714258,"acs":1983,"articleLive":2,"columnArticles":32,"formTitle":"[1655]分配重复整数","frequency":0.3334417464,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5099,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7808732651200486,"acs":7708,"articleLive":2,"columnArticles":90,"formTitle":"[1656]设计有序流","frequency":0.2215934462,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":9871,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.4645194626248708,"acs":5394,"articleLive":2,"columnArticles":74,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.2750821312,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11612,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.2984068839202405,"acs":8635,"articleLive":2,"columnArticles":150,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.2477729518,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":28937,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.41125541125541126,"acs":1330,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.6256830086,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3234,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7383720930232558,"acs":381,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"","submitted":516,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7257281553398058,"acs":2392,"articleLive":2,"columnArticles":53,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.8908287567,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"","submitted":3296,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8121715408994263,"acs":20245,"articleLive":2,"columnArticles":276,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.7652722227,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":24927,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5725243013365735,"acs":7539,"articleLive":2,"columnArticles":130,"formTitle":"[1663]具有给定数值的最小字符串","frequency":1.2571911387,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13168,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5457616707616708,"acs":5331,"articleLive":2,"columnArticles":106,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9768,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6652838994036816,"acs":5132,"articleLive":2,"columnArticles":79,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.2750821312,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7714,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.695906432748538,"acs":238,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"","submitted":342,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6012731481481481,"acs":2078,"articleLive":2,"columnArticles":32,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"","submitted":3456,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.44192767845140474,"acs":6575,"articleLive":2,"columnArticles":127,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":14878,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7617601487449643,"acs":12291,"articleLive":2,"columnArticles":223,"formTitle":"[1669]合并两个链表","frequency":0.2477729518,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":16135,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5290224032586558,"acs":4156,"articleLive":2,"columnArticles":76,"formTitle":"[1670]设计前中后队列","frequency":0.2477729518,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":7856,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.4650731028080761,"acs":2004,"articleLive":2,"columnArticles":37,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.3036065979,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4309,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8503670745272525,"acs":38224,"articleLive":2,"columnArticles":439,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":44950,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.3518852692563396,"acs":7410,"articleLive":2,"columnArticles":164,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.2215934462,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21058,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3624557260920897,"acs":2456,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.3036065979,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6776,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4351027397260274,"acs":2541,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":5840,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7599601593625498,"acs":763,"articleLive":2,"columnArticles":21,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.3646942899,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"","submitted":1004,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.39370730697578143,"acs":1902,"articleLive":2,"columnArticles":30,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"","submitted":4831,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.830091478093404,"acs":17241,"articleLive":2,"columnArticles":280,"formTitle":"[1678]设计 Goal 解析器","frequency":0.1964664962,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":20770,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4961392773892774,"acs":6811,"articleLive":2,"columnArticles":109,"formTitle":"[1679]K 和数对的最大数目","frequency":0.2477729518,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":13728,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4629645748106885,"acs":5319,"articleLive":2,"columnArticles":70,"formTitle":"[1680]连接连续二进制数字","frequency":0.3036065979,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11489,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3842501637197119,"acs":2347,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6108,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5274914089347079,"acs":307,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"","submitted":582,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8953738569123184,"acs":3329,"articleLive":2,"columnArticles":36,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"","submitted":3718,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8277953189996492,"acs":16517,"articleLive":2,"columnArticles":349,"formTitle":"[1684]统计一致字符串的数目","frequency":0.794816469,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":19953,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5974435590969456,"acs":3599,"articleLive":2,"columnArticles":82,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6024,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.46844396082698586,"acs":2583,"articleLive":2,"columnArticles":47,"formTitle":"[1686]石子游戏 VI","frequency":0.2477729518,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5514,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.403606698153714,"acs":940,"articleLive":2,"columnArticles":20,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2329,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8051248303376795,"acs":19575,"articleLive":2,"columnArticles":260,"formTitle":"[1688]比赛中的配对次数","frequency":0.2215934462,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":24313,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8667831535819727,"acs":14386,"articleLive":2,"columnArticles":187,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.7652722227,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":16597,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5167412063338571,"acs":4275,"articleLive":2,"columnArticles":105,"formTitle":"[1690]石子游戏 VII","frequency":0.3036065979,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8273,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.486815415821501,"acs":2400,"articleLive":2,"columnArticles":62,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":4930,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6392156862745098,"acs":163,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"","submitted":255,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.804177545691906,"acs":2156,"articleLive":2,"columnArticles":33,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"","submitted":2681,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6350071254924973,"acs":7575,"articleLive":2,"columnArticles":135,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":11929,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.45855553862562853,"acs":6019,"articleLive":2,"columnArticles":128,"formTitle":"[1695]删除子数组的最大得分","frequency":0.2215934462,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":13126,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.3969951449940953,"acs":6051,"articleLive":2,"columnArticles":109,"formTitle":"[1696]跳跃游戏 VI","frequency":1.1571522162,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":15242,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5254443632822011,"acs":2158,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4107,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5459057071960298,"acs":440,"articleLive":2,"columnArticles":16,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"","submitted":806,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8013403542364768,"acs":1674,"articleLive":2,"columnArticles":41,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"","submitted":2089,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7117457915642141,"acs":7526,"articleLive":2,"columnArticles":178,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.2750821312,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":10574,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6104623260278356,"acs":3816,"articleLive":2,"columnArticles":78,"formTitle":"[1701]平均等待时间","frequency":0.8255314142,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6251,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.47583457897359244,"acs":2865,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.9619825169,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6021,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3853942927278306,"acs":1256,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3259,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7817192315258016,"acs":11922,"articleLive":2,"columnArticles":182,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":15251,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3471362940275651,"acs":5667,"articleLive":2,"columnArticles":118,"formTitle":"[1705]吃苹果的最大数目","frequency":0.2477729518,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16325,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5837577426015141,"acs":4241,"articleLive":2,"columnArticles":110,"formTitle":"[1706]球会落何处","frequency":0.794816469,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7265,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5032658742906093,"acs":14100,"articleLive":2,"columnArticles":149,"formTitle":"[1707]与数组中元素的最大异或值","frequency":1.9085566458,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28017,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6977290524667189,"acs":891,"articleLive":2,"columnArticles":24,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"","submitted":1277,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7149656266525648,"acs":1352,"articleLive":2,"columnArticles":35,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"","submitted":1891,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6941852561329791,"acs":11234,"articleLive":2,"columnArticles":181,"formTitle":"[1710]卡车上的最大单元数","frequency":1.1262855682,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":16183,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3589930813243638,"acs":29991,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":2.3890945469,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":83542,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.263271564943199,"acs":6095,"articleLive":2,"columnArticles":104,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.3334417464,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":23151,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4967134652201659,"acs":15567,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":2.2634195123,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31340,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6398891966759003,"acs":231,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"","submitted":361,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7374017568192326,"acs":1595,"articleLive":2,"columnArticles":35,"formTitle":"[1715]苹果和橘子的个数","frequency":0.794816469,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"","submitted":2163,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6749581239530988,"acs":8059,"articleLive":2,"columnArticles":189,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":11940,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.4309825195901145,"acs":2145,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.2750821312,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":4977,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4883720930232558,"acs":1911,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":3913,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.36488095238095236,"acs":613,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1680,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8692600120445649,"acs":46189,"articleLive":2,"columnArticles":483,"formTitle":"[1720]解码异或后的数组","frequency":2.7557285914,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53136,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6470624613481757,"acs":10463,"articleLive":2,"columnArticles":164,"formTitle":"[1721]交换链表中的节点","frequency":0.2750821312,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":16170,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5144792918806688,"acs":4708,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9151,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5071845087468368,"acs":23049,"articleLive":2,"columnArticles":175,"formTitle":"[1723]完成所有工作的最短时间","frequency":3.5167157857,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":45445,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5583756345177665,"acs":330,"articleLive":2,"columnArticles":10,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"","submitted":591,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7883168169286938,"acs":10580,"articleLive":2,"columnArticles":141,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.2477729518,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13421,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.47868335813709184,"acs":5468,"articleLive":2,"columnArticles":106,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11423,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.575356415478615,"acs":3390,"articleLive":2,"columnArticles":83,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.2750821312,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5892,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.35532331809274986,"acs":1088,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3062,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6231217417969948,"acs":2032,"articleLive":2,"columnArticles":21,"formTitle":"[1729]求关注者的数量","frequency":0.2477729518,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"","submitted":3261,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5342592592592592,"acs":577,"articleLive":2,"columnArticles":23,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"","submitted":1080,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.4728216334334881,"acs":1731,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"","submitted":3661,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7926021975022179,"acs":11614,"articleLive":2,"columnArticles":198,"formTitle":"[1732]找到最高海拔","frequency":1.6309954146,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":14653,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4592017738359202,"acs":2071,"articleLive":2,"columnArticles":54,"formTitle":"[1733]需要教语言的最少人数","frequency":0.3334417464,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4510,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.723234889931807,"acs":27893,"articleLive":2,"columnArticles":366,"formTitle":"[1734]解码异或后的排列","frequency":2.6947955642,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38567,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4846153846153846,"acs":1008,"articleLive":2,"columnArticles":25,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2080,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4490170338621159,"acs":28390,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":2.0475311319,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":63227,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3094824591872178,"acs":3564,"articleLive":2,"columnArticles":100,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.3036065979,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11516,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.654184665850447,"acs":28319,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":1.8573474239,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43289,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4716746581424259,"acs":2656,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5631,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.6993548387096774,"acs":542,"articleLive":2,"columnArticles":17,"formTitle":"[1740]找到二叉树中的距离","frequency":0.5020685798,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"","submitted":775,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.844774814167031,"acs":1932,"articleLive":2,"columnArticles":31,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"","submitted":2287,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7079169869331283,"acs":8289,"articleLive":2,"columnArticles":128,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.2215934462,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11709,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.697040864255519,"acs":22260,"articleLive":2,"columnArticles":324,"formTitle":"[1743]从相邻元素对还原数组","frequency":2.0203924243,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":31935,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36276889488216785,"acs":28247,"articleLive":2,"columnArticles":367,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":2.6247371607,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":77865,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4850877192982456,"acs":3318,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":0.3036065979,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":6840,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5868661679135495,"acs":706,"articleLive":2,"columnArticles":29,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.3036065979,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"","submitted":1203,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7040875071963155,"acs":1223,"articleLive":2,"columnArticles":33,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"","submitted":1737,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7496162969164225,"acs":10745,"articleLive":2,"columnArticles":216,"formTitle":"[1748]唯一元素的和","frequency":0.8255314142,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":14334,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5311147589911953,"acs":3559,"articleLive":2,"columnArticles":84,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.794816469,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6701,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.458363296418812,"acs":3187,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":6953,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.47342453464902445,"acs":2111,"articleLive":2,"columnArticles":32,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.8908287567,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4459,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.682632115300626,"acs":9378,"articleLive":2,"columnArticles":111,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.2477729518,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":13738,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6285134124185102,"acs":5881,"articleLive":2,"columnArticles":125,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9357,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4210097719869707,"acs":4136,"articleLive":2,"columnArticles":90,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.2750821312,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":9824,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4004344677769732,"acs":2765,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.3974841127,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":6905,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8192771084337349,"acs":340,"articleLive":2,"columnArticles":12,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"","submitted":415,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9229299363057325,"acs":2898,"articleLive":2,"columnArticles":31,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"","submitted":3140,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6377245508982036,"acs":7029,"articleLive":2,"columnArticles":112,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11022,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.4282199299706634,"acs":4525,"articleLive":2,"columnArticles":95,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.3334417464,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10567,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5381383746881975,"acs":4099,"articleLive":2,"columnArticles":77,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7617,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4291258859264259,"acs":2543,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.5020685798,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":5926,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6797900262467191,"acs":518,"articleLive":2,"columnArticles":19,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"","submitted":762,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6093117408906883,"acs":3913,"articleLive":2,"columnArticles":79,"formTitle":"[1763]最长的美好子字符串","frequency":0.2477729518,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":6422,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4766512410601599,"acs":2266,"articleLive":2,"columnArticles":54,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4754,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5521549031855091,"acs":3536,"articleLive":2,"columnArticles":82,"formTitle":"[1765]地图中的最高点","frequency":0.2750821312,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6404,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37551020408163266,"acs":1380,"articleLive":2,"columnArticles":25,"formTitle":"[1766]互质树","frequency":0.5371296113,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3675,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7817460317460317,"acs":788,"articleLive":2,"columnArticles":21,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"","submitted":1008,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7648074002485158,"acs":11079,"articleLive":2,"columnArticles":200,"formTitle":"[1768]交替合并字符串","frequency":0.794816469,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":14486,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8555296957158866,"acs":9925,"articleLive":2,"columnArticles":168,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11601,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.3693186972693459,"acs":4071,"articleLive":2,"columnArticles":100,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.4319465169,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11023,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36561201661872805,"acs":2288,"articleLive":2,"columnArticles":46,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6258,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5177419354838709,"acs":321,"articleLive":2,"columnArticles":10,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"","submitted":620,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8423300763521812,"acs":15776,"articleLive":2,"columnArticles":198,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":1.0965214663,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":18729,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.552256976961978,"acs":5897,"articleLive":2,"columnArticles":89,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.2750821312,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10678,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4744311781932868,"acs":4212,"articleLive":2,"columnArticles":91,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.3646942899,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":8878,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4627187079407806,"acs":1719,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":1.3299924982,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3715,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7805952019435165,"acs":5141,"articleLive":2,"columnArticles":59,"formTitle":"[1777]每家商店的产品价格","frequency":2.7268132723,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"","submitted":6586,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5229357798165137,"acs":171,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"","submitted":327,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6472296152915558,"acs":5350,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.2477729518,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8266,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6634019340441358,"acs":5351,"articleLive":2,"columnArticles":108,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8066,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5179625352835514,"acs":4037,"articleLive":2,"columnArticles":59,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.3334417464,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7794,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.28786013297217433,"acs":1169,"articleLive":2,"columnArticles":32,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4061,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7961647727272727,"acs":1121,"articleLive":2,"columnArticles":27,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"","submitted":1408,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.4207899200387691,"acs":8683,"articleLive":2,"columnArticles":100,"formTitle":"[1784]检查二进制字符串字段","frequency":0.2215934462,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":20635,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.3487420514238319,"acs":6307,"articleLive":2,"columnArticles":61,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18085,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.34010771263083023,"acs":3347,"articleLive":2,"columnArticles":87,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9841,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.654303084388421,"acs":11731,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":2.8187018647,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":17929,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6911196911196911,"acs":179,"articleLive":2,"columnArticles":13,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"","submitted":259,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7063766683143846,"acs":1429,"articleLive":2,"columnArticles":29,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"","submitted":2023,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.647674652707872,"acs":12868,"articleLive":2,"columnArticles":142,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":19868,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8097556880194778,"acs":9645,"articleLive":2,"columnArticles":135,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":11911,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5128709753601511,"acs":6515,"articleLive":2,"columnArticles":104,"formTitle":"[1792]最大平均通过率","frequency":1.6641945863,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12703,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4128144485056977,"acs":3840,"articleLive":2,"columnArticles":92,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9302,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.6926605504587156,"acs":151,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"","submitted":218,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7886140923938404,"acs":1690,"articleLive":2,"columnArticles":28,"formTitle":"[1795]每个产品在不同商店的价格","frequency":1.1571522162,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"","submitted":2143,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48745270635472165,"acs":6313,"articleLive":2,"columnArticles":119,"formTitle":"[1796]字符串中第二大的数字","frequency":0.2215934462,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":12951,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5752092897650554,"acs":4260,"articleLive":2,"columnArticles":69,"formTitle":"[1797]设计一个验证系统","frequency":0.7652722227,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":7406,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5216262975778547,"acs":3015,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5780,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5176390773405699,"acs":2289,"articleLive":2,"columnArticles":35,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.3036065979,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4422,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6841274397244547,"acs":9534,"articleLive":2,"columnArticles":154,"formTitle":"[1800]最大升序子数组和","frequency":0.2477729518,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":13936,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.3774729376633072,"acs":4045,"articleLive":2,"columnArticles":107,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10716,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2623784402211911,"acs":4128,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":15733,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.40767432800934944,"acs":2093,"articleLive":2,"columnArticles":51,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":1.0400252239,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5134,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5730027548209367,"acs":416,"articleLive":2,"columnArticles":25,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.3646942899,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"","submitted":726,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4905884945999559,"acs":11129,"articleLive":2,"columnArticles":145,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.2477729518,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":22685,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.663552614506293,"acs":5114,"articleLive":2,"columnArticles":80,"formTitle":"[1806]还原排列的最少操作步数","frequency":1.2922521702,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7707,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5848645281843663,"acs":5634,"articleLive":2,"columnArticles":86,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9633,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.26754337495855895,"acs":2421,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.5371296113,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9049,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.63290113452188,"acs":1562,"articleLive":2,"columnArticles":30,"formTitle":"[1809]没有广告的剧集","frequency":1.1571522162,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"","submitted":2468,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6298932384341637,"acs":177,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.8908287567,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"","submitted":281,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6640625,"acs":765,"articleLive":2,"columnArticles":24,"formTitle":"[1811]寻找面试候选人","frequency":0.3036065979,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"","submitted":1152,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7947100712105799,"acs":7812,"articleLive":2,"columnArticles":182,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":9830,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5142773608810057,"acs":5277,"articleLive":2,"columnArticles":71,"formTitle":"[1813]句子相似性 III","frequency":1.2922521702,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10261,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3430895922214505,"acs":3458,"articleLive":2,"columnArticles":78,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.2750821312,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10079,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.299150036954915,"acs":1619,"articleLive":2,"columnArticles":38,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5412,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.751723626658759,"acs":10140,"articleLive":2,"columnArticles":150,"formTitle":"[1816]截断句子","frequency":0.2477729518,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":13489,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6972716488730724,"acs":5878,"articleLive":2,"columnArticles":95,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.2477729518,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8430,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3742203134814555,"acs":25618,"articleLive":2,"columnArticles":337,"formTitle":"[1818]绝对差值和","frequency":2.1941157216,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":68457,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.36667738822772594,"acs":2280,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6218,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5,"acs":93,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"","submitted":186,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9014817781337605,"acs":2251,"articleLive":2,"columnArticles":21,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":1.1891993936,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"","submitted":2497,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8121126993307445,"acs":19658,"articleLive":2,"columnArticles":196,"formTitle":"[1822]数组元素积的符号","frequency":0.7652722227,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":24206,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7107146091839507,"acs":7847,"articleLive":2,"columnArticles":96,"formTitle":"[1823]找出游戏的获胜者","frequency":0.7368208014,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":11041,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6590733258832632,"acs":7667,"articleLive":2,"columnArticles":152,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11633,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2858856893542757,"acs":2621,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.3646942899,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9168,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.44052044609665425,"acs":237,"articleLive":2,"columnArticles":18,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"","submitted":538,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7950634451590475,"acs":9148,"articleLive":2,"columnArticles":136,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":11506,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8688104392403588,"acs":7457,"articleLive":2,"columnArticles":98,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.7652722227,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8583,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6805022671782351,"acs":3902,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5734,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4844290657439446,"acs":840,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1734,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7378551787351054,"acs":805,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"","submitted":1091,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8231053840265374,"acs":12903,"articleLive":2,"columnArticles":208,"formTitle":"[1832]判断句子是否为全字母句","frequency":1.1262855682,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":15676,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6848785262127646,"acs":43385,"articleLive":2,"columnArticles":388,"formTitle":"[1833]雪糕的最大数量","frequency":1.3898906398,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":63347,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3508561129468309,"acs":5840,"articleLive":2,"columnArticles":124,"formTitle":"[1834]单线程 CPU","frequency":1.4214639017,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":16645,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5089412432585865,"acs":3586,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.4670075484,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7046,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7117988394584139,"acs":368,"articleLive":2,"columnArticles":26,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":1.0000678509,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"","submitted":517,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7950837041746133,"acs":7504,"articleLive":2,"columnArticles":84,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.2477729518,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9438,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.4296887901397667,"acs":28622,"articleLive":2,"columnArticles":300,"formTitle":"[1838]最高频元素的频数","frequency":2.825959054,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":66611,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.575860527492177,"acs":6441,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11185,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.38822115384615385,"acs":1938,"articleLive":2,"columnArticles":46,"formTitle":"[1840]最高建筑高度","frequency":0.3646942899,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":4992,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5215711526078558,"acs":810,"articleLive":2,"columnArticles":27,"formTitle":"[1841]联赛信息统计","frequency":1.1891993936,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"","submitted":1553,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6891891891891891,"acs":102,"articleLive":2,"columnArticles":10,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"","submitted":148,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5107142857142857,"acs":572,"articleLive":2,"columnArticles":22,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.2477729518,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"","submitted":1120,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.80190959632584,"acs":6635,"articleLive":2,"columnArticles":109,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":8274,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5494125148009837,"acs":6032,"articleLive":2,"columnArticles":58,"formTitle":"[1845]座位预约管理系统","frequency":0.2215934462,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":10979,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6337295347331422,"acs":27405,"articleLive":2,"columnArticles":374,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":1.9516807148,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43244,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.360044080604534,"acs":2287,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.3334417464,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6352,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.682993445010925,"acs":7502,"articleLive":2,"columnArticles":99,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":10984,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.328906018381263,"acs":5547,"articleLive":2,"columnArticles":108,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.2750821312,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":16865,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6057516339869281,"acs":2317,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.3334417464,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3825,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40102459016393444,"acs":1957,"articleLive":2,"columnArticles":47,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4880,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7090163934426229,"acs":173,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"","submitted":244,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6451612903225806,"acs":940,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.3036065979,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"","submitted":1457,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7908004696456937,"acs":11450,"articleLive":2,"columnArticles":118,"formTitle":"[1854]人口最多的年份","frequency":1.1571522162,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":14479,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6874087833355447,"acs":10362,"articleLive":2,"columnArticles":99,"formTitle":"[1855]下标对中的最大距离","frequency":1.0965214663,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15074,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35517072373795133,"acs":4348,"articleLive":2,"columnArticles":81,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.8575034469,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12242,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4492137696557586,"acs":2114,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4706,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6493506493506493,"acs":300,"articleLive":2,"columnArticles":16,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.6256830086,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"","submitted":462,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7699361578641903,"acs":6633,"articleLive":2,"columnArticles":142,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":8615,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7712328767123288,"acs":3941,"articleLive":2,"columnArticles":64,"formTitle":"[1860]增长的内存泄露","frequency":0.2477729518,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5110,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6181229773462783,"acs":3247,"articleLive":2,"columnArticles":67,"formTitle":"[1861]旋转盒子","frequency":0.2750821312,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5253,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3103643038689636,"acs":2198,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7082,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9143197735061839,"acs":12272,"articleLive":2,"columnArticles":138,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":1.9853993508,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":13422,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.38732522244416195,"acs":4266,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.3036065979,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11014,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5137849547065774,"acs":5218,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.1964664962,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10156,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5962119132583036,"acs":2172,"articleLive":2,"columnArticles":48,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":1.0000678509,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3643,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7447183098591549,"acs":423,"articleLive":2,"columnArticles":14,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"","submitted":568,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5333333333333333,"acs":120,"articleLive":2,"columnArticles":10,"formTitle":"[1868]两个行程编码数组的积","frequency":0.6743307328,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"","submitted":225,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7916271422247518,"acs":12518,"articleLive":2,"columnArticles":135,"formTitle":"[1869]哪种连续子字符串更长","frequency":1.4214639017,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":15813,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.45874628344895935,"acs":7406,"articleLive":2,"columnArticles":69,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.3334417464,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16144,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27662075125758073,"acs":5884,"articleLive":2,"columnArticles":125,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":21271,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.620980330939744,"acs":1989,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3203,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8054357204486626,"acs":1867,"articleLive":2,"columnArticles":30,"formTitle":"[1873]计算特殊奖金","frequency":1.5989824376,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"","submitted":2318,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8833333333333333,"acs":265,"articleLive":2,"columnArticles":16,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"","submitted":300,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7424547283702213,"acs":369,"articleLive":2,"columnArticles":18,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"","submitted":497,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.727766548762001,"acs":5761,"articleLive":2,"columnArticles":90,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":7916,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8188120414328873,"acs":30355,"articleLive":2,"columnArticles":399,"formTitle":"[1877]数组中最大数对和的最小值","frequency":2.5521890415,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":37072,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.42755537492379597,"acs":2104,"articleLive":2,"columnArticles":54,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":4921,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.41054529067147366,"acs":1822,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.3974841127,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4438,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7715503462972829,"acs":7241,"articleLive":2,"columnArticles":95,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.2215934462,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":9385,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.35301492537313434,"acs":5913,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":16750,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2785341943515133,"acs":3580,"articleLive":2,"columnArticles":109,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":12853,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.3746197305519339,"acs":1724,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4602,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6916461916461917,"acs":1689,"articleLive":2,"columnArticles":35,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":1.5680776295,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":2442,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5281173594132029,"acs":216,"articleLive":2,"columnArticles":10,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"","submitted":409,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5715990453460621,"acs":5269,"articleLive":2,"columnArticles":76,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.794816469,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9218,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6421745867768595,"acs":4973,"articleLive":2,"columnArticles":61,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.2477729518,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7744,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3152538452642535,"acs":2726,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.3646942899,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8647,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2722236876813506,"acs":2064,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.9256148727,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7582,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7051495016611296,"acs":849,"articleLive":2,"columnArticles":19,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"","submitted":1204,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.5130023640661938,"acs":217,"articleLive":2,"columnArticles":10,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"","submitted":423,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.32972972972972975,"acs":427,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.3334417464,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"","submitted":1295,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.591452406742299,"acs":31124,"articleLive":2,"columnArticles":408,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":2.1612900172,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":52623,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.4583667033737111,"acs":36629,"articleLive":2,"columnArticles":508,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.5511550866,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":79912,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5286204167765761,"acs":2004,"articleLive":2,"columnArticles":39,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3791,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5036407766990292,"acs":830,"articleLive":2,"columnArticles":30,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1648,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5302571205956195,"acs":6125,"articleLive":2,"columnArticles":76,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.794816469,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11551,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3087884156204267,"acs":4009,"articleLive":2,"columnArticles":61,"formTitle":"[1898]可移除字符的最大数目","frequency":0.3646942899,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":12983,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6295336787564767,"acs":3645,"articleLive":2,"columnArticles":42,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5790,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.43206810925860234,"acs":1218,"articleLive":2,"columnArticles":33,"formTitle":"[1900]最佳运动员的比拼回合","frequency":1.5480549364,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2819,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.659729448491155,"acs":634,"articleLive":2,"columnArticles":24,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":961,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.43670886075949367,"acs":69,"articleLive":2,"columnArticles":3,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"","submitted":158,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6434289826392012,"acs":7153,"articleLive":2,"columnArticles":101,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":11117,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.27732826948480843,"acs":3359,"articleLive":2,"columnArticles":69,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":12112,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5694826293426644,"acs":4557,"articleLive":2,"columnArticles":89,"formTitle":"[1905]统计子岛屿","frequency":0.2477729518,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":8002,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4234623358673117,"acs":2451,"articleLive":2,"columnArticles":54,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.8908287567,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5788,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5918079096045198,"acs":419,"articleLive":2,"columnArticles":17,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"","submitted":708,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6836158192090396,"acs":121,"articleLive":2,"columnArticles":6,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"","submitted":177,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.3267435878591901,"acs":4446,"articleLive":2,"columnArticles":71,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.3646942899,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":13607,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6755258126195028,"acs":3533,"articleLive":2,"columnArticles":56,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5230,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5710102489019033,"acs":3120,"articleLive":2,"columnArticles":67,"formTitle":"[1911]最大子序列交替和","frequency":0.7652722227,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5464,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.28205618192241544,"acs":1476,"articleLive":2,"columnArticles":37,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":5233,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8416975780056731,"acs":7715,"articleLive":2,"columnArticles":80,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.794816469,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":9166,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4419828302409305,"acs":3192,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.8575034469,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7222,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3909952606635071,"acs":2805,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7174,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5481231953801733,"acs":1139,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":1.0400252239,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2078,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.28399518652226236,"acs":236,"articleLive":2,"columnArticles":9,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"","submitted":831,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.47257383966244726,"acs":112,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"","submitted":237,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3851508120649652,"acs":332,"articleLive":2,"columnArticles":11,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"","submitted":862,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.921024751998459,"acs":9563,"articleLive":2,"columnArticles":81,"formTitle":"[1920]基于排列构建数组","frequency":0.2477729518,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":10383,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.3436053515946991,"acs":5419,"articleLive":2,"columnArticles":87,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.8255314142,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":15771,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3614362543498893,"acs":4570,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.2477729518,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12644,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.2371117254838185,"acs":1458,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":1.2571911387,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6149,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.40458015267175573,"acs":53,"articleLive":2,"columnArticles":4,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"","submitted":131,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6992223950233282,"acs":4496,"articleLive":2,"columnArticles":55,"formTitle":"[1925]统计平方和三元组的数目","frequency":1.4214639017,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":6430,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3430822255046775,"acs":3484,"articleLive":2,"columnArticles":57,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10155,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4116240133939249,"acs":1721,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":0.3334417464,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4181,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.39648544755628773,"acs":2166,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":1.48824996,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5463,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9216430221049159,"acs":11174,"articleLive":2,"columnArticles":94,"formTitle":"[1929]数组串联","frequency":0.7652722227,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":12124,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4762283492400141,"acs":5389,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.794816469,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11316,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5564606741573034,"acs":1981,"articleLive":2,"columnArticles":62,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.4319465169,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3560,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3246672856700712,"acs":1049,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.9619825169,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3231,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5591836734693878,"acs":411,"articleLive":2,"columnArticles":23,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.4670075484,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"","submitted":735,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7593220338983051,"acs":224,"articleLive":2,"columnArticles":10,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"","submitted":295,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7391803466880955,"acs":6439,"articleLive":2,"columnArticles":91,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":8711,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.44898788716364524,"acs":5523,"articleLive":2,"columnArticles":58,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12301,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.2418633832640577,"acs":3084,"articleLive":2,"columnArticles":62,"formTitle":"[1937]扣分后的最大得分","frequency":0.794816469,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":12751,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3410422448350293,"acs":1106,"articleLive":2,"columnArticles":40,"formTitle":"[1938]查询最大基因差","frequency":1.0400252239,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3243,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6144781144781145,"acs":365,"articleLive":2,"columnArticles":12,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"","submitted":594,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.8042959427207638,"acs":337,"articleLive":2,"columnArticles":22,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"","submitted":419,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7727272727272727,"acs":4471,"articleLive":2,"columnArticles":81,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":5786,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.3852261449028782,"acs":2717,"articleLive":2,"columnArticles":64,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7053,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.40524327927127307,"acs":1824,"articleLive":2,"columnArticles":49,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4501,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5700215450907972,"acs":1852,"articleLive":2,"columnArticles":47,"formTitle":"[1944]队列中可以看到的人数","frequency":0.2750821312,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3249,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.662526096033403,"acs":6347,"articleLive":2,"columnArticles":70,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.2477729518,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":9580,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.303166897827092,"acs":5246,"articleLive":2,"columnArticles":77,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.794816469,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17304,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.540131940626718,"acs":3930,"articleLive":2,"columnArticles":84,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7276,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5136165577342048,"acs":943,"articleLive":2,"columnArticles":19,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.5020685798,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1836,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5147058823529411,"acs":175,"articleLive":2,"columnArticles":11,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"","submitted":340,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5462962962962963,"acs":118,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"","submitted":216,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6987577639751553,"acs":225,"articleLive":2,"columnArticles":12,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"","submitted":322,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5429875315785184,"acs":6663,"articleLive":2,"columnArticles":76,"formTitle":"[1952]三除数","frequency":0.2477729518,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":12271,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3237762237762238,"acs":4167,"articleLive":2,"columnArticles":82,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":12870,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4794358184188693,"acs":4045,"articleLive":2,"columnArticles":66,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.2477729518,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8437,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49495928654517257,"acs":2553,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5158,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4429530201342282,"acs":132,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":0.9619825169,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"","submitted":298,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6106011252591057,"acs":4124,"articleLive":2,"columnArticles":55,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":6754,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.4215720221606648,"acs":2435,"articleLive":2,"columnArticles":43,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5776,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.4112391930835735,"acs":1427,"articleLive":2,"columnArticles":31,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3470,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.2825350749879052,"acs":584,"articleLive":2,"columnArticles":18,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.3646942899,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2067,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5356374930317751,"acs":6726,"articleLive":2,"columnArticles":61,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.1964664962,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":12557,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4263987391646966,"acs":5411,"articleLive":2,"columnArticles":73,"formTitle":"[1962]移除石子使总数最小","frequency":0.8255314142,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":12690,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6131953428201811,"acs":4266,"articleLive":2,"columnArticles":53,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.2750821312,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":6957,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3826021934197408,"acs":3070,"articleLive":2,"columnArticles":44,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8024,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7547683923705722,"acs":277,"articleLive":2,"columnArticles":11,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"","submitted":367,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7333333333333333,"acs":33,"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":"","submitted":45,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7759291560445458,"acs":5783,"articleLive":2,"columnArticles":55,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":7453,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3554141128398554,"acs":4523,"articleLive":2,"columnArticles":65,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":12726,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.277793960578697,"acs":2861,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":1.1262855682,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10299,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.47950727883538635,"acs":2141,"articleLive":2,"columnArticles":48,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":0.8255314142,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4465,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5571687840290381,"acs":307,"articleLive":2,"columnArticles":17,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":551,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.48109965635738833,"acs":140,"articleLive":2,"columnArticles":6,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.3334417464,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"","submitted":291,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5233644859813084,"acs":56,"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":"","submitted":107,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7496399917712405,"acs":3644,"articleLive":2,"columnArticles":51,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.0350610315,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":4861,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.38028559545265495,"acs":2743,"articleLive":2,"columnArticles":45,"formTitle":"[1975]最大方阵和","frequency":0.5020685798,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":7213,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.2827564894932015,"acs":1830,"articleLive":2,"columnArticles":35,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":6472,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.24689226519337015,"acs":715,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":2896,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5535168195718655,"acs":181,"articleLive":2,"columnArticles":7,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.3974841127,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"","submitted":327,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.819640252795333,"acs":6744,"articleLive":2,"columnArticles":73,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":8228,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5795454545454546,"acs":5610,"articleLive":2,"columnArticles":90,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.4144971124,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":9680,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.2960920479302832,"acs":4349,"articleLive":2,"columnArticles":82,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":0.9375553131,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":14688,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.45852534562211983,"acs":796,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.3334417464,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1736,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6461538461538462,"acs":42,"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":"","submitted":65,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5821039127645927,"acs":5445,"articleLive":2,"columnArticles":60,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":9354,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.40998300108174934,"acs":5306,"articleLive":2,"columnArticles":75,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":12942,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2724531894636623,"acs":3434,"articleLive":2,"columnArticles":71,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.1051830944,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":12604,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.4539340954942838,"acs":1350,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":2974,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6645569620253164,"acs":105,"articleLive":2,"columnArticles":4,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":1.1730230461,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"","submitted":158,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.41333333333333333,"acs":31,"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":"","submitted":75,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.6140350877192983,"acs":105,"articleLive":2,"columnArticles":6,"formTitle":"[1990]Count the Number of Experiments","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"","submitted":171,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6586849106803496,"acs":3466,"articleLive":2,"columnArticles":45,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":5262,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5924388111888111,"acs":2711,"articleLive":2,"columnArticles":54,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":4576,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.38181818181818183,"acs":1680,"articleLive":2,"columnArticles":41,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4400,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.36055075248158824,"acs":1126,"articleLive":2,"columnArticles":31,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3123,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.545929018789144,"acs":5230,"articleLive":2,"columnArticles":37,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":9580,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.24126083874134263,"acs":4424,"articleLive":2,"columnArticles":93,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":18337,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.3397447106137437,"acs":1943,"articleLive":2,"columnArticles":35,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.3334417464,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":5719,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.41791875347801893,"acs":1502,"articleLive":2,"columnArticles":30,"formTitle":"[1998]数组的最大公因数排序","frequency":0.6743307328,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3594,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.7037037037037037,"acs":38,"articleLive":2,"columnArticles":4,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"","submitted":54,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7805982436882547,"acs":5689,"articleLive":2,"columnArticles":66,"formTitle":"[2000]反转单词前缀","frequency":0.2750821312,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":7288,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.35306363194781765,"acs":5088,"articleLive":2,"columnArticles":108,"formTitle":"[2001]可互换矩形的组数","frequency":0.2215934462,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":14411,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5664499819429397,"acs":3137,"articleLive":2,"columnArticles":82,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":5538,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.3740403071017274,"acs":1559,"articleLive":2,"columnArticles":36,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4168,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.35514018691588783,"acs":38,"articleLive":2,"columnArticles":1,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"","submitted":107,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.7333333333333333,"acs":11,"articleLive":2,"columnArticles":2,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"","submitted":15,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8449415140376781,"acs":80686,"articleLive":2,"columnArticles":623,"formTitle":"[LCP 01]猜数字","frequency":1.6309954146,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":95493,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6904688463911166,"acs":13431,"articleLive":2,"columnArticles":232,"formTitle":"[LCP 02]分式化简","frequency":1.3594236984,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":19452,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.2186584271902721,"acs":10969,"articleLive":2,"columnArticles":180,"formTitle":"[LCP 03]机器人大冒险","frequency":1.1571522162,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":50165,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.37756760750701934,"acs":2555,"articleLive":2,"columnArticles":59,"formTitle":"[LCP 04]覆盖","frequency":0.8575034469,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6767,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19814760074884225,"acs":2011,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10149,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8399547960953179,"acs":43109,"articleLive":2,"columnArticles":649,"formTitle":"[LCP 06]拿硬币","frequency":1.6309954146,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":51323,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7702845943081138,"acs":38515,"articleLive":2,"columnArticles":465,"formTitle":"[LCP 07]传递信息","frequency":3.1955862294,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":50001,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.286034353995519,"acs":4979,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 08]剧情触发时间","frequency":0.8255314142,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17407,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.2721053531725671,"acs":6364,"articleLive":2,"columnArticles":104,"formTitle":"[LCP 09]最小跳跃次数","frequency":3.1771678066,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":23388,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5853985264567984,"acs":1748,"articleLive":2,"columnArticles":34,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.8575034469,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":2986,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6867027247678335,"acs":6729,"articleLive":2,"columnArticles":66,"formTitle":"[LCP 11]期望个数统计","frequency":0.2750821312,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":9799,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.40853858784893265,"acs":6220,"articleLive":2,"columnArticles":100,"formTitle":"[LCP 12]小张刷题计划","frequency":1.8041382395,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":15225,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.613136310376253,"acs":9419,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.3646942899,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15362,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.20941545704197725,"acs":2669,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":1.1891993936,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12745,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5734989648033126,"acs":831,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.3974841127,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1449,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.30416447021613074,"acs":577,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1897,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7984233076263925,"acs":23294,"articleLive":2,"columnArticles":245,"formTitle":"[LCP 17]速算机器人","frequency":1.3594236984,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":29175,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.28590928006658345,"acs":17176,"articleLive":2,"columnArticles":221,"formTitle":"[LCP 18]早餐组合","frequency":1.4542214982,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":60075,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5164235020974594,"acs":19574,"articleLive":2,"columnArticles":202,"formTitle":"[LCP 19]秋叶收藏集","frequency":1.6309954146,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":37903,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3058486853872295,"acs":1710,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 20]快速公交","frequency":0.8575034469,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5591,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3285290377278508,"acs":775,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 21]追逐游戏","frequency":0.3334417464,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2359,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.33284485026115057,"acs":8858,"articleLive":2,"columnArticles":185,"formTitle":"[LCP 22]黑白方格画","frequency":2.2963497186,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26613,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3394446658695363,"acs":2555,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":0.794816469,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7527,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2755681818181818,"acs":873,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3168,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.3300204618532593,"acs":1129,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3421,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.33607075173720785,"acs":532,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1583,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.3273888741016769,"acs":1230,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.5020685798,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3757,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.2782451923076923,"acs":9723,"articleLive":2,"columnArticles":168,"formTitle":"[LCP 28]采购方案","frequency":1.3015329793,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":34944,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.184010584010584,"acs":4868,"articleLive":2,"columnArticles":119,"formTitle":"[LCP 29]乐团站位","frequency":2.3560783428,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":26455,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3460672712071516,"acs":5381,"articleLive":2,"columnArticles":92,"formTitle":"[LCP 30]魔塔游戏","frequency":0.2215934462,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":15549,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.24832014334776767,"acs":1663,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":1.1262855682,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6697,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.3990403838464614,"acs":998,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":0.8255314142,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2501,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.21188986849234104,"acs":4302,"articleLive":2,"columnArticles":82,"formTitle":"[LCP 33]蓄水","frequency":1.4214639017,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":20303,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.474449433397477,"acs":2219,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 34]二叉树染色","frequency":1.4214639017,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4677,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.39158345221112695,"acs":1098,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 35]电动车游城市","frequency":0.8575034469,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2804,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.25769629885852646,"acs":745,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":1.7718252505,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":2891,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19140625,"acs":735,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 37]最小矩形面积","frequency":1.523645621,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":3840,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5515923566878981,"acs":433,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 38]守卫城堡","frequency":0.9256148727,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":785,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.4975913856616605,"acs":3512,"articleLive":2,"columnArticles":27,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7058,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.2197947992216522,"acs":2485,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":11306,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.40879422878735827,"acs":1190,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":2911,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.1948655750960178,"acs":964,"articleLive":2,"columnArticles":27,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":4947,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.3914940021810251,"acs":359,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":917,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.5425320056899005,"acs":3814,"articleLive":2,"columnArticles":91,"formTitle":"[LCS 01]下载插件","frequency":1.4214639017,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":7030,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.7002888247056209,"acs":3152,"articleLive":2,"columnArticles":64,"formTitle":"[LCS 02]完成一半题目","frequency":0.8255314142,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":4501,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4182422074603986,"acs":1637,"articleLive":2,"columnArticles":53,"formTitle":"[LCS 03]主题空间","frequency":0.3036065979,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":3914,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.678511048339966,"acs":390095,"articleLive":2,"columnArticles":2742,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":4.5876762712,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":574928,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4029937047374115,"acs":253693,"articleLive":2,"columnArticles":2036,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":3.5469121094,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":629521,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7612540436786237,"acs":276033,"articleLive":2,"columnArticles":1897,"formTitle":"[剑指 Offer 05]替换空格","frequency":3.1583442045,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":362603,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7518232391229918,"acs":292051,"articleLive":2,"columnArticles":2036,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":3.7380688173,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":388457,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6970994230501091,"acs":184983,"articleLive":2,"columnArticles":1429,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":3.693637848,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":265361,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7164831734861813,"acs":252503,"articleLive":2,"columnArticles":1618,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":4.429586449,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":352420,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.35962851273000146,"acs":255921,"articleLive":2,"columnArticles":1833,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":2.6439305846,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":711626,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.44279849245761205,"acs":189392,"articleLive":2,"columnArticles":1295,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":3.2741374217,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":427716,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.492963366890922,"acs":254481,"articleLive":2,"columnArticles":1604,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":3.8538934613,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":516227,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.452394993774982,"acs":165696,"articleLive":2,"columnArticles":1110,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":2.8138938164,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":366264,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5259715039771493,"acs":171989,"articleLive":2,"columnArticles":1680,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":3.6346917569,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":326993,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5687956244787092,"acs":154122,"articleLive":2,"columnArticles":1282,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":3.1217519674,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":270962,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.31149690207814945,"acs":81496,"articleLive":2,"columnArticles":482,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":1.3594236984,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":261627,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7467557025904716,"acs":195476,"articleLive":2,"columnArticles":1237,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":2.2149016293,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":261767,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.33916784535596417,"acs":120855,"articleLive":2,"columnArticles":742,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":1.5382103993,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":356328,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7770953814361251,"acs":147408,"articleLive":2,"columnArticles":1108,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":3.0858414661,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":189691,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5959177713238039,"acs":183641,"articleLive":2,"columnArticles":1436,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":2.7902058491,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":308165,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.37579059138543924,"acs":65120,"articleLive":2,"columnArticles":437,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":2.6591284455,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":173288,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.2406903456863022,"acs":75002,"articleLive":2,"columnArticles":831,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":3.2103053648,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":311612,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.642761194795074,"acs":188052,"articleLive":2,"columnArticles":1600,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":2.8030545419,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":292569,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7977079876005887,"acs":254764,"articleLive":2,"columnArticles":2410,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":2.9776180658,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":319370,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7426915799432355,"acs":282609,"articleLive":2,"columnArticles":1793,"formTitle":"[剑指 Offer 24]反转链表","frequency":4.4640819563,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":380520,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7285003870518001,"acs":179748,"articleLive":2,"columnArticles":1168,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":3.7685225098,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":246737,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4654151801537692,"acs":140500,"articleLive":2,"columnArticles":1156,"formTitle":"[剑指 Offer 26]树的子结构","frequency":3.4176845113,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":301881,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7914217240836203,"acs":185920,"articleLive":2,"columnArticles":1374,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":3.0405715107,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":234919,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5802457784316234,"acs":145145,"articleLive":2,"columnArticles":1064,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":2.5170054775,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":250144,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.4399179094775551,"acs":142119,"articleLive":2,"columnArticles":1460,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":3.8937201084,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":323058,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5711895807394286,"acs":133499,"articleLive":2,"columnArticles":896,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":2.8689246796,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":233721,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6148510583506412,"acs":109829,"articleLive":2,"columnArticles":925,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":1.9558288935,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":178627,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6447021047135237,"acs":132113,"articleLive":2,"columnArticles":930,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":3.0046996589,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":204921,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6859689464798069,"acs":132451,"articleLive":2,"columnArticles":1069,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":2.762526252,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":193086,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5884620300079237,"acs":115112,"articleLive":2,"columnArticles":1108,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":2.7835431554,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":195615,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5507908153024769,"acs":109766,"articleLive":2,"columnArticles":931,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":2.8381766769,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":199288,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5768848476744445,"acs":129427,"articleLive":2,"columnArticles":849,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":3.0807265835,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":224355,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7206873677227785,"acs":114074,"articleLive":2,"columnArticles":803,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":2.9418965031,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":158285,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6544140483461877,"acs":101141,"articleLive":2,"columnArticles":878,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":3.245006973,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":154552,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5605427974947808,"acs":75717,"articleLive":2,"columnArticles":550,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":3.311961029,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":135078,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5791127389298341,"acs":154637,"articleLive":2,"columnArticles":1096,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":4.3781812106,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":267024,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6899525476206502,"acs":164010,"articleLive":2,"columnArticles":1009,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":2.8030545419,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":237712,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.569709219858156,"acs":240987,"articleLive":2,"columnArticles":1790,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":3.579544203,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":423000,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5811476894621934,"acs":60956,"articleLive":2,"columnArticles":452,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":2.1295748855,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":104889,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6053950769922446,"acs":215448,"articleLive":2,"columnArticles":1497,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":4.2939688729,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":355880,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.48415693140539945,"acs":48116,"articleLive":2,"columnArticles":500,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":2.5594443878,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":99381,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.4142451755023367,"acs":54158,"articleLive":2,"columnArticles":449,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":2.377961054,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":130739,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.561393663417137,"acs":105039,"articleLive":2,"columnArticles":784,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":3.3424233296,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":187104,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5366797878916035,"acs":115479,"articleLive":2,"columnArticles":1401,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":3.4238794651,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":215173,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6889923971511855,"acs":114638,"articleLive":2,"columnArticles":968,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":2.6827590346,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":166385,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46435601687989136,"acs":146020,"articleLive":2,"columnArticles":1008,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":3.4648853444,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":314457,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6515376248393158,"acs":85657,"articleLive":2,"columnArticles":506,"formTitle":"[剑指 Offer 49]丑数","frequency":3.2662540541,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":131469,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6141420807939882,"acs":147025,"articleLive":2,"columnArticles":1030,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":3.0668873349,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":239399,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4818876881024873,"acs":99079,"articleLive":2,"columnArticles":834,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":4.4616948218,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":205606,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6485163413881513,"acs":170231,"articleLive":2,"columnArticles":1033,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":3.232361839,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":262493,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5385137976772023,"acs":183106,"articleLive":2,"columnArticles":1547,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":2.9764780956,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":340021,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44698103550827883,"acs":161568,"articleLive":2,"columnArticles":1434,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":2.7720642135,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":361465,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7556989824786857,"acs":157598,"articleLive":2,"columnArticles":1120,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":2.2109691063,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":208546,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7897520932973373,"acs":172887,"articleLive":2,"columnArticles":1246,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":2.8381766769,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":218913,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5871091820170795,"acs":133100,"articleLive":2,"columnArticles":917,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":2.4026293005,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":226704,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6995380097635183,"acs":112201,"articleLive":2,"columnArticles":1005,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":3.0983316932,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":160393,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.7996676952290529,"acs":87594,"articleLive":2,"columnArticles":681,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":2.3560783428,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":109538,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.664637991765665,"acs":129629,"articleLive":2,"columnArticles":824,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":3.1850642468,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":195037,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.70651959101736,"acs":135851,"articleLive":2,"columnArticles":1839,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":2.8886499631,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":192282,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.441235014144745,"acs":125245,"articleLive":2,"columnArticles":952,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":2.9277219214,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":283851,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8568763395607543,"acs":197498,"articleLive":2,"columnArticles":1749,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":2.5489820089,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":230486,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44379986500752844,"acs":128216,"articleLive":2,"columnArticles":1173,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":3.5880837402,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":288905,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4748958505197162,"acs":92107,"articleLive":2,"columnArticles":1049,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":2.3412192284,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":193952,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5611828898380778,"acs":63458,"articleLive":2,"columnArticles":571,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":2.5594443878,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":113079,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4595016080890349,"acs":99296,"articleLive":2,"columnArticles":956,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":2.882910188,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":216095,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6553346960257525,"acs":107083,"articleLive":2,"columnArticles":753,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":3.6421179931,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":163402,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6335983373352974,"acs":125602,"articleLive":2,"columnArticles":930,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":3.1674071083,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":198236,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8573417285022797,"acs":134258,"articleLive":2,"columnArticles":1272,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":2.5082404113,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":156598,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5822919571113533,"acs":68916,"articleLive":2,"columnArticles":482,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":2.2933081687,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":118353,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5976279692772004,"acs":70495,"articleLive":2,"columnArticles":509,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":2.7445044991,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":117958,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28602322268744335,"acs":66263,"articleLive":2,"columnArticles":547,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":2.2344487724,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":231670,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6932487429718632,"acs":114298,"articleLive":2,"columnArticles":676,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":2.2344487724,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":164873,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.6999741548004381,"acs":113750,"articleLive":2,"columnArticles":672,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":2.8292758616,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":162506,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20377536256267034,"acs":6056,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.9871727657,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":29719,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5831379345499031,"acs":5720,"articleLive":2,"columnArticles":101,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0701220629,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":9809,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7834493426140758,"acs":7091,"articleLive":2,"columnArticles":113,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.6025123706,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":9051,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.688693795230751,"acs":5805,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.1490979442,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":8429,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7128178335074887,"acs":4093,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.2477729518,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":5742,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6654145077720207,"acs":5137,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.7652722227,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":7720,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4575461685417109,"acs":4311,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.1723223972,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":9422,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5045384887421903,"acs":4280,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":8483,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5431235431235432,"acs":3495,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":6435,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4350333597195522,"acs":3847,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.7093917643,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":8843,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5672937771345875,"acs":2744,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":1.0400252239,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":4837,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6613756613756614,"acs":3375,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.1267356528,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":5103,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6605402394876079,"acs":2372,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.1964664962,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":3591,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5033619723571162,"acs":2695,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":5354,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6412168207575306,"acs":2150,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":3353,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.4947257383966245,"acs":3283,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.2215934462,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":6636,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5228070175438596,"acs":1788,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":3420,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5307158571670333,"acs":3136,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":5909,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4705564559697461,"acs":2613,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":0.7093917643,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":5553,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7064920894708129,"acs":2590,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.1964664962,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":3666,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5359609914668834,"acs":3957,"articleLive":2,"columnArticles":63,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":1.0677893615,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":7383,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5209400757406994,"acs":4677,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.6496075947,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":8978,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7044463818657367,"acs":3232,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.1964664962,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":4588,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7673021676677984,"acs":8814,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 024]反转链表","frequency":1.0677893615,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":11487,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6085067459410016,"acs":2661,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":1.5989824376,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":4373,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6471714164185453,"acs":3043,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 026]重排链表","frequency":1.0965214663,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":4702,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6085112024393478,"acs":4590,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.1051830944,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":7543,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6120848708487084,"acs":1327,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.794816469,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":2168,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.29270232650626365,"acs":1472,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":5029,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5353238015138773,"acs":1273,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":2378,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5827949676980619,"acs":1714,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":2941,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.6001107726391581,"acs":2167,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":3611,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.785956416464891,"acs":1623,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":2065,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5742499050512723,"acs":1512,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":2633,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6909007773205305,"acs":1511,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":2187,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5918367346938775,"acs":1682,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":2842,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.45052807115063925,"acs":1621,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":3598,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7766065963957838,"acs":2284,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.1723223972,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":2941,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5170043415340086,"acs":1429,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":2764,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5729600952948184,"acs":962,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.7093917643,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":1679,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.789039039039039,"acs":2102,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":2664,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8514705882352941,"acs":1737,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":2040,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6479894528675016,"acs":983,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.2215934462,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":1517,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6385930945466279,"acs":1979,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":3099,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8034261241970021,"acs":1876,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":2335,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7162643450732094,"acs":1810,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.2215934462,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":2527,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6826034552028927,"acs":1699,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.2215934462,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":2489,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6739674593241552,"acs":1077,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.3036065979,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":1598,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7466933867735471,"acs":1863,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.7368208014,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":2495,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6137724550898204,"acs":1230,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":2004,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.41234756097560976,"acs":1082,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":1.1571522162,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":2624,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7331566994700984,"acs":1937,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.1051830944,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":2642,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6426543647977289,"acs":1811,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.1964664962,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":2818,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8434925864909391,"acs":1536,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":1821,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.891972993248312,"acs":1189,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":1333,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7243727598566309,"acs":2021,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.1964664962,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":2790,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.34713820381572824,"acs":746,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":2149,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5836637589214909,"acs":736,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":1261,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6190476190476191,"acs":1274,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":2058,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6665060240963856,"acs":1383,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":2075,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5317647058823529,"acs":904,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.1964664962,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":1700,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7378435517970402,"acs":1047,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":1419,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7182576459684893,"acs":775,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":1079,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.627906976744186,"acs":621,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":989,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6258426966292134,"acs":557,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":890,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6297029702970297,"acs":636,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":1010,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6276477146042363,"acs":563,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":897,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.513579576317219,"acs":1891,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":3682,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7306489444878812,"acs":1869,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"","submitted":2558,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6878589007383101,"acs":1677,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":2438,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5147679324894515,"acs":610,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.2750821312,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":1185,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.42520415738678546,"acs":2291,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":5388,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.532715095311695,"acs":1034,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":1941,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5413637937002423,"acs":1564,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.7368208014,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":2889,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7066549912434326,"acs":1614,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":2284,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6732055283102987,"acs":3020,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":1.4214639017,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":4486,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.569372852233677,"acs":2651,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.1964664962,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":4656,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6333943833943834,"acs":2075,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.2477729518,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":3276,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8407041648776299,"acs":1958,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.1964664962,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":2329,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8029850746268656,"acs":1345,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":1675,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7900662251655629,"acs":2386,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":3020,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.637593984962406,"acs":1696,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.2215934462,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":2660,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8549323017408124,"acs":2210,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.7368208014,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":2585,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6746506986027944,"acs":1690,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":1.1571522162,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":2505,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8548065416832868,"acs":2143,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.2215934462,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":2507,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7697516930022573,"acs":1364,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.2215934462,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":1772,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6385271665918276,"acs":1422,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":1.1262855682,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":2227,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7413600891861761,"acs":2660,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":3588,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6164225134926754,"acs":1599,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":2594,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5187713310580204,"acs":912,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.1964664962,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":1758,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7504499100179964,"acs":1251,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.2477729518,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":1667,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6543810848400556,"acs":941,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":1438,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5441077441077441,"acs":808,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":1485,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5854738706820195,"acs":661,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":1129,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6609449076344613,"acs":4043,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":2.2963497186,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":6117,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.49269311064718163,"acs":708,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":1437,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5294117647058824,"acs":585,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.2215934462,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":1105,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7697006719609041,"acs":1260,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":1637,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6826434277414669,"acs":1880,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":1.1262855682,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":2754,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7375168690958165,"acs":1093,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":1482,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.4690704598081376,"acs":1418,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":3023,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5883190883190883,"acs":826,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":1404,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.49286936679977184,"acs":1728,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":1.4214639017,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":3506,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5641813989239047,"acs":734,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":1301,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6887044174325526,"acs":2323,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.794816469,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":3373,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5444546287809349,"acs":594,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.1964664962,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":1091,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5481352992194276,"acs":632,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":1153,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5726643598615917,"acs":331,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":578,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.603448275862069,"acs":735,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":1218,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8298045602605864,"acs":1019,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":1228,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6775599128540305,"acs":311,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":459,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5826709062003179,"acs":733,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.2477729518,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":1258,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.573024740622506,"acs":718,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.7652722227,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":1253,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.40561224489795916,"acs":318,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":784,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.27419354838709675,"acs":408,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.2477729518,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":1488,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6340254837187352,"acs":2687,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 116]朋友圈","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":4238,"title":"朋友圈","titleSlug":"bLyHh0"},{"acceptance":0.6388888888888888,"acs":368,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":576,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6961852861035422,"acs":511,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":734,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.44634146341463415,"acs":2013,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.794816469,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":4510,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7207695321291333,"acs":86470,"articleLive":2,"columnArticles":1496,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":3.5635847197,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":119969,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6496690135903254,"acs":55548,"articleLive":2,"columnArticles":1069,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":2.1710177204,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":85502,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5797446646341463,"acs":42595,"articleLive":2,"columnArticles":470,"formTitle":"[面试题 01.03]URL化","frequency":1.7718252505,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":73472,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5508265569288442,"acs":39085,"articleLive":2,"columnArticles":760,"formTitle":"[面试题 01.04]回文排列","frequency":2.1612900172,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":70957,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3330214358625383,"acs":31320,"articleLive":2,"columnArticles":539,"formTitle":"[面试题 01.05]一次编辑","frequency":1.8041382395,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":94048,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.47257503865928285,"acs":71511,"articleLive":2,"columnArticles":1151,"formTitle":"[面试题 01.06]字符串压缩","frequency":3.2057387297,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":151322,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7545875087254357,"acs":63780,"articleLive":2,"columnArticles":946,"formTitle":"[面试题 01.07]旋转矩阵","frequency":2.5521890415,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":84523,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6214622467227289,"acs":42050,"articleLive":2,"columnArticles":473,"formTitle":"[面试题 01.08]零矩阵","frequency":1.837638469,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":67663,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5510058842929302,"acs":31744,"articleLive":2,"columnArticles":408,"formTitle":"[面试题 01.09]字符串轮转","frequency":1.7718252505,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":57611,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.683614633499757,"acs":61889,"articleLive":2,"columnArticles":675,"formTitle":"[面试题 02.01]移除重复节点","frequency":2.4088977345,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":90532,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7801479022771093,"acs":63930,"articleLive":2,"columnArticles":928,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":2.8153054685,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":81946,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8540122110771915,"acs":70497,"articleLive":2,"columnArticles":671,"formTitle":"[面试题 02.03]删除中间节点","frequency":2.891380713,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":82548,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6555116005559714,"acs":24524,"articleLive":2,"columnArticles":346,"formTitle":"[面试题 02.04]分割链表","frequency":2.3241730844,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":37412,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4665349982458648,"acs":35905,"articleLive":2,"columnArticles":511,"formTitle":"[面试题 02.05]链表求和","frequency":3.4286092835,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":76961,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.483251950028537,"acs":38102,"articleLive":2,"columnArticles":497,"formTitle":"[面试题 02.06]回文链表","frequency":1.0677893615,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":78845,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6853722920080102,"acs":45177,"articleLive":2,"columnArticles":404,"formTitle":"[面试题 02.07]链表相交","frequency":1.0677893615,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":65916,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5317514441591784,"acs":26511,"articleLive":2,"columnArticles":276,"formTitle":"[面试题 02.08]环路检测","frequency":2.1941157216,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":49856,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5397811147874777,"acs":10604,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":19645,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6132024934255381,"acs":25183,"articleLive":2,"columnArticles":286,"formTitle":"[面试题 03.02]栈的最小值","frequency":2.0475311319,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":41068,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.385559043709249,"acs":7983,"articleLive":2,"columnArticles":122,"formTitle":"[面试题 03.03]堆盘子","frequency":1.4214639017,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":20705,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7123899331792918,"acs":22815,"articleLive":2,"columnArticles":336,"formTitle":"[面试题 03.04]化栈为队","frequency":1.7406214708,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":32026,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5437789814129291,"acs":13955,"articleLive":2,"columnArticles":183,"formTitle":"[面试题 03.05]栈排序","frequency":0.794816469,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":25663,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5889263631253513,"acs":10477,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 03.06]动物收容所","frequency":1.4214639017,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":17790,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5335335335335335,"acs":17056,"articleLive":2,"columnArticles":235,"formTitle":"[面试题 04.01]节点间通路","frequency":1.6641945863,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":31968,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7897197348528898,"acs":33954,"articleLive":2,"columnArticles":415,"formTitle":"[面试题 04.02]最小高度树","frequency":2.2634195123,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":42995,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8054726879950622,"acs":23490,"articleLive":2,"columnArticles":510,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":1.5989824376,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":29163,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5840205537289567,"acs":32506,"articleLive":2,"columnArticles":379,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.8255314142,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":55659,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3512710605610491,"acs":24831,"articleLive":2,"columnArticles":312,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":1.6641945863,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":70689,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5903775071199175,"acs":19486,"articleLive":2,"columnArticles":232,"formTitle":"[面试题 04.06]后继者","frequency":0.8575034469,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":33006,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7165905766588361,"acs":16167,"articleLive":2,"columnArticles":170,"formTitle":"[面试题 04.08]首个共同祖先","frequency":1.6986664953,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":22561,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.4779601147987343,"acs":6495,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.8255314142,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":13589,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7169759949176385,"acs":15800,"articleLive":2,"columnArticles":247,"formTitle":"[面试题 04.10]检查子树","frequency":0.2750821312,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":22037,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.4872414872130401,"acs":17128,"articleLive":2,"columnArticles":253,"formTitle":"[面试题 04.12]求和路径","frequency":1.4214639017,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":35153,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5055109387981168,"acs":9127,"articleLive":2,"columnArticles":174,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":18055,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6885064875310574,"acs":7482,"articleLive":2,"columnArticles":118,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.8255314142,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":10867,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3887689788627568,"acs":10447,"articleLive":2,"columnArticles":226,"formTitle":"[面试题 05.03]翻转数位","frequency":1.8724124874,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":26872,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.39023089232644975,"acs":5121,"articleLive":2,"columnArticles":133,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":13123,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5275498787991796,"acs":11317,"articleLive":2,"columnArticles":220,"formTitle":"[面试题 05.06]整数转换","frequency":0.7652722227,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":21452,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7033523086654017,"acs":11120,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 05.07]配对交换","frequency":0.2215934462,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":15810,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5529812054439404,"acs":3413,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 05.08]绘制直线","frequency":1.2225136003,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6172,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36394507603720655,"acs":41905,"articleLive":2,"columnArticles":460,"formTitle":"[面试题 08.01]三步问题","frequency":1.8573474239,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":115141,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36129818680481485,"acs":11856,"articleLive":2,"columnArticles":186,"formTitle":"[面试题 08.02]迷路的机器人","frequency":1.5989824376,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":32815,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6765710831340185,"acs":51483,"articleLive":2,"columnArticles":428,"formTitle":"[面试题 08.03]魔术索引","frequency":0.2477729518,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":76094,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8221648444749263,"acs":20379,"articleLive":2,"columnArticles":319,"formTitle":"[面试题 08.04]幂集","frequency":1.7718252505,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":24787,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6808752025931929,"acs":21005,"articleLive":2,"columnArticles":465,"formTitle":"[面试题 08.05]递归乘法","frequency":0.2750821312,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":30850,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6566745129179546,"acs":23155,"articleLive":2,"columnArticles":262,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":2.5082404113,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":35261,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8132364872696365,"acs":21049,"articleLive":2,"columnArticles":309,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":1.3898906398,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":25883,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7189571562041198,"acs":16160,"articleLive":2,"columnArticles":231,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":2.1612900172,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":22477,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8127953055936595,"acs":21331,"articleLive":2,"columnArticles":338,"formTitle":"[面试题 08.09]括号","frequency":2.9753053226,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":26244,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5592146662751185,"acs":13330,"articleLive":2,"columnArticles":209,"formTitle":"[面试题 08.10]颜色填充","frequency":0.7652722227,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":23837,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4946167160501071,"acs":33720,"articleLive":2,"columnArticles":323,"formTitle":"[面试题 08.11]硬币","frequency":2.1612900172,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":68174,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.760706113108859,"acs":16289,"articleLive":2,"columnArticles":292,"formTitle":"[面试题 08.12]八皇后","frequency":2.2316000923,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":21413,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.50158754157847,"acs":6635,"articleLive":2,"columnArticles":87,"formTitle":"[面试题 08.13]堆箱子","frequency":0.2477729518,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":13228,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5346547650301916,"acs":4073,"articleLive":2,"columnArticles":74,"formTitle":"[面试题 08.14]布尔运算","frequency":1.1891993936,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7618,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5546625553289899,"acs":55763,"articleLive":2,"columnArticles":2364,"formTitle":"[面试题 10.01]合并排序的数组","frequency":3.4626520042,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":100535,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7394770202617047,"acs":34416,"articleLive":2,"columnArticles":426,"formTitle":"[面试题 10.02]变位词组","frequency":2.9247639957,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46541,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39548708372237784,"acs":12707,"articleLive":2,"columnArticles":205,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":2.7902058491,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":32130,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5533537921964051,"acs":18933,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":1.1571522162,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":34215,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.45589607406875765,"acs":12704,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":1.9853993508,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":27866,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6299546998867497,"acs":4450,"articleLive":2,"columnArticles":81,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7064,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6672935697653591,"acs":7451,"articleLive":2,"columnArticles":92,"formTitle":"[面试题 10.11]峰与谷","frequency":2.0159454031,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":11166,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8330554258654038,"acs":24980,"articleLive":2,"columnArticles":396,"formTitle":"[面试题 16.01]交换数字","frequency":1.1571522162,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":29986,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7653696705168468,"acs":14379,"articleLive":2,"columnArticles":186,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":18787,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44336118848653666,"acs":9550,"articleLive":2,"columnArticles":231,"formTitle":"[面试题 16.03]交点","frequency":0.3334417464,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21540,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.46097163351809584,"acs":7069,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":15335,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.4639722661049675,"acs":10573,"articleLive":2,"columnArticles":125,"formTitle":"[面试题 16.05]阶乘尾数","frequency":1.4214639017,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":22788,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4242589810135227,"acs":12424,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.06]最小差","frequency":1.6309954146,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":29284,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7332673418107059,"acs":19260,"articleLive":2,"columnArticles":281,"formTitle":"[面试题 16.07]最大数值","frequency":1.9516807148,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":26266,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3757341835878503,"acs":2239,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":5959,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5508935508935509,"acs":2127,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.3974841127,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3861,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6832576117176374,"acs":10076,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 16.10]生存人数","frequency":0.794816469,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":14747,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4409295352323838,"acs":49997,"articleLive":2,"columnArticles":577,"formTitle":"[面试题 16.11]跳水板","frequency":1.0965214663,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":113390,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.43340140685273426,"acs":1910,"articleLive":2,"columnArticles":50,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4407,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5509977827050998,"acs":3479,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6314,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5037883136264493,"acs":8777,"articleLive":2,"columnArticles":219,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.2477729518,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":17422,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.45258781184063546,"acs":14586,"articleLive":2,"columnArticles":205,"formTitle":"[面试题 16.16]部分排序","frequency":1.7718252505,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":32228,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6008284127963338,"acs":34088,"articleLive":2,"columnArticles":369,"formTitle":"[面试题 16.17]连续数列","frequency":1.837638469,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":56735,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3444583951603698,"acs":15089,"articleLive":2,"columnArticles":308,"formTitle":"[面试题 16.18]模式匹配","frequency":1.4214639017,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":43805,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6103393651373911,"acs":20035,"articleLive":2,"columnArticles":353,"formTitle":"[面试题 16.19]水域大小","frequency":2.1941157216,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":32826,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7204839382561535,"acs":8635,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 16.20]T9键盘","frequency":1.4214639017,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":11985,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.464858384534692,"acs":9306,"articleLive":2,"columnArticles":172,"formTitle":"[面试题 16.21]交换和","frequency":0.2215934462,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":20019,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5824798431030725,"acs":2673,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.3974841127,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4589,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47234745346605367,"acs":10582,"articleLive":2,"columnArticles":157,"formTitle":"[面试题 16.24]数对和","frequency":1.1571522162,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":22403,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5451215216625572,"acs":30952,"articleLive":2,"columnArticles":252,"formTitle":"[面试题 16.25]LRU 缓存","frequency":4.1370749902,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":56780,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3877523148780421,"acs":14196,"articleLive":2,"columnArticles":196,"formTitle":"[面试题 16.26]计算器","frequency":2.825959054,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":36611,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5971344709218447,"acs":12003,"articleLive":2,"columnArticles":166,"formTitle":"[面试题 17.01]不用加号的加法","frequency":0.794816469,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":20101,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.645282750781472,"acs":27249,"articleLive":2,"columnArticles":440,"formTitle":"[面试题 17.04]消失的数字","frequency":1.5989824376,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":42228,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.3872912127814089,"acs":5333,"articleLive":2,"columnArticles":90,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.794816469,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":13770,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.44907770800627944,"acs":4577,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.2750821312,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10192,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4115190784737221,"acs":8574,"articleLive":2,"columnArticles":214,"formTitle":"[面试题 17.07]婴儿名字","frequency":1.6309954146,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":20835,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.2721027180256795,"acs":8159,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.08]马戏团人塔","frequency":1.7718252505,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":29985,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.549788389363571,"acs":13770,"articleLive":2,"columnArticles":140,"formTitle":"[面试题 17.09]第 k 个数","frequency":2.4408748795,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":25046,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5709891922541624,"acs":66462,"articleLive":2,"columnArticles":923,"formTitle":"[面试题 17.10]主要元素","frequency":2.8153054685,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":116398,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6867277992277993,"acs":14229,"articleLive":2,"columnArticles":255,"formTitle":"[面试题 17.11]单词距离","frequency":1.5989824376,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":20720,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.631150584885808,"acs":20395,"articleLive":2,"columnArticles":285,"formTitle":"[面试题 17.12]BiNode","frequency":0.2215934462,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":32314,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5528560117633752,"acs":24439,"articleLive":2,"columnArticles":268,"formTitle":"[面试题 17.13]恢复空格","frequency":1.8041382395,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":44205,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5978770224487857,"acs":75531,"articleLive":2,"columnArticles":754,"formTitle":"[面试题 17.14]最小K个数","frequency":2.2847650399,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":126332,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40260475651189126,"acs":5688,"articleLive":2,"columnArticles":115,"formTitle":"[面试题 17.15]最长单词","frequency":1.523645621,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":14128,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5187410291450721,"acs":60355,"articleLive":2,"columnArticles":1131,"formTitle":"[面试题 17.16]按摩师","frequency":2.3560783428,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":116349,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.443162908131061,"acs":7723,"articleLive":2,"columnArticles":172,"formTitle":"[面试题 17.17]多次搜索","frequency":0.7652722227,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":17427,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4458756345177665,"acs":7027,"articleLive":2,"columnArticles":117,"formTitle":"[面试题 17.18]最短超串","frequency":1.1571522162,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":15760,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5807158009991104,"acs":8486,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 17.19]消失的两个数字","frequency":1.6641945863,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":14613,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5704518430439952,"acs":3838,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 17.20]连续中值","frequency":0.8575034469,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6728,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6359308733158304,"acs":44084,"articleLive":2,"columnArticles":534,"formTitle":"[面试题 17.21]直方图的水量","frequency":4.1923012556,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":69322,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.37336904864771453,"acs":8642,"articleLive":2,"columnArticles":150,"formTitle":"[面试题 17.22]单词转换","frequency":1.9191499652,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":23146,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.37947966919365955,"acs":4405,"articleLive":2,"columnArticles":98,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.794816469,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":11608,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5207263109709578,"acs":10238,"articleLive":2,"columnArticles":115,"formTitle":"[面试题 17.24]最大子矩阵","frequency":3.5915351138,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":19661,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5086378737541528,"acs":1531,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 17.25]单词矩阵","frequency":1.36946092,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3010,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3417284452117396,"acs":3365,"articleLive":2,"columnArticles":50,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.2477729518,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":9847,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file +[{"acceptance":0.3693584216351773,"acs":238600,"articleLive":2,"columnArticles":2584,"formTitle":"[58]最后一个单词的长度","frequency":2.3893962633,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"","submitted":645985,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.5200189610383125,"acs":2499026,"articleLive":2,"columnArticles":14147,"formTitle":"[1]两数之和","frequency":4.7273180967,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4805644,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4085727680115952,"acs":997892,"articleLive":2,"columnArticles":7100,"formTitle":"[2]两数相加","frequency":4.691200888,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2442385,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.3801776943979302,"acs":1233723,"articleLive":2,"columnArticles":7352,"formTitle":"[3]无重复字符的最长子串","frequency":4.5369985905,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3245122,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.40815724949555876,"acs":509548,"articleLive":2,"columnArticles":3795,"formTitle":"[4]寻找两个正序数组的中位数","frequency":4.4817343844,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1248411,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3542901785541413,"acs":731938,"articleLive":2,"columnArticles":3962,"formTitle":"[5]最长回文子串","frequency":4.6267488972,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2065928,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5066229561085281,"acs":301505,"articleLive":2,"columnArticles":2433,"formTitle":"[6]Z 字形变换","frequency":3.6697253274,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":595127,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35305279089838487,"acs":830419,"articleLive":2,"columnArticles":5234,"formTitle":"[7]整数反转","frequency":4.6550836794,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2352110,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21711789282607682,"acs":344953,"articleLive":2,"columnArticles":2665,"formTitle":"[8]字符串转换整数 (atoi)","frequency":3.4801401386,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1588782,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5844099509326612,"acs":765241,"articleLive":2,"columnArticles":4890,"formTitle":"[9]回文数","frequency":3.8650448213,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1309425,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.31615606244735706,"acs":203442,"articleLive":2,"columnArticles":1229,"formTitle":"[10]正则表达式匹配","frequency":4.1017905724,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":643486,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.629039503143182,"acs":532141,"articleLive":2,"columnArticles":2995,"formTitle":"[11]盛最多水的容器","frequency":4.2281468768,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":845958,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6649545820635291,"acs":225395,"articleLive":2,"columnArticles":1750,"formTitle":"[12]整数转罗马数字","frequency":3.5768417275,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":338963,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6322148747948433,"acs":464169,"articleLive":2,"columnArticles":3857,"formTitle":"[13]罗马数字转整数","frequency":3.9951331332,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":734195,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.40873296434846385,"acs":619734,"articleLive":2,"columnArticles":3868,"formTitle":"[14]最长公共前缀","frequency":4.3883683557,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1516232,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3351988891073434,"acs":651272,"articleLive":2,"columnArticles":3049,"formTitle":"[15]三数之和","frequency":4.3698191269,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":1942942,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4594973855511685,"acs":258357,"articleLive":2,"columnArticles":1416,"formTitle":"[16]最接近的三数之和","frequency":4.0224572374,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":562260,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5723445871247556,"acs":336510,"articleLive":2,"columnArticles":3033,"formTitle":"[17]电话号码的字母组合","frequency":3.4801401386,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":587950,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.3998003530253985,"acs":219478,"articleLive":2,"columnArticles":1497,"formTitle":"[18]四数之和","frequency":3.0524209459,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":548969,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.4288321780997275,"acs":510535,"articleLive":2,"columnArticles":3815,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":3.549245287,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1190524,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44478689926840415,"acs":775828,"articleLive":2,"columnArticles":5507,"formTitle":"[20]有效的括号","frequency":4.4147957911,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1744269,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6671217650899567,"acs":707045,"articleLive":2,"columnArticles":3433,"formTitle":"[21]合并两个有序链表","frequency":4.1552710726,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1059844,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7725000555419786,"acs":347710,"articleLive":2,"columnArticles":2609,"formTitle":"[22]括号生成","frequency":4.3968339251,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":450110,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5595600556602024,"acs":322907,"articleLive":2,"columnArticles":2085,"formTitle":"[23]合并K个升序链表","frequency":3.7750490641,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":577073,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7032826386631849,"acs":313759,"articleLive":2,"columnArticles":2495,"formTitle":"[24]两两交换链表中的节点","frequency":2.7927358656,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":446135,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6572220555658114,"acs":227851,"articleLive":2,"columnArticles":2174,"formTitle":"[25]K 个一组翻转链表","frequency":4.261883556,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":346688,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5397514753553321,"acs":805225,"articleLive":2,"columnArticles":4481,"formTitle":"[26]删除有序数组中的重复项","frequency":3.9289002082,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1491844,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5977113106545937,"acs":476667,"articleLive":2,"columnArticles":4039,"formTitle":"[27]移除元素","frequency":3.6469933186,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":797487,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4062930484011436,"acs":465119,"articleLive":2,"columnArticles":3200,"formTitle":"[28]实现 strStr()","frequency":3.4774493851,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1144787,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.20768087281088274,"acs":109112,"articleLive":2,"columnArticles":878,"formTitle":"[29]两数相除","frequency":3.1159082515,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","submitted":525383,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.357681603495635,"acs":78911,"articleLive":2,"columnArticles":581,"formTitle":"[30]串联所有单词的子串","frequency":2.5446191793,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":220618,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37322839341593816,"acs":212779,"articleLive":2,"columnArticles":1726,"formTitle":"[31]下一个排列","frequency":3.7759262572,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":570104,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.35666350146578946,"acs":189307,"articleLive":2,"columnArticles":1288,"formTitle":"[32]最长有效括号","frequency":3.8224263451,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":530772,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.42683273174221026,"acs":362203,"articleLive":2,"columnArticles":2388,"formTitle":"[33]搜索旋转排序数组","frequency":3.3566359978,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":848583,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4237008585630366,"acs":337554,"articleLive":2,"columnArticles":3243,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":3.3212653787,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":796680,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4640428320139091,"acs":500705,"articleLive":2,"columnArticles":3896,"formTitle":"[35]搜索插入位置","frequency":3.5588259557,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1079006,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6408902493463428,"acs":200996,"articleLive":2,"columnArticles":1426,"formTitle":"[36]有效的数独","frequency":1.8992714414,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":313620,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6705645053207173,"acs":100067,"articleLive":2,"columnArticles":844,"formTitle":"[37]解数独","frequency":2.9207385523,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":149228,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.580179167094671,"acs":214628,"articleLive":2,"columnArticles":2262,"formTitle":"[38]外观数列","frequency":2.9688247389,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":369934,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7274101532718142,"acs":332022,"articleLive":2,"columnArticles":1936,"formTitle":"[39]组合总和","frequency":3.6549047523,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":456444,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6242568745006511,"acs":198460,"articleLive":2,"columnArticles":1378,"formTitle":"[40]组合总和 II","frequency":3.2908030782,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":317914,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4194206498698926,"acs":163439,"articleLive":2,"columnArticles":1403,"formTitle":"[41]缺失的第一个正数","frequency":4.1522183378,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":389678,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5792594247900046,"acs":321427,"articleLive":2,"columnArticles":2403,"formTitle":"[42]接雨水","frequency":4.4243355724,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":554893,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.44902465075004383,"acs":169003,"articleLive":2,"columnArticles":1131,"formTitle":"[43]字符串相乘","frequency":3.8988092724,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":376378,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.3281358905482767,"acs":83800,"articleLive":2,"columnArticles":544,"formTitle":"[44]通配符匹配","frequency":2.701282774,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":255382,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.42809580578736317,"acs":197502,"articleLive":2,"columnArticles":1587,"formTitle":"[45]跳跃游戏 II","frequency":4.5731157992,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":461350,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7827074579831933,"acs":417277,"articleLive":2,"columnArticles":2668,"formTitle":"[46]全排列","frequency":4.4604527811,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":533120,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6373532786689298,"acs":213289,"articleLive":2,"columnArticles":1466,"formTitle":"[47]全排列 II","frequency":3.1647372473,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":334648,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7351267252195735,"acs":219711,"articleLive":2,"columnArticles":1863,"formTitle":"[48]旋转图像","frequency":3.3965265605,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":298875,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6646691979416889,"acs":231598,"articleLive":2,"columnArticles":1303,"formTitle":"[49]字母异位词分组","frequency":3.163906296,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":348441,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37647571022925963,"acs":215317,"articleLive":2,"columnArticles":1276,"formTitle":"[50]Pow(x, n)","frequency":3.2351536869,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":571928,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7390322987758113,"acs":152251,"articleLive":2,"columnArticles":1523,"formTitle":"[51]N 皇后","frequency":3.3212653787,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":206014,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.822955192432699,"acs":73429,"articleLive":2,"columnArticles":599,"formTitle":"[52]N皇后 II","frequency":1.4881587246,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":89226,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5520686301280586,"acs":669206,"articleLive":2,"columnArticles":3744,"formTitle":"[53]最大子序和","frequency":3.7839420447,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1212179,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.4807815420859901,"acs":187750,"articleLive":2,"columnArticles":1989,"formTitle":"[54]螺旋矩阵","frequency":3.8729800169,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":390510,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.432425755606044,"acs":320325,"articleLive":2,"columnArticles":2459,"formTitle":"[55]跳跃游戏","frequency":3.3933296852,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":740763,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4683511122552128,"acs":298379,"articleLive":2,"columnArticles":2285,"formTitle":"[56]合并区间","frequency":4.0685861228,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":637084,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4110273290974508,"acs":85908,"articleLive":2,"columnArticles":925,"formTitle":"[57]插入区间","frequency":1.8665711172,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":209008,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.7915378109892329,"acs":125416,"articleLive":2,"columnArticles":1559,"formTitle":"[59]螺旋矩阵 II","frequency":3.2238490221,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":158446,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5240334286599879,"acs":89605,"articleLive":2,"columnArticles":948,"formTitle":"[60]排列序列","frequency":1.9947874523,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":170991,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4176621269692183,"acs":195658,"articleLive":2,"columnArticles":1982,"formTitle":"[61]旋转链表","frequency":3.1138524143,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":468460,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6614317027487281,"acs":311113,"articleLive":2,"columnArticles":2397,"formTitle":"[62]不同路径","frequency":3.1227924864,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":470363,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.390813926237121,"acs":180098,"articleLive":2,"columnArticles":1699,"formTitle":"[63]不同路径 II","frequency":3.1512698364,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":460828,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6881419571456938,"acs":266847,"articleLive":2,"columnArticles":2067,"formTitle":"[64]最小路径和","frequency":3.4056146162,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":387779,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.26940684947628574,"acs":45783,"articleLive":2,"columnArticles":635,"formTitle":"[65]有效数字","frequency":2.1498597696,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":169940,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.45801986713834714,"acs":346596,"articleLive":2,"columnArticles":3147,"formTitle":"[66]加一","frequency":2.8749220189,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":756727,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5433650489809706,"acs":193025,"articleLive":2,"columnArticles":1760,"formTitle":"[67]二进制求和","frequency":2.6379704946,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":355240,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5246251474139383,"acs":37368,"articleLive":2,"columnArticles":570,"formTitle":"[68]文本左右对齐","frequency":2.0514214536,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":71228,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39248351486274163,"acs":383195,"articleLive":2,"columnArticles":1918,"formTitle":"[69]x 的平方根","frequency":3.5344585992,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":976334,"title":"x 的平方根","titleSlug":"sqrtx"},{"acceptance":0.5292621553613464,"acs":567269,"articleLive":2,"columnArticles":3546,"formTitle":"[70]爬楼梯","frequency":4.2481036088,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1071811,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.4214581884208529,"acs":93310,"articleLive":2,"columnArticles":824,"formTitle":"[71]简化路径","frequency":2.7535725043,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":221398,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6137382379308641,"acs":173888,"articleLive":2,"columnArticles":1220,"formTitle":"[72]编辑距离","frequency":4.3692713167,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":283326,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6035600640094175,"acs":131255,"articleLive":2,"columnArticles":961,"formTitle":"[73]矩阵置零","frequency":2.0136097659,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":217468,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.46014075390556436,"acs":167771,"articleLive":2,"columnArticles":1687,"formTitle":"[74]搜索二维矩阵","frequency":3.4565761581,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":364608,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5953076293510199,"acs":266218,"articleLive":2,"columnArticles":1846,"formTitle":"[75]颜色分类","frequency":2.6655965609,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":447194,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4258846433064966,"acs":182446,"articleLive":2,"columnArticles":1249,"formTitle":"[76]最小覆盖子串","frequency":3.7875492269,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":428393,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7699367784692017,"acs":217019,"articleLive":2,"columnArticles":1275,"formTitle":"[77]组合","frequency":3.4352579344,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":281866,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8009793245092384,"acs":309653,"articleLive":2,"columnArticles":2025,"formTitle":"[78]子集","frequency":3.3212653787,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":386593,"title":"子集","titleSlug":"subsets"},{"acceptance":0.458368194354064,"acs":221880,"articleLive":2,"columnArticles":1392,"formTitle":"[79]单词搜索","frequency":3.3469869614,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":484065,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6164096897862154,"acs":147280,"articleLive":2,"columnArticles":1317,"formTitle":"[80]删除有序数组中的重复项 II","frequency":3.1891474139,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":238932,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.41536647406633764,"acs":123287,"articleLive":2,"columnArticles":992,"formTitle":"[81]搜索旋转排序数组 II","frequency":3.4100285208,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":296815,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5300224383832524,"acs":179049,"articleLive":2,"columnArticles":1675,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":3.8228772424,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":337814,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5385723271953554,"acs":313364,"articleLive":2,"columnArticles":1916,"formTitle":"[83]删除排序链表中的重复元素","frequency":3.3928950349,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":581842,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4332459169879098,"acs":181394,"articleLive":2,"columnArticles":1147,"formTitle":"[84]柱状图中最大的矩形","frequency":3.6064691352,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":418686,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5156778079855003,"acs":96736,"articleLive":2,"columnArticles":681,"formTitle":"[85]最大矩形","frequency":2.8379509398,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":187590,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6324962977957236,"acs":118736,"articleLive":2,"columnArticles":1091,"formTitle":"[86]分隔链表","frequency":2.6379704946,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":187726,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48772479050936823,"acs":41441,"articleLive":2,"columnArticles":307,"formTitle":"[87]扰乱字符串","frequency":3.2047192016,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":84968,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5163760844734714,"acs":458417,"articleLive":2,"columnArticles":3205,"formTitle":"[88]合并两个有序数组","frequency":4.5906316886,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":887758,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7097336715282181,"acs":58201,"articleLive":2,"columnArticles":472,"formTitle":"[89]格雷编码","frequency":2.0777417738,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":82004,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6334912379193712,"acs":136537,"articleLive":2,"columnArticles":1195,"formTitle":"[90]子集 II","frequency":3.5363961149,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":215531,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.30668246299894775,"acs":159719,"articleLive":2,"columnArticles":1500,"formTitle":"[91]解码方法","frequency":3.4256353049,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":520796,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5481787117806814,"acs":209515,"articleLive":2,"columnArticles":2009,"formTitle":"[92]反转链表 II","frequency":3.6749656056,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":382202,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5393124235789234,"acs":151728,"articleLive":2,"columnArticles":1317,"formTitle":"[93]复原 IP 地址","frequency":3.9806085496,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":281336,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7558941779956125,"acs":556131,"articleLive":2,"columnArticles":2281,"formTitle":"[94]二叉树的中序遍历","frequency":3.0585710268,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":735726,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7012109543053411,"acs":99424,"articleLive":2,"columnArticles":615,"formTitle":"[95]不同的二叉搜索树 II","frequency":2.9207385523,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":141789,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6992992992992993,"acs":160678,"articleLive":2,"columnArticles":1272,"formTitle":"[96]不同的二叉搜索树","frequency":3.1687635039,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":229770,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.457002457002457,"acs":60636,"articleLive":2,"columnArticles":538,"formTitle":"[97]交错字符串","frequency":2.1084169347,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":132682,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.3495254337605599,"acs":343695,"articleLive":2,"columnArticles":1909,"formTitle":"[98]验证二叉搜索树","frequency":3.4294399055,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":983319,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.611909918843454,"acs":70347,"articleLive":2,"columnArticles":582,"formTitle":"[99]恢复二叉搜索树","frequency":2.6974410482,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":114963,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6030270708293569,"acs":247062,"articleLive":2,"columnArticles":1862,"formTitle":"[100]相同的树","frequency":2.7893161235,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":409703,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5628438138758609,"acs":406707,"articleLive":2,"columnArticles":2234,"formTitle":"[101]对称二叉树","frequency":3.7148980441,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":722593,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6417792897677603,"acs":392767,"articleLive":2,"columnArticles":2474,"formTitle":"[102]二叉树的层序遍历","frequency":4.3119808856,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":611997,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5715194065439131,"acs":172576,"articleLive":2,"columnArticles":1574,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":3.8561279339,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":301960,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7663819850075685,"acs":509339,"articleLive":2,"columnArticles":2522,"formTitle":"[104]二叉树的最大深度","frequency":3.6680132474,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":664602,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7044566291105353,"acs":246035,"articleLive":2,"columnArticles":1412,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":3.9375021731,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":349255,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7214400665622982,"acs":131797,"articleLive":2,"columnArticles":873,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":3.4346047794,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":182686,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6963210616107227,"acs":162036,"articleLive":2,"columnArticles":1299,"formTitle":"[107]二叉树的层序遍历 II","frequency":3.0481573653,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":232703,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7602580376485097,"acs":189860,"articleLive":2,"columnArticles":1179,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":2.4870824604,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":249731,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7633818708047518,"acs":93370,"articleLive":2,"columnArticles":718,"formTitle":"[109]有序链表转换二叉搜索树","frequency":2.701282774,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":122311,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.563283308054602,"acs":254025,"articleLive":2,"columnArticles":1450,"formTitle":"[110]平衡二叉树","frequency":2.8821087975,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":450972,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.48543669998643085,"acs":268313,"articleLive":2,"columnArticles":1770,"formTitle":"[111]二叉树的最小深度","frequency":2.1401320664,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":552725,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5258972368737109,"acs":264916,"articleLive":2,"columnArticles":1658,"formTitle":"[112]路径总和","frequency":3.0875133853,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":503741,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6267604133375946,"acs":176502,"articleLive":2,"columnArticles":1240,"formTitle":"[113]路径总和 II","frequency":3.0065176432,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":281610,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7253679252695087,"acs":175415,"articleLive":2,"columnArticles":1310,"formTitle":"[114]二叉树展开为链表","frequency":2.0560489492,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":241829,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5225833685099198,"acs":60662,"articleLive":2,"columnArticles":674,"formTitle":"[115]不同的子序列","frequency":2.3200612775,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":116081,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7034143740766009,"acs":155686,"articleLive":2,"columnArticles":1179,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":2.2422615615,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":221329,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6127195588784013,"acs":88674,"articleLive":2,"columnArticles":747,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":1.4067600845,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":144722,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7289317843394245,"acs":212453,"articleLive":2,"columnArticles":1714,"formTitle":"[118]杨辉三角","frequency":3.6505971859,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":291458,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6655124426597444,"acs":142033,"articleLive":2,"columnArticles":1190,"formTitle":"[119]杨辉三角 II","frequency":2.6655965609,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":213419,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6805839887943109,"acs":176862,"articleLive":2,"columnArticles":1565,"formTitle":"[120]三角形最小路径和","frequency":2.4197169286,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":259868,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.573402341485316,"acs":556827,"articleLive":2,"columnArticles":3357,"formTitle":"[121]买卖股票的最佳时机","frequency":4.1773789436,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":971093,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6889425965454672,"acs":456379,"articleLive":2,"columnArticles":2627,"formTitle":"[122]买卖股票的最佳时机 II","frequency":3.1054237772,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":662434,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5354902621692056,"acs":130273,"articleLive":2,"columnArticles":816,"formTitle":"[123]买卖股票的最佳时机 III","frequency":3.2865276032,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":243278,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.44422925124041496,"acs":157577,"articleLive":2,"columnArticles":1081,"formTitle":"[124]二叉树中的最大路径和","frequency":3.963166637,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":354720,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.4733431491574751,"acs":274868,"articleLive":2,"columnArticles":1820,"formTitle":"[125]验证回文串","frequency":3.2908030782,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":580695,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3946297191343107,"acs":36742,"articleLive":2,"columnArticles":326,"formTitle":"[126]单词接龙 II","frequency":1.4670920091,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":93105,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.4677399682888157,"acs":122720,"articleLive":2,"columnArticles":648,"formTitle":"[127]单词接龙","frequency":2.4197169286,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":262368,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5433186585314647,"acs":168212,"articleLive":2,"columnArticles":1086,"formTitle":"[128]最长连续序列","frequency":3.8956422824,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":309601,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6816811663835362,"acs":119179,"articleLive":2,"columnArticles":1100,"formTitle":"[129]求根节点到叶节点数字之和","frequency":3.0368782022,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":174831,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44410300363390576,"acs":127466,"articleLive":2,"columnArticles":1158,"formTitle":"[130]被围绕的区域","frequency":2.3922426731,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":287019,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7228502705953097,"acs":132231,"articleLive":2,"columnArticles":854,"formTitle":"[131]分割回文串","frequency":3.3517369624,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":182930,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49239549436795993,"acs":49178,"articleLive":2,"columnArticles":436,"formTitle":"[132]分割回文串 II","frequency":2.1084169347,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":99875,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.675675169319257,"acs":72129,"articleLive":2,"columnArticles":525,"formTitle":"[133]克隆图","frequency":0.7449949145,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":106751,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5768355614288971,"acs":123966,"articleLive":2,"columnArticles":963,"formTitle":"[134]加油站","frequency":3.4651085211,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":214907,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.48643441646142843,"acs":97964,"articleLive":2,"columnArticles":777,"formTitle":"[135]分发糖果","frequency":4.2980007646,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":201392,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7194815980417869,"acs":493809,"articleLive":2,"columnArticles":2243,"formTitle":"[136]只出现一次的数字","frequency":3.6803676174,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":686340,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7196644866964067,"acs":99698,"articleLive":2,"columnArticles":754,"formTitle":"[137]只出现一次的数字 II","frequency":3.4492762695,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":138534,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6603811624624946,"acs":111368,"articleLive":2,"columnArticles":850,"formTitle":"[138]复制带随机指针的链表","frequency":3.1074293132,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":168642,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5140836151493513,"acs":190779,"articleLive":2,"columnArticles":1187,"formTitle":"[139]单词拆分","frequency":3.560303541,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":371105,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.48727031215408456,"acs":52824,"articleLive":2,"columnArticles":537,"formTitle":"[140]单词拆分 II","frequency":1.5778244868,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":108408,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5122976285416534,"acs":523540,"articleLive":2,"columnArticles":2705,"formTitle":"[141]环形链表","frequency":3.6819101985,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1021945,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5522257969175626,"acs":293344,"articleLive":2,"columnArticles":1711,"formTitle":"[142]环形链表 II","frequency":3.3684328105,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":531203,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6191952604295236,"acs":125418,"articleLive":2,"columnArticles":1069,"formTitle":"[143]重排链表","frequency":4.2337696074,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":202550,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7029729091263361,"acs":407680,"articleLive":2,"columnArticles":1814,"formTitle":"[144]二叉树的前序遍历","frequency":2.3425862018,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":579937,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.749729759764007,"acs":296851,"articleLive":2,"columnArticles":1533,"formTitle":"[145]二叉树的后序遍历","frequency":3.2074027584,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":395944,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5261820609756376,"acs":230905,"articleLive":2,"columnArticles":1373,"formTitle":"[146]LRU 缓存机制","frequency":4.377224172,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":438831,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6809086103807843,"acs":99190,"articleLive":2,"columnArticles":781,"formTitle":"[147]对链表进行插入排序","frequency":2.0192607755,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":145673,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6670292579143539,"acs":208490,"articleLive":2,"columnArticles":1235,"formTitle":"[148]排序链表","frequency":3.5095938788,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":312565,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3393756957871917,"acs":46337,"articleLive":2,"columnArticles":508,"formTitle":"[149]直线上最多的点数","frequency":3.2479187313,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":136536,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5360584667963573,"acs":131441,"articleLive":2,"columnArticles":1037,"formTitle":"[150]逆波兰表达式求值","frequency":2.7764657796,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":245199,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.4821851567948267,"acs":167325,"articleLive":2,"columnArticles":1410,"formTitle":"[151]翻转字符串里的单词","frequency":2.3721455336,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":347014,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42093987335895866,"acs":181351,"articleLive":2,"columnArticles":1216,"formTitle":"[152]乘积最大子数组","frequency":3.6680132474,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":430824,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5664242992528435,"acs":209010,"articleLive":2,"columnArticles":1474,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":2.4958475266,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":368999,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.531980969062892,"acs":112373,"articleLive":2,"columnArticles":891,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":2.9823628519,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":211235,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5733631855032919,"acs":284516,"articleLive":2,"columnArticles":1580,"formTitle":"[155]最小栈","frequency":3.1455075432,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":496223,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7248162803843979,"acs":6411,"articleLive":2,"columnArticles":111,"formTitle":"[156]上下翻转二叉树","frequency":1.2002681668,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"","submitted":8845,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5326732673267327,"acs":5380,"articleLive":2,"columnArticles":81,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"","submitted":10100,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5909486510008704,"acs":2716,"articleLive":2,"columnArticles":64,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.229388925,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"","submitted":4596,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5450098536036037,"acs":15487,"articleLive":2,"columnArticles":187,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":1.9642413999,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"ac","submitted":28416,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6134118495373152,"acs":331773,"articleLive":2,"columnArticles":1951,"formTitle":"[160]相交链表","frequency":3.2420474134,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":540865,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3364107183066877,"acs":7470,"articleLive":2,"columnArticles":103,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.229388925,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"","submitted":22205,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.4975350432073955,"acs":158447,"articleLive":2,"columnArticles":1066,"formTitle":"[162]寻找峰值","frequency":2.3135312818,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":318464,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.32428138090423225,"acs":8980,"articleLive":2,"columnArticles":142,"formTitle":"[163]缺失的区间","frequency":0.8052541061,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"","submitted":27692,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6104646930987512,"acs":58709,"articleLive":2,"columnArticles":490,"formTitle":"[164]最大间距","frequency":2.7056553215,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":96171,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.518597628342049,"acs":84492,"articleLive":2,"columnArticles":904,"formTitle":"[165]比较版本号","frequency":2.5556058862,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":162924,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.2988873372674445,"acs":26540,"articleLive":2,"columnArticles":207,"formTitle":"[166]分数到小数","frequency":2.4978817015,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":88796,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5865432471463655,"acs":287554,"articleLive":2,"columnArticles":1890,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":3.1005940166,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":490252,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.432385927814748,"acs":83428,"articleLive":2,"columnArticles":742,"formTitle":"[168]Excel表列名称","frequency":2.6974410482,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":192948,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6644458998622372,"acs":382473,"articleLive":2,"columnArticles":2172,"formTitle":"[169]多数元素","frequency":3.1524802119,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":575627,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.4173960342184641,"acs":8441,"articleLive":2,"columnArticles":84,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.1780824693,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"ac","submitted":20223,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7176115614896016,"acs":106312,"articleLive":2,"columnArticles":905,"formTitle":"[171]Excel 表列序号","frequency":2.0192607755,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":148147,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.43890414954906776,"acs":90276,"articleLive":2,"columnArticles":592,"formTitle":"[172]阶乘后的零","frequency":2.2422615615,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","questionId":"172","status":"","submitted":205685,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8039027442181567,"acs":74525,"articleLive":2,"columnArticles":621,"formTitle":"[173]二叉搜索树迭代器","frequency":2.2696230495,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":92704,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.48000050744034406,"acs":37837,"articleLive":2,"columnArticles":404,"formTitle":"[174]地下城游戏","frequency":3.0022566968,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":78827,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7397267343277714,"acs":301017,"articleLive":2,"columnArticles":1453,"formTitle":"[175]组合两个表","frequency":4.2134961523,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":406930,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3559812796600031,"acs":249943,"articleLive":2,"columnArticles":1008,"formTitle":"[176]第二高的薪水","frequency":4.1430829342,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":702124,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4625084859589316,"acs":126719,"articleLive":2,"columnArticles":490,"formTitle":"[177]第N高的薪水","frequency":3.5984324448,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":273982,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6029805648733773,"acs":117741,"articleLive":2,"columnArticles":663,"formTitle":"[178]分数排名","frequency":3.1227924864,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":195265,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4096548990394308,"acs":119881,"articleLive":2,"columnArticles":956,"formTitle":"[179]最大数","frequency":3.9472503372,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":292639,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.4869543104179029,"acs":86169,"articleLive":2,"columnArticles":503,"formTitle":"[180]连续出现的数字","frequency":3.2865276032,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":176955,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.702716010649655,"acs":161267,"articleLive":2,"columnArticles":667,"formTitle":"[181]超过经理收入的员工","frequency":3.2646892066,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":229491,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7974582506521594,"acs":178834,"articleLive":2,"columnArticles":574,"formTitle":"[182]查找重复的电子邮箱","frequency":2.7893161235,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":224255,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6773101267266911,"acs":148421,"articleLive":2,"columnArticles":535,"formTitle":"[183]从不订购的客户","frequency":1.9060177396,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":219133,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47526710957835683,"acs":101153,"articleLive":2,"columnArticles":661,"formTitle":"[184]部门工资最高的员工","frequency":3.4379476988,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":212834,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49508092219428407,"acs":69898,"articleLive":2,"columnArticles":618,"formTitle":"[185]部门工资前三高的所有员工","frequency":3.5076188556,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":141185,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7551247096839342,"acs":7478,"articleLive":2,"columnArticles":111,"formTitle":"[186]翻转字符串里的单词 II","frequency":1.1040401347,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"","submitted":9903,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.4837348577650742,"acs":42648,"articleLive":2,"columnArticles":285,"formTitle":"[187]重复的DNA序列","frequency":1.2261428315,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"","submitted":88164,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.39104809465409085,"acs":88642,"articleLive":2,"columnArticles":689,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":2.6379704946,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":226678,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.45142142619734316,"acs":336829,"articleLive":2,"columnArticles":1677,"formTitle":"[189]旋转数组","frequency":3.1647372473,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":746152,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6972535934291582,"acs":130392,"articleLive":2,"columnArticles":823,"formTitle":"[190]颠倒二进制位","frequency":2.4771627283,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":187008,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7483990910968809,"acs":188396,"articleLive":2,"columnArticles":1187,"formTitle":"[191]位1的个数","frequency":1.5170524484,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":251732,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3558107593784647,"acs":21502,"articleLive":2,"columnArticles":175,"formTitle":"[192]统计词频","frequency":2.6712182378,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":60431,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.32448710709580275,"acs":25860,"articleLive":2,"columnArticles":140,"formTitle":"[193]有效电话号码","frequency":1.1040401347,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":79695,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3450654224566386,"acs":10206,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":0.7449949145,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":29577,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4359805510534846,"acs":35239,"articleLive":2,"columnArticles":142,"formTitle":"[195]第十行","frequency":2.4528051415,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":80827,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6653605431352269,"acs":100355,"articleLive":2,"columnArticles":383,"formTitle":"[196]删除重复的电子邮箱","frequency":2.888441219,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":150828,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5335819397033935,"acs":93006,"articleLive":2,"columnArticles":499,"formTitle":"[197]上升的温度","frequency":2.6379704946,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":174305,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5142439079446636,"acs":382725,"articleLive":2,"columnArticles":2647,"formTitle":"[198]打家劫舍","frequency":3.8618254681,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":744248,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6521852954788764,"acs":139507,"articleLive":2,"columnArticles":1571,"formTitle":"[199]二叉树的右视图","frequency":3.90770656,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":213907,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5550115113979053,"acs":325204,"articleLive":2,"columnArticles":2093,"formTitle":"[200]岛屿数量","frequency":4.2422478269,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":585941,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5235918906537974,"acs":49148,"articleLive":2,"columnArticles":322,"formTitle":"[201]数字范围按位与","frequency":1.7506672996,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":93867,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.618770776390633,"acs":167526,"articleLive":2,"columnArticles":1369,"formTitle":"[202]快乐数","frequency":2.8455377691,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":270740,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5153042762973068,"acs":229280,"articleLive":2,"columnArticles":1640,"formTitle":"[203]移除链表元素","frequency":2.5551417155,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":444941,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.377966866790051,"acs":167462,"articleLive":2,"columnArticles":730,"formTitle":"[204]计数质数","frequency":2.7233465483,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":443060,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5007309324387372,"acs":112692,"articleLive":2,"columnArticles":863,"formTitle":"[205]同构字符串","frequency":2.3877397836,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":225055,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7230054654963443,"acs":700319,"articleLive":2,"columnArticles":7327,"formTitle":"[206]反转链表","frequency":4.2414994879,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":968622,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5441993875731618,"acs":140398,"articleLive":2,"columnArticles":923,"formTitle":"[207]课程表","frequency":3.3483967228,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":257990,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7169567956165699,"acs":143410,"articleLive":2,"columnArticles":969,"formTitle":"[208]实现 Trie (前缀树)","frequency":3.1074293132,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":200026,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4711802491837638,"acs":190640,"articleLive":2,"columnArticles":1356,"formTitle":"[209]长度最小的子数组","frequency":2.529049008,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":404601,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5420390163231557,"acs":88496,"articleLive":2,"columnArticles":670,"formTitle":"[210]课程表 II","frequency":2.2156713217,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":163265,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4816025074606959,"acs":28887,"articleLive":2,"columnArticles":318,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":1.4003059508,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":59981,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.463135670453855,"acs":60982,"articleLive":2,"columnArticles":559,"formTitle":"[212]单词搜索 II","frequency":1.3483029692,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":131672,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4329850623354612,"acs":162989,"articleLive":2,"columnArticles":1503,"formTitle":"[213]打家劫舍 II","frequency":3.6516006026,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":376431,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37104495878478094,"acs":30924,"articleLive":2,"columnArticles":304,"formTitle":"[214]最短回文串","frequency":2.4870824604,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":83343,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.646413468265533,"acs":435183,"articleLive":2,"columnArticles":2266,"formTitle":"[215]数组中的第K个最大元素","frequency":4.2324243459,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":673227,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7376827389229208,"acs":98145,"articleLive":2,"columnArticles":1017,"formTitle":"[216]组合总和 III","frequency":3.2205429425,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":133045,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5596617493364494,"acs":358249,"articleLive":2,"columnArticles":1663,"formTitle":"[217]存在重复元素","frequency":3.751811504,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":640117,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5427518342084217,"acs":31218,"articleLive":2,"columnArticles":279,"formTitle":"[218]天际线问题","frequency":3.0368782022,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":57518,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.425066238396158,"acs":109574,"articleLive":2,"columnArticles":878,"formTitle":"[219]存在重复元素 II","frequency":2.2751917678,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":257781,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.2868453379002394,"acs":63982,"articleLive":2,"columnArticles":415,"formTitle":"[220]存在重复元素 III","frequency":2.9823628519,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":223054,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47545039286281937,"acs":137602,"articleLive":2,"columnArticles":974,"formTitle":"[221]最大正方形","frequency":3.4571963362,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":289414,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7808984178377569,"acs":114803,"articleLive":2,"columnArticles":871,"formTitle":"[222]完全二叉树的节点个数","frequency":1.8361894731,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":147014,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.46325477299716816,"acs":20285,"articleLive":2,"columnArticles":259,"formTitle":"[223]矩形面积","frequency":2.0777417738,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"","submitted":43788,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4183032581155507,"acs":70331,"articleLive":2,"columnArticles":648,"formTitle":"[224]基本计算器","frequency":3.4492762695,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":168134,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6754329666109087,"acs":133654,"articleLive":2,"columnArticles":4748,"formTitle":"[225]用队列实现栈","frequency":2.3142869227,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":197879,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7875937244194774,"acs":301153,"articleLive":2,"columnArticles":1847,"formTitle":"[226]翻转二叉树","frequency":3.6728505008,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":382371,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43721562491984917,"acs":85233,"articleLive":2,"columnArticles":694,"formTitle":"[227]基本计算器 II","frequency":3.3212653787,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":194945,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5810079990129753,"acs":56510,"articleLive":2,"columnArticles":635,"formTitle":"[228]汇总区间","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":97262,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.4636589234547687,"acs":36247,"articleLive":2,"columnArticles":306,"formTitle":"[229]求众数 II","frequency":1.8665711172,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":78176,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7413915107177461,"acs":136204,"articleLive":2,"columnArticles":848,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":1.6892983532,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":183714,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5036892671711558,"acs":165404,"articleLive":2,"columnArticles":1196,"formTitle":"[231]2 的幂","frequency":2.0136097659,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":328385,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6910226070310544,"acs":157388,"articleLive":2,"columnArticles":1258,"formTitle":"[232]用栈实现队列","frequency":2.5347862584,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":227761,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47675214869680665,"acs":34114,"articleLive":2,"columnArticles":412,"formTitle":"[233]数字 1 的个数","frequency":3.0481573653,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":71555,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.49543266631920185,"acs":307033,"articleLive":2,"columnArticles":1965,"formTitle":"[234]回文链表","frequency":3.7544734517,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":619727,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.666225202217074,"acs":168519,"articleLive":2,"columnArticles":962,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":2.5226354406,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":252946,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6803735920836094,"acs":254672,"articleLive":2,"columnArticles":1372,"formTitle":"[236]二叉树的最近公共祖先","frequency":3.570377163,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":374312,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8482898719298174,"acs":207121,"articleLive":2,"columnArticles":1011,"formTitle":"[237]删除链表中的节点","frequency":2.4480073584,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":244163,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7228873128115416,"acs":137191,"articleLive":2,"columnArticles":862,"formTitle":"[238]除自身以外数组的乘积","frequency":2.6095594928,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":189782,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.49658151070379436,"acs":190513,"articleLive":2,"columnArticles":1306,"formTitle":"[239]滑动窗口最大值","frequency":3.2019059437,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":383649,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4769585121602289,"acs":166697,"articleLive":2,"columnArticles":753,"formTitle":"[240]搜索二维矩阵 II","frequency":2.9207385523,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":349500,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7373228271929202,"acs":31160,"articleLive":2,"columnArticles":279,"formTitle":"[241]为运算表达式设计优先级","frequency":2.701282774,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":42261,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6448930743046013,"acs":287207,"articleLive":2,"columnArticles":1660,"formTitle":"[242]有效的字母异位词","frequency":2.6379704946,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":445356,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6555656245280169,"acs":8681,"articleLive":2,"columnArticles":103,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"","submitted":13242,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5486118916488704,"acs":4881,"articleLive":2,"columnArticles":57,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"","submitted":8897,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6031045286243235,"acs":4235,"articleLive":2,"columnArticles":59,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"","submitted":7022,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.47554507955215086,"acs":5649,"articleLive":2,"columnArticles":106,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"","submitted":11879,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5237654320987655,"acs":5091,"articleLive":2,"columnArticles":92,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"","submitted":9720,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46375266524520253,"acs":2610,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"","submitted":5628,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6374420969381991,"acs":5642,"articleLive":2,"columnArticles":100,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"ac","submitted":8851,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6337519849862856,"acs":4390,"articleLive":2,"columnArticles":75,"formTitle":"[250]统计同值子树","frequency":0.229388925,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"","submitted":6927,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5431472081218274,"acs":3531,"articleLive":2,"columnArticles":67,"formTitle":"[251]展开二维向量","frequency":0.7745391608,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"","submitted":6501,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5622755351242638,"acs":11742,"articleLive":2,"columnArticles":152,"formTitle":"[252]会议室","frequency":0.229388925,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"","submitted":20883,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5000955322739865,"acs":31409,"articleLive":2,"columnArticles":340,"formTitle":"[253]会议室 II","frequency":2.6379704946,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"","submitted":62806,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5683404638594911,"acs":5048,"articleLive":2,"columnArticles":74,"formTitle":"[254]因子的组合","frequency":0.7745391608,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"","submitted":8882,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4725468373214617,"acs":5095,"articleLive":2,"columnArticles":57,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"","submitted":10782,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6374435335452568,"acs":11430,"articleLive":2,"columnArticles":177,"formTitle":"[256]粉刷房子","frequency":0.229388925,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"","submitted":17931,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6816994382703184,"acs":140653,"articleLive":2,"columnArticles":1045,"formTitle":"[257]二叉树的所有路径","frequency":2.7893161235,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":206327,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6917316637169716,"acs":77779,"articleLive":2,"columnArticles":642,"formTitle":"[258]各位相加","frequency":2.0929535061,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":112441,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5652774392720773,"acs":6958,"articleLive":2,"columnArticles":84,"formTitle":"[259]较小的三数之和","frequency":0.2566981044,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"","submitted":12309,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7246603308694122,"acs":51469,"articleLive":2,"columnArticles":437,"formTitle":"[260]只出现一次的数字 III","frequency":2.2721502179,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":71025,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49452306234827403,"acs":8352,"articleLive":2,"columnArticles":116,"formTitle":"[261]以图判树","frequency":1.1040401347,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"","submitted":16889,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43676623226848116,"acs":37872,"articleLive":2,"columnArticles":366,"formTitle":"[262]行程和用户","frequency":2.9207385523,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":86710,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5151463564111793,"acs":105911,"articleLive":2,"columnArticles":831,"formTitle":"[263]丑数","frequency":2.701282774,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":205594,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5796963113482113,"acs":98993,"articleLive":2,"columnArticles":603,"formTitle":"[264]丑数 II","frequency":3.1005940166,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":170767,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.585335468944652,"acs":6578,"articleLive":2,"columnArticles":146,"formTitle":"[265]粉刷房子 II","frequency":0.2032094194,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"","submitted":11238,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6724913141222154,"acs":6581,"articleLive":2,"columnArticles":102,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"","submitted":9786,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.4471803018268467,"acs":3378,"articleLive":2,"columnArticles":77,"formTitle":"[267]回文排列 II","frequency":0.2852225711,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"","submitted":7554,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6245327599354927,"acs":149871,"articleLive":2,"columnArticles":1084,"formTitle":"[268]丢失的数字","frequency":1.6044217993,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":239973,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.33831816211530125,"acs":6244,"articleLive":2,"columnArticles":103,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"","submitted":18456,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5519028153607001,"acs":9586,"articleLive":2,"columnArticles":136,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.7449949145,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"","submitted":17369,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.553639846743295,"acs":2601,"articleLive":2,"columnArticles":44,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"","submitted":4698,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6466641104294478,"acs":3373,"articleLive":2,"columnArticles":75,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.2566981044,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"","submitted":5216,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3101278772378517,"acs":12126,"articleLive":2,"columnArticles":159,"formTitle":"[273]整数转换英文表示","frequency":1.6098374638,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"","submitted":39100,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.44018534119629316,"acs":53295,"articleLive":2,"columnArticles":562,"formTitle":"[274]H 指数","frequency":2.8286603011,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":121074,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4623048000658671,"acs":50535,"articleLive":2,"columnArticles":414,"formTitle":"[275]H 指数 II","frequency":1.6098374638,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":109311,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.48882035466461066,"acs":6974,"articleLive":2,"columnArticles":124,"formTitle":"[276]栅栏涂色","frequency":1.1349067827,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"","submitted":14267,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5674012927342107,"acs":7286,"articleLive":2,"columnArticles":82,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"","submitted":12841,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45392959838296365,"acs":176964,"articleLive":2,"columnArticles":1014,"formTitle":"[278]第一个错误的版本","frequency":3.3851848965,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":389849,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6315575488437912,"acs":200385,"articleLive":2,"columnArticles":1179,"formTitle":"[279]完全平方数","frequency":3.3463356313,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":317287,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6851966745253754,"acs":5522,"articleLive":2,"columnArticles":70,"formTitle":"[280]摆动排序","frequency":0.7745391608,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"ac","submitted":8059,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7572607765209416,"acs":2477,"articleLive":2,"columnArticles":61,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"","submitted":3271,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.39026096314231906,"acs":7253,"articleLive":2,"columnArticles":75,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":18585,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6381936110825599,"acs":478097,"articleLive":2,"columnArticles":3318,"formTitle":"[283]移动零","frequency":3.7156942953,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":749141,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7337606222094195,"acs":10189,"articleLive":2,"columnArticles":101,"formTitle":"[284]顶端迭代器","frequency":0.7745391608,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"","submitted":13886,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6357096669899773,"acs":7865,"articleLive":2,"columnArticles":101,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"","submitted":12372,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5086241655839792,"acs":11353,"articleLive":2,"columnArticles":145,"formTitle":"[286]墙与门","frequency":0.229388925,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"ac","submitted":22321,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6606418364607262,"acs":177163,"articleLive":2,"columnArticles":1212,"formTitle":"[287]寻找重复数","frequency":2.9887457164,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":268168,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.42968553459119496,"acs":3416,"articleLive":2,"columnArticles":54,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"ac","submitted":7950,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7530024764167824,"acs":52604,"articleLive":2,"columnArticles":823,"formTitle":"[289]生命游戏","frequency":0.1780824693,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":69859,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45686967249887844,"acs":81469,"articleLive":2,"columnArticles":1082,"formTitle":"[290]单词规律","frequency":1.5778244868,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":178320,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5327903986283755,"acs":2486,"articleLive":2,"columnArticles":54,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"","submitted":4666,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7088514126591784,"acs":113278,"articleLive":2,"columnArticles":757,"formTitle":"[292]Nim 游戏","frequency":0.9293988758,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":159805,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7105571847507332,"acs":4846,"articleLive":2,"columnArticles":83,"formTitle":"[293]翻转游戏","frequency":0.229388925,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"","submitted":6820,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5826243455497382,"acs":3561,"articleLive":2,"columnArticles":53,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"","submitted":6112,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5229999834948091,"acs":63374,"articleLive":2,"columnArticles":497,"formTitle":"[295]数据流的中位数","frequency":1.7420502709,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":121174,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6182657773217034,"acs":2410,"articleLive":2,"columnArticles":46,"formTitle":"[296]最佳的碰头地点","frequency":0.8372261388,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"","submitted":3898,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5591078147299225,"acs":103426,"articleLive":2,"columnArticles":744,"formTitle":"[297]二叉树的序列化与反序列化","frequency":2.8170187261,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":184984,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5796155241204207,"acs":4794,"articleLive":2,"columnArticles":80,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"","submitted":8271,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5041151572158022,"acs":30013,"articleLive":2,"columnArticles":356,"formTitle":"[299]猜数字游戏","frequency":1.1040401347,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":59536,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5149739847091438,"acs":355915,"articleLive":2,"columnArticles":1991,"formTitle":"[300]最长递增子序列","frequency":3.4845155319,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":691132,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5234845184503929,"acs":32444,"articleLive":2,"columnArticles":229,"formTitle":"[301]删除无效的括号","frequency":2.3093107977,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":61977,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.665770910312395,"acs":1982,"articleLive":2,"columnArticles":37,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"","submitted":2977,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7254994947185385,"acs":128507,"articleLive":2,"columnArticles":783,"formTitle":"[303]区域和检索 - 数组不可变","frequency":2.1729577707,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":177129,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5443668906142438,"acs":62471,"articleLive":2,"columnArticles":557,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":1.6601077226,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":114759,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.37912933297130963,"acs":4189,"articleLive":2,"columnArticles":62,"formTitle":"[305]岛屿数量 II","frequency":0.229388925,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"","submitted":11049,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3374026606099935,"acs":16638,"articleLive":2,"columnArticles":248,"formTitle":"[306]累加数","frequency":1.9250206868,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":49312,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5413878448987075,"acs":23624,"articleLive":2,"columnArticles":230,"formTitle":"[307]区域和检索 - 数组可修改","frequency":1.3483029692,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":43636,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6079779917469051,"acs":2210,"articleLive":2,"columnArticles":42,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"","submitted":3635,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6066755097958711,"acs":115255,"articleLive":2,"columnArticles":919,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":3.3212653787,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":189978,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.37932125901178126,"acs":21572,"articleLive":2,"columnArticles":210,"formTitle":"[310]最小高度树","frequency":1.9642413999,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":56870,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7622699386503068,"acs":3479,"articleLive":2,"columnArticles":44,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.7745391608,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"ac","submitted":4564,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6828839678521395,"acs":55569,"articleLive":2,"columnArticles":374,"formTitle":"[312]戳气球","frequency":2.5446191793,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":81374,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6351710996677218,"acs":40334,"articleLive":2,"columnArticles":352,"formTitle":"[313]超级丑数","frequency":2.5703772035,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":63501,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5433246560059501,"acs":4383,"articleLive":2,"columnArticles":87,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"","submitted":8067,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4185694324751713,"acs":50027,"articleLive":2,"columnArticles":480,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":2.6035792098,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":119519,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4768826482023816,"acs":66600,"articleLive":2,"columnArticles":523,"formTitle":"[316]去除重复字母","frequency":2.6672465902,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":139657,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4818676862472483,"acs":4159,"articleLive":2,"columnArticles":64,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"","submitted":8631,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6842359935022293,"acs":19797,"articleLive":2,"columnArticles":172,"formTitle":"[318]最大单词长度乘积","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":28933,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5178738025348716,"acs":22759,"articleLive":2,"columnArticles":224,"formTitle":"[319]灯泡开关","frequency":0.7745391608,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":43947,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6748494673459935,"acs":2914,"articleLive":2,"columnArticles":49,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"","submitted":4318,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.425055532305315,"acs":26407,"articleLive":2,"columnArticles":228,"formTitle":"[321]拼接最大数","frequency":1.4330635473,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":62126,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4442445537596627,"acs":300276,"articleLive":2,"columnArticles":1796,"formTitle":"[322]零钱兑换","frequency":3.8147803173,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":675925,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6319540092221091,"acs":10553,"articleLive":2,"columnArticles":144,"formTitle":"[323]无向图中连通分量的数目","frequency":1.6098374638,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"","submitted":16699,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.37808941119457234,"acs":24966,"articleLive":2,"columnArticles":167,"formTitle":"[324]摆动排序 II","frequency":1.7829802886,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":66032,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5376106194690266,"acs":9234,"articleLive":2,"columnArticles":103,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":1.1349067827,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"","submitted":17176,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.489815082712797,"acs":96497,"articleLive":2,"columnArticles":382,"formTitle":"[326]3的幂","frequency":1.1040401347,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"","submitted":197007,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42304897041010553,"acs":24448,"articleLive":2,"columnArticles":204,"formTitle":"[327]区间和的个数","frequency":1.9992344734,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":57790,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6562339106616966,"acs":127459,"articleLive":2,"columnArticles":1053,"formTitle":"[328]奇偶链表","frequency":2.9365042895,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":194228,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.48410008495135004,"acs":55276,"articleLive":2,"columnArticles":487,"formTitle":"[329]矩阵中的最长递增路径","frequency":2.6035792098,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":114183,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5339924083621325,"acs":18851,"articleLive":2,"columnArticles":149,"formTitle":"[330]按要求补齐数组","frequency":1.6098374638,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35302,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.47965559444313227,"acs":44678,"articleLive":2,"columnArticles":502,"formTitle":"[331]验证二叉树的前序序列化","frequency":1.4330635473,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":93146,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.44890037324145854,"acs":39088,"articleLive":2,"columnArticles":325,"formTitle":"[332]重新安排行程","frequency":2.2069720845,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":87075,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46859512491149996,"acs":4633,"articleLive":2,"columnArticles":77,"formTitle":"[333]最大 BST 子树","frequency":0.7745391608,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"","submitted":9887,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41225906641088883,"acs":45130,"articleLive":2,"columnArticles":296,"formTitle":"[334]递增的三元子序列","frequency":1.3687326889,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":109470,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.36754716981132074,"acs":2922,"articleLive":2,"columnArticles":37,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":7950,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4009719871129799,"acs":22029,"articleLive":2,"columnArticles":191,"formTitle":"[336]回文对","frequency":1.6775085444,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":54939,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6079934986085321,"acs":128680,"articleLive":2,"columnArticles":916,"formTitle":"[337]打家劫舍 III","frequency":3.2238490221,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":211647,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7868451281026819,"acs":157550,"articleLive":2,"columnArticles":1356,"formTitle":"[338]比特位计数","frequency":2.7471300133,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":200230,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8068481123792801,"acs":3676,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"","submitted":4556,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.4931775541531639,"acs":11566,"articleLive":2,"columnArticles":174,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":1.1349067827,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"","submitted":23452,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.727276648359548,"acs":50585,"articleLive":2,"columnArticles":487,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":2.3349203919,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":69554,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5155708306638485,"acs":86106,"articleLive":2,"columnArticles":761,"formTitle":"[342]4的幂","frequency":2.3349203919,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":167011,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6053258741258741,"acs":108202,"articleLive":2,"columnArticles":1032,"formTitle":"[343]整数拆分","frequency":3.2170043684,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":178750,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7673878179597472,"acs":361267,"articleLive":2,"columnArticles":1905,"formTitle":"[344]反转字符串","frequency":3.1540112541,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":470775,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5391394192910918,"acs":107492,"articleLive":2,"columnArticles":1022,"formTitle":"[345]反转字符串中的元音字母","frequency":2.5310310906,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":199377,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7072270089678213,"acs":12066,"articleLive":2,"columnArticles":134,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"ac","submitted":17061,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6221009762831283,"acs":199193,"articleLive":2,"columnArticles":1473,"formTitle":"[347]前 K 个高频元素","frequency":3.4973334666,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":320194,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.5985694566444975,"acs":4770,"articleLive":2,"columnArticles":78,"formTitle":"[348]设计井字棋","frequency":0.2032094194,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"","submitted":7969,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7385911987499694,"acs":211291,"articleLive":2,"columnArticles":1492,"formTitle":"[349]两个数组的交集","frequency":2.9996438191,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":286073,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.549737749070937,"acs":244525,"articleLive":2,"columnArticles":1369,"formTitle":"[350]两个数组的交集 II","frequency":3.0618670087,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":444803,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5899391929242676,"acs":5336,"articleLive":2,"columnArticles":100,"formTitle":"[351]安卓系统手势解锁","frequency":0.4857969074,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"","submitted":9045,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.5919007362967003,"acs":4341,"articleLive":2,"columnArticles":84,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"","submitted":7334,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4243027888446215,"acs":2130,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":0.9053375646,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"","submitted":5020,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.45260894927607476,"acs":69055,"articleLive":2,"columnArticles":527,"formTitle":"[354]俄罗斯套娃信封问题","frequency":3.2505395526,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":152571,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4069041726977012,"acs":26144,"articleLive":2,"columnArticles":434,"formTitle":"[355]设计推特","frequency":1.7133495366,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":64251,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35018050541516244,"acs":1552,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"","submitted":4432,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5198792362971467,"acs":24452,"articleLive":2,"columnArticles":383,"formTitle":"[357]计算各个位数不同的数字个数","frequency":2.1729577707,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":47034,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.3507967165620473,"acs":4359,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"","submitted":12426,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7259935054894078,"acs":4695,"articleLive":2,"columnArticles":55,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"","submitted":6467,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6082024432809773,"acs":2788,"articleLive":2,"columnArticles":61,"formTitle":"[360]有序转化数组","frequency":0.2852225711,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"","submitted":4584,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5624560168895144,"acs":3197,"articleLive":2,"columnArticles":63,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"","submitted":5684,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6928217288208666,"acs":3214,"articleLive":2,"columnArticles":62,"formTitle":"[362]敲击计数器","frequency":0.2566981044,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"","submitted":4639,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.490176405402977,"acs":32733,"articleLive":2,"columnArticles":213,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":2.6379704946,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":66778,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7202572347266881,"acs":1792,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"","submitted":2488,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3646520744854623,"acs":33486,"articleLive":2,"columnArticles":481,"formTitle":"[365]水壶问题","frequency":2.3679365961,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":91830,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7642557842958645,"acs":4195,"articleLive":2,"columnArticles":119,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"","submitted":5489,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.43938701220535553,"acs":75923,"articleLive":2,"columnArticles":601,"formTitle":"[367]有效的完全平方数","frequency":0.7449949145,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":172793,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4592539136227379,"acs":41365,"articleLive":2,"columnArticles":449,"formTitle":"[368]最大整除子集","frequency":3.2852643707,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":90070,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6170657015590201,"acs":4433,"articleLive":2,"columnArticles":126,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"","submitted":7184,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7215750232991612,"acs":3097,"articleLive":2,"columnArticles":46,"formTitle":"[370]区间加法","frequency":0.7745391608,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"","submitted":4292,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.5803609477541976,"acs":54475,"articleLive":2,"columnArticles":314,"formTitle":"[371]两整数之和","frequency":2.2422615615,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":93864,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5099815837937385,"acs":13846,"articleLive":2,"columnArticles":135,"formTitle":"[372]超级次方","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":27150,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.419578225030336,"acs":20055,"articleLive":2,"columnArticles":202,"formTitle":"[373]查找和最小的K对数字","frequency":1.8164805182,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":47798,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5147587831994285,"acs":82138,"articleLive":2,"columnArticles":559,"formTitle":"[374]猜数字大小","frequency":1.5778244868,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":159566,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.46820207540418335,"acs":14393,"articleLive":2,"columnArticles":119,"formTitle":"[375]猜数字大小 II","frequency":1.6430366354,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":30741,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4631507183467704,"acs":74049,"articleLive":2,"columnArticles":799,"formTitle":"[376]摆动序列","frequency":1.5170524484,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":159881,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5077098068743442,"acs":63383,"articleLive":2,"columnArticles":541,"formTitle":"[377]组合总和 Ⅳ","frequency":2.9541473717,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":124841,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6390248235541127,"acs":79133,"articleLive":2,"columnArticles":561,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":2.3349203919,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":123834,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6396490495090871,"acs":3062,"articleLive":2,"columnArticles":67,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"","submitted":4787,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5023740710156895,"acs":34069,"articleLive":2,"columnArticles":212,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":1.3088345473,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":67816,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.441644757598065,"acs":20998,"articleLive":2,"columnArticles":175,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":47545,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6303809794295452,"acs":15537,"articleLive":2,"columnArticles":122,"formTitle":"[382]链表随机节点","frequency":1.1669539601,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":24647,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.599026571718496,"acs":66707,"articleLive":2,"columnArticles":741,"formTitle":"[383]赎金信","frequency":0.1539383704,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":111359,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.577299190393887,"acs":50770,"articleLive":2,"columnArticles":197,"formTitle":"[384]打乱数组","frequency":2.3877397836,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":87944,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4154190328686973,"acs":7242,"articleLive":2,"columnArticles":84,"formTitle":"[385]迷你语法分析器","frequency":0.229388925,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17433,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7487716664391975,"acs":21945,"articleLive":2,"columnArticles":238,"formTitle":"[386]字典序排数","frequency":2.66910626,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":29308,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5326511209578673,"acs":217939,"articleLive":2,"columnArticles":1176,"formTitle":"[387]字符串中的第一个唯一字符","frequency":2.9207385523,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":409159,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5263298345490126,"acs":5917,"articleLive":2,"columnArticles":107,"formTitle":"[388]文件的最长绝对路径","frequency":0.229388925,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":11242,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6918968475007119,"acs":99620,"articleLive":2,"columnArticles":980,"formTitle":"[389]找不同","frequency":0.7449949145,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":143981,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46686827956989246,"acs":6947,"articleLive":2,"columnArticles":93,"formTitle":"[390]消除游戏","frequency":1.887398695,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":14880,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.35703088258347704,"acs":4555,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":12758,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5150530971560436,"acs":144630,"articleLive":2,"columnArticles":1557,"formTitle":"[392]判断子序列","frequency":2.5501948837,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":280806,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3917139492559683,"acs":10977,"articleLive":2,"columnArticles":127,"formTitle":"[393]UTF-8 编码验证","frequency":1.5778244868,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":28023,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5521121708499269,"acs":120059,"articleLive":2,"columnArticles":1284,"formTitle":"[394]字符串解码","frequency":4.051209491,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":217454,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5205778667289777,"acs":51241,"articleLive":2,"columnArticles":425,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":2.6379704946,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":98431,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.42701078141398724,"acs":8951,"articleLive":2,"columnArticles":144,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":20962,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.3777512497202119,"acs":15189,"articleLive":2,"columnArticles":187,"formTitle":"[397]整数替换","frequency":1.0742760328,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":40209,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.655586759357304,"acs":14240,"articleLive":2,"columnArticles":120,"formTitle":"[398]随机数索引","frequency":1.4003059508,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":21721,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5924308173863555,"acs":41639,"articleLive":2,"columnArticles":521,"formTitle":"[399]除法求值","frequency":0.7449949145,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":70285,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4145401178454866,"acs":18925,"articleLive":2,"columnArticles":192,"formTitle":"[400]第 N 位数字","frequency":2.1729577707,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":45653,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6136927458997565,"acs":53433,"articleLive":2,"columnArticles":654,"formTitle":"[401]二进制手表","frequency":2.2104421414,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":87068,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.32742749028347223,"acs":79780,"articleLive":2,"columnArticles":581,"formTitle":"[402]移掉 K 位数字","frequency":3.3212653787,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":243657,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4557831989179983,"acs":45494,"articleLive":2,"columnArticles":456,"formTitle":"[403]青蛙过河","frequency":3.2808558404,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":99815,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5830211423236465,"acs":98667,"articleLive":2,"columnArticles":1109,"formTitle":"[404]左叶子之和","frequency":2.6078113934,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":169234,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5223744646214074,"acs":26954,"articleLive":2,"columnArticles":276,"formTitle":"[405]数字转换为十六进制数","frequency":2.3030151335,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"","submitted":51599,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7369450921798711,"acs":117881,"articleLive":2,"columnArticles":783,"formTitle":"[406]根据身高重建队列","frequency":2.7286122126,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":159959,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.484726803384483,"acs":10140,"articleLive":2,"columnArticles":126,"formTitle":"[407]接雨水 II","frequency":2.6379704946,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":20919,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3244581464872945,"acs":3473,"articleLive":2,"columnArticles":82,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"","submitted":10704,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5558793085911558,"acs":92908,"articleLive":2,"columnArticles":1304,"formTitle":"[409]最长回文串","frequency":3.0467969504,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":167137,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5636689389966789,"acs":38697,"articleLive":2,"columnArticles":310,"formTitle":"[410]分割数组的最大值","frequency":3.0682156317,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":68652,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.49801249290176036,"acs":877,"articleLive":2,"columnArticles":21,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"","submitted":1761,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6741763274520507,"acs":72867,"articleLive":2,"columnArticles":368,"formTitle":"[412]Fizz Buzz","frequency":1.1669539601,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":108083,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6872020715224513,"acs":70063,"articleLive":2,"columnArticles":906,"formTitle":"[413]等差数列划分","frequency":2.6058340531,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":101954,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.3637277066063803,"acs":60816,"articleLive":2,"columnArticles":833,"formTitle":"[414]第三大的数","frequency":0.6891144561,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":167202,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5376031070698319,"acs":146449,"articleLive":2,"columnArticles":1061,"formTitle":"[415]字符串相加","frequency":4.221265537,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":272411,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5070855341094317,"acs":170793,"articleLive":2,"columnArticles":968,"formTitle":"[416]分割等和子集","frequency":3.5642331279,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":336813,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4791222079954474,"acs":26942,"articleLive":2,"columnArticles":315,"formTitle":"[417]太平洋大西洋水流问题","frequency":2.701282774,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":56232,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.361474435196195,"acs":2128,"articleLive":2,"columnArticles":32,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"","submitted":5887,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7556045340050378,"acs":11999,"articleLive":2,"columnArticles":155,"formTitle":"[419]甲板上的战舰","frequency":0.2032094194,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":15880,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20739047619047618,"acs":2722,"articleLive":2,"columnArticles":52,"formTitle":"[420]强密码检验器","frequency":1.2349457052,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13125,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6223413290052277,"acs":32976,"articleLive":2,"columnArticles":304,"formTitle":"[421]数组中两个数的最大异或值","frequency":2.864449074,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":52987,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.426669576604103,"acs":1955,"articleLive":2,"columnArticles":47,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"","submitted":4582,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5699588477366255,"acs":8310,"articleLive":2,"columnArticles":137,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14580,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5305735733547118,"acs":50960,"articleLive":2,"columnArticles":446,"formTitle":"[424]替换后的最长重复字符","frequency":3.0618670087,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":96047,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.613126783530371,"acs":1504,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"","submitted":2453,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6675275653124069,"acs":6720,"articleLive":2,"columnArticles":113,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":1.4330635473,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"","submitted":10067,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6120054159771325,"acs":4068,"articleLive":2,"columnArticles":67,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6647,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6501516683518705,"acs":2572,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"","submitted":3956,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6986205057337503,"acs":57632,"articleLive":2,"columnArticles":460,"formTitle":"[429]N 叉树的层序遍历","frequency":1.6098374638,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":82494,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.542811389681229,"acs":21694,"articleLive":2,"columnArticles":311,"formTitle":"[430]扁平化多级双向链表","frequency":0.8052541061,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":39966,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7294938917975567,"acs":836,"articleLive":2,"columnArticles":29,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"","submitted":1146,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.3782873730043541,"acs":6516,"articleLive":2,"columnArticles":85,"formTitle":"[432]全 O(1) 的数据结构","frequency":1.2002681668,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17225,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5323583680721656,"acs":15580,"articleLive":2,"columnArticles":210,"formTitle":"[433]最小基因变化","frequency":0.1539383704,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":29266,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3737017822206216,"acs":38393,"articleLive":2,"columnArticles":524,"formTitle":"[434]字符串中的单词数","frequency":1.1349067827,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"","submitted":102737,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5086313493199134,"acs":94197,"articleLive":2,"columnArticles":830,"formTitle":"[435]无重叠区间","frequency":2.8674920122,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":185197,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4857061826432218,"acs":8563,"articleLive":2,"columnArticles":140,"formTitle":"[436]寻找右区间","frequency":0.2032094194,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":17630,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5665115853728239,"acs":99118,"articleLive":2,"columnArticles":817,"formTitle":"[437]路径总和 III","frequency":2.2422615615,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"","submitted":174962,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5176803711227134,"acs":92510,"articleLive":2,"columnArticles":797,"formTitle":"[438]找到字符串中所有字母异位词","frequency":2.1401320664,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":178701,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5890495867768595,"acs":2851,"articleLive":2,"columnArticles":67,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"","submitted":4840,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.38002293524304337,"acs":16238,"articleLive":2,"columnArticles":120,"formTitle":"[440]字典序的第K小数字","frequency":3.108527418,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":42729,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.42543345185293796,"acs":46425,"articleLive":2,"columnArticles":466,"formTitle":"[441]排列硬币","frequency":1.0742760328,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":109124,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6975004084299951,"acs":42694,"articleLive":2,"columnArticles":428,"formTitle":"[442]数组中重复的数据","frequency":2.9887457164,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":61210,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.47694481311812303,"acs":55700,"articleLive":2,"columnArticles":689,"formTitle":"[443]压缩字符串","frequency":3.0481573653,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":116785,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2511042898854533,"acs":3354,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":0.2566981044,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"","submitted":13357,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5885338454429941,"acs":81519,"articleLive":2,"columnArticles":925,"formTitle":"[445]两数相加 II","frequency":3.2852643707,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":138512,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5521085378499827,"acs":19167,"articleLive":2,"columnArticles":169,"formTitle":"[446]等差数列划分 II - 子序列","frequency":2.0590691871,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":34716,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6624732774214768,"acs":48342,"articleLive":2,"columnArticles":373,"formTitle":"[447]回旋镖的数量","frequency":0.7547178886,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":72972,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6478990351761675,"acs":135580,"articleLive":2,"columnArticles":1064,"formTitle":"[448]找到所有数组中消失的数字","frequency":2.7764657796,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":209261,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5564513160316584,"acs":15116,"articleLive":2,"columnArticles":134,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":27165,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4853187919463087,"acs":59007,"articleLive":2,"columnArticles":605,"formTitle":"[450]删除二叉搜索树中的节点","frequency":2.2422615615,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":121584,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7113506736593032,"acs":80569,"articleLive":2,"columnArticles":941,"formTitle":"[451]根据字符出现频率排序","frequency":2.8170187261,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":113262,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5091685506154232,"acs":95269,"articleLive":2,"columnArticles":830,"formTitle":"[452]用最少数量的箭引爆气球","frequency":2.4528051415,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":187107,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5545329132950357,"acs":26932,"articleLive":2,"columnArticles":296,"formTitle":"[453]最小操作次数使数组元素相等","frequency":1.1040401347,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":48567,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6018004466224179,"acs":77613,"articleLive":2,"columnArticles":486,"formTitle":"[454]四数相加 II","frequency":2.9541473717,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":128968,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5772280857468115,"acs":149580,"articleLive":2,"columnArticles":1218,"formTitle":"[455]分发饼干","frequency":2.6910051913,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":259135,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3623345266838731,"acs":56576,"articleLive":2,"columnArticles":456,"formTitle":"[456]132 模式","frequency":2.4528051415,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":156143,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43527792644697605,"acs":28465,"articleLive":2,"columnArticles":330,"formTitle":"[457]环形数组是否存在循环","frequency":2.1401320664,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":65395,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6099258309678601,"acs":6661,"articleLive":2,"columnArticles":62,"formTitle":"[458]可怜的小猪","frequency":0.7745391608,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":10921,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5112252154680272,"acs":78356,"articleLive":2,"columnArticles":633,"formTitle":"[459]重复的子字符串","frequency":2.3349203919,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":153271,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4389418964269264,"acs":33353,"articleLive":2,"columnArticles":399,"formTitle":"[460]LFU 缓存","frequency":2.8503736803,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":75985,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8119309110261744,"acs":167818,"articleLive":2,"columnArticles":1341,"formTitle":"[461]汉明距离","frequency":2.7764657796,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":206690,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6036537625054371,"acs":13878,"articleLive":2,"columnArticles":127,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":1.7829802886,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":22990,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7139595989713391,"acs":76625,"articleLive":2,"columnArticles":914,"formTitle":"[463]岛屿的周长","frequency":1.9305227639,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":107324,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3577880304113328,"acs":11012,"articleLive":2,"columnArticles":107,"formTitle":"[464]我能赢吗","frequency":1.5778244868,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":30778,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5330381471389646,"acs":1565,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"","submitted":2936,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.3738824516670432,"acs":11584,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.2852225711,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":30983,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44167906809667984,"acs":8607,"articleLive":2,"columnArticles":112,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.8052541061,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":19487,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.25033233122686466,"acs":24481,"articleLive":2,"columnArticles":295,"formTitle":"[468]验证IP地址","frequency":2.3568031032,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":97794,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.43322378249178367,"acs":1450,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":1.3483029692,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"","submitted":3347,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5467290944190638,"acs":62589,"articleLive":2,"columnArticles":333,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":2.1401320664,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":114479,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6175160811479465,"acs":1248,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":0.8052541061,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"","submitted":2021,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.40126917626763603,"acs":6513,"articleLive":2,"columnArticles":80,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":16231,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4201325854156043,"acs":20597,"articleLive":2,"columnArticles":177,"formTitle":"[473]火柴拼正方形","frequency":1.9642413999,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":49025,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6109127995920449,"acs":74276,"articleLive":2,"columnArticles":591,"formTitle":"[474]一和零","frequency":3.0065176432,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":121582,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.3326320487074049,"acs":20870,"articleLive":2,"columnArticles":233,"formTitle":"[475]供暖器","frequency":2.6035792098,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":62742,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7015603951504266,"acs":37497,"articleLive":2,"columnArticles":475,"formTitle":"[476]数字的补数","frequency":0.2032094194,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":53448,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6038103553109555,"acs":38729,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":2.2422615615,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":64141,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4380198551113496,"acs":6530,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":1.4003059508,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":14908,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.4154696132596685,"acs":3008,"articleLive":2,"columnArticles":25,"formTitle":"[479]最大回文数乘积","frequency":0.3791000859,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","submitted":7240,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.447981070147317,"acs":29345,"articleLive":2,"columnArticles":404,"formTitle":"[480]滑动窗口中位数","frequency":1.9642413999,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":65505,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5374242720343951,"acs":5500,"articleLive":2,"columnArticles":95,"formTitle":"[481]神奇字符串","frequency":0.229388925,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10234,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4262875464808176,"acs":19145,"articleLive":2,"columnArticles":223,"formTitle":"[482]密钥格式化","frequency":0.7449949145,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"","submitted":44911,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.590727356604644,"acs":15366,"articleLive":2,"columnArticles":116,"formTitle":"[483]最小好进制","frequency":1.6430366354,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":26012,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6401446654611211,"acs":1416,"articleLive":2,"columnArticles":34,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"","submitted":2212,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6067374074408072,"acs":121106,"articleLive":2,"columnArticles":980,"formTitle":"[485]最大连续 1 的个数","frequency":2.2721502179,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":199602,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5865551805257236,"acs":45878,"articleLive":2,"columnArticles":400,"formTitle":"[486]预测赢家","frequency":2.026373181,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":78216,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5761548064918851,"acs":5538,"articleLive":2,"columnArticles":106,"formTitle":"[487]最大连续1的个数 II","frequency":1.7829802886,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"","submitted":9612,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.38702031602708803,"acs":3429,"articleLive":2,"columnArticles":70,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":8860,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.71939477303989,"acs":1569,"articleLive":2,"columnArticles":23,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"","submitted":2181,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4819197896120973,"acs":6597,"articleLive":2,"columnArticles":77,"formTitle":"[490]迷宫","frequency":0.2566981044,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"","submitted":13689,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5467065304392862,"acs":46446,"articleLive":2,"columnArticles":388,"formTitle":"[491]递增子序列","frequency":2.4978817015,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":84956,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5520231213872833,"acs":19291,"articleLive":2,"columnArticles":178,"formTitle":"[492]构造矩形","frequency":0.1780824693,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":34946,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3452246675235422,"acs":26322,"articleLive":2,"columnArticles":266,"formTitle":"[493]翻转对","frequency":1.7133495366,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":76246,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.49455102164147535,"acs":147304,"articleLive":2,"columnArticles":1023,"formTitle":"[494]目标和","frequency":3.5201342719,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":297854,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5420022567215284,"acs":27860,"articleLive":2,"columnArticles":428,"formTitle":"[495]提莫攻击","frequency":1.3687326889,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":51402,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6874410143480462,"acs":100519,"articleLive":2,"columnArticles":1026,"formTitle":"[496]下一个更大元素 I","frequency":2.0657483463,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":146222,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.40552224236508155,"acs":2908,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.2566981044,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7171,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.46569637503406924,"acs":42716,"articleLive":2,"columnArticles":448,"formTitle":"[498]对角线遍历","frequency":2.4480073584,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":91725,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.37120456165359944,"acs":2604,"articleLive":2,"columnArticles":48,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"","submitted":7015,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.709327141818523,"acs":30245,"articleLive":2,"columnArticles":465,"formTitle":"[500]键盘行","frequency":0.7449949145,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":42639,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5121617863244468,"acs":64453,"articleLive":2,"columnArticles":535,"formTitle":"[501]二叉搜索树中的众数","frequency":2.1796629051,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":125845,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.44038944245835554,"acs":28949,"articleLive":2,"columnArticles":352,"formTitle":"[502]IPO","frequency":1.1040401347,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":65735,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6348341261814686,"acs":101689,"articleLive":2,"columnArticles":960,"formTitle":"[503]下一个更大元素 II","frequency":2.0804891792,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":160182,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5043228627699703,"acs":30216,"articleLive":2,"columnArticles":317,"formTitle":"[504]七进制数","frequency":0.7449949145,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":59914,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.48232631029078876,"acs":5540,"articleLive":2,"columnArticles":66,"formTitle":"[505]迷宫 II","frequency":0.7745391608,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"","submitted":11486,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5643434505647449,"acs":21085,"articleLive":2,"columnArticles":282,"formTitle":"[506]相对名次","frequency":0.7165434933,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":37362,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4119635779933804,"acs":29001,"articleLive":2,"columnArticles":227,"formTitle":"[507]完美数","frequency":0.8052541061,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":70397,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6762832521543649,"acs":14440,"articleLive":2,"columnArticles":204,"formTitle":"[508]出现次数最多的子树元素和","frequency":1.1040401347,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":21352,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6754003535812979,"acs":236097,"articleLive":2,"columnArticles":1442,"formTitle":"[509]斐波那契数","frequency":2.7867592313,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":349566,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6087038789025544,"acs":3217,"articleLive":2,"columnArticles":54,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.346310263,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"","submitted":5285,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7340592198026007,"acs":18742,"articleLive":2,"columnArticles":104,"formTitle":"[511]游戏玩法分析 I","frequency":1.9305227639,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"","submitted":25532,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5387125301131339,"acs":17666,"articleLive":2,"columnArticles":147,"formTitle":"[512]游戏玩法分析 II","frequency":0.229388925,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"","submitted":32793,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7308825925322512,"acs":49347,"articleLive":2,"columnArticles":557,"formTitle":"[513]找树左下角的值","frequency":0.229388925,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":67517,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5007463838986976,"acs":19456,"articleLive":2,"columnArticles":240,"formTitle":"[514]自由之路","frequency":2.3679365961,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":38854,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6439887524861121,"acs":37560,"articleLive":2,"columnArticles":414,"formTitle":"[515]在每个树行中找最大值","frequency":1.1349067827,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":58324,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.652775631317034,"acs":84477,"articleLive":2,"columnArticles":606,"formTitle":"[516]最长回文子序列","frequency":2.9887457164,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":129412,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.440946717966655,"acs":3782,"articleLive":2,"columnArticles":46,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"","submitted":8577,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6549469383192891,"acs":105472,"articleLive":2,"columnArticles":672,"formTitle":"[518]零钱兑换 II","frequency":3.3491611904,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":161039,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.3962546816479401,"acs":2645,"articleLive":2,"columnArticles":38,"formTitle":"[519]随机翻转矩阵","frequency":0.9053375646,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6675,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5636417961413693,"acs":39615,"articleLive":2,"columnArticles":637,"formTitle":"[520]检测大写字母","frequency":0.229388925,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":70284,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7132182281347297,"acs":25198,"articleLive":2,"columnArticles":250,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.229388925,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":35330,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.36001716922416566,"acs":6710,"articleLive":2,"columnArticles":105,"formTitle":"[522]最长特殊序列 II","frequency":0.7745391608,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":18638,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.27456058162867286,"acs":68278,"articleLive":2,"columnArticles":598,"formTitle":"[523]连续的子数组和","frequency":2.6712182378,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":248681,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.49444676118988046,"acs":71141,"articleLive":2,"columnArticles":747,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":1.5024876702,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":143880,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5360462466568321,"acs":44695,"articleLive":2,"columnArticles":512,"formTitle":"[525]连续数组","frequency":3.3527046232,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":83379,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7347116285293724,"acs":32943,"articleLive":2,"columnArticles":379,"formTitle":"[526]优美的排列","frequency":2.7690478983,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":44838,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.577259475218659,"acs":1980,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"","submitted":3430,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.47671602440295535,"acs":31100,"articleLive":2,"columnArticles":258,"formTitle":"[528]按权重随机选择","frequency":1.0343255021,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":65238,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6455972315615108,"acs":39364,"articleLive":2,"columnArticles":460,"formTitle":"[529]扫雷游戏","frequency":1.7829802886,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":60973,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6207073624751268,"acs":77360,"articleLive":2,"columnArticles":636,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.2032094194,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":124632,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6606167400881058,"acs":3749,"articleLive":2,"columnArticles":75,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"","submitted":5675,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.3737977028529085,"acs":25222,"articleLive":2,"columnArticles":275,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.7745391608,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":67475,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5229773462783172,"acs":1616,"articleLive":2,"columnArticles":33,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"","submitted":3090,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6754156999226605,"acs":13973,"articleLive":2,"columnArticles":138,"formTitle":"[534]游戏玩法分析 III","frequency":0.8052541061,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"","submitted":20688,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.841567107953934,"acs":15638,"articleLive":2,"columnArticles":101,"formTitle":"[535]TinyURL 的加密与解密","frequency":1.1040401347,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18582,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5351050457891902,"acs":2980,"articleLive":2,"columnArticles":46,"formTitle":"[536]从字符串生成二叉树","frequency":0.4496796987,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"","submitted":5569,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7127987188962799,"acs":11573,"articleLive":2,"columnArticles":171,"formTitle":"[537]复数乘法","frequency":0.2032094194,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16236,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.6985659612348197,"acs":107510,"articleLive":2,"columnArticles":823,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":1.4881587246,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":153901,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5967554040643742,"acs":13831,"articleLive":2,"columnArticles":180,"formTitle":"[539]最小时间差","frequency":1.6098374638,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":23177,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5821544990466818,"acs":37861,"articleLive":2,"columnArticles":393,"formTitle":"[540]有序数组中的单一元素","frequency":2.1796629051,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":65036,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6080059391746595,"acs":71251,"articleLive":2,"columnArticles":789,"formTitle":"[541]反转字符串 II","frequency":2.6379704946,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":117188,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45841840206887163,"acs":67360,"articleLive":2,"columnArticles":628,"formTitle":"[542]01 矩阵","frequency":2.1401320664,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":146940,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5512463607167513,"acs":146927,"articleLive":2,"columnArticles":1224,"formTitle":"[543]二叉树的直径","frequency":3.5921882784,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":266536,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7099189020586401,"acs":2276,"articleLive":2,"columnArticles":52,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"","submitted":3206,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.41812146545365136,"acs":3401,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"","submitted":8134,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6304750673854448,"acs":14970,"articleLive":2,"columnArticles":120,"formTitle":"[546]移除盒子","frequency":1.1669539601,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":23744,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.618337865725472,"acs":160301,"articleLive":2,"columnArticles":1115,"formTitle":"[547]省份数量","frequency":2.3395672405,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":259245,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3561458802341288,"acs":1582,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.5648391607,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"","submitted":4442,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.4854887392616671,"acs":2091,"articleLive":2,"columnArticles":52,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"","submitted":4307,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4392193242230706,"acs":12310,"articleLive":2,"columnArticles":176,"formTitle":"[550]游戏玩法分析 IV","frequency":1.1669539601,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"","submitted":28027,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.567289592672372,"acs":58466,"articleLive":2,"columnArticles":751,"formTitle":"[551]学生出勤记录 I","frequency":1.8665711172,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":103062,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.578361196709776,"acs":23836,"articleLive":2,"columnArticles":285,"formTitle":"[552]学生出勤记录 II","frequency":2.1729577707,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":41213,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6037363777893098,"acs":5817,"articleLive":2,"columnArticles":85,"formTitle":"[553]最优除法","frequency":0.229388925,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9635,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5023857912874437,"acs":45484,"articleLive":2,"columnArticles":487,"formTitle":"[554]砖墙","frequency":2.7941475176,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":90536,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.34258104738154616,"acs":1099,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"","submitted":3208,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32594385504558104,"acs":14409,"articleLive":2,"columnArticles":211,"formTitle":"[556]下一个更大元素 III","frequency":1.9642413999,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":44207,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7455965633560266,"acs":157596,"articleLive":2,"columnArticles":1282,"formTitle":"[557]反转字符串中的单词 III","frequency":2.9076903505,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":211369,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.504465067413763,"acs":2881,"articleLive":2,"columnArticles":36,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5711,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7278241641392477,"acs":60234,"articleLive":2,"columnArticles":547,"formTitle":"[559]N 叉树的最大深度","frequency":1.6098374638,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":82759,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.44629668259913957,"acs":147622,"articleLive":2,"columnArticles":905,"formTitle":"[560]和为 K 的子数组","frequency":4.0248774132,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":330771,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7743833033565327,"acs":89123,"articleLive":2,"columnArticles":739,"formTitle":"[561]数组拆分 I","frequency":0.6891144561,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":115089,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.46427697577685345,"acs":3795,"articleLive":2,"columnArticles":58,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"","submitted":8174,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6053499033834729,"acs":31954,"articleLive":2,"columnArticles":319,"formTitle":"[563]二叉树的坡度","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":52786,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17907823170981066,"acs":4379,"articleLive":2,"columnArticles":76,"formTitle":"[564]寻找最近的回文数","frequency":1.1349067827,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":24453,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6113955910432216,"acs":14089,"articleLive":2,"columnArticles":138,"formTitle":"[565]数组嵌套","frequency":1.1040401347,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":23044,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6920511738490516,"acs":67239,"articleLive":2,"columnArticles":624,"formTitle":"[566]重塑矩阵","frequency":1.7829802886,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":97159,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.43115124153498874,"acs":115364,"articleLive":2,"columnArticles":1043,"formTitle":"[567]字符串的排列","frequency":2.9207385523,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":267572,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5047660311958405,"acs":1165,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"","submitted":2308,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5630627979518569,"acs":9567,"articleLive":2,"columnArticles":152,"formTitle":"[569]员工薪水中位数","frequency":1.4330635473,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"","submitted":16991,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6617319325055715,"acs":12471,"articleLive":2,"columnArticles":110,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.229388925,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"","submitted":18846,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.48686824100640036,"acs":6618,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.229388925,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"","submitted":13593,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47327069310115094,"acs":82404,"articleLive":2,"columnArticles":723,"formTitle":"[572]另一棵树的子树","frequency":2.4048246206,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":174116,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6616492146596858,"acs":1011,"articleLive":2,"columnArticles":30,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"","submitted":1528,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6478242545569487,"acs":12297,"articleLive":2,"columnArticles":112,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"","submitted":18982,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6849733780319464,"acs":41682,"articleLive":2,"columnArticles":425,"formTitle":"[575]分糖果","frequency":1.3687326889,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":60852,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4691285407054758,"acs":25522,"articleLive":2,"columnArticles":276,"formTitle":"[576]出界的路径数","frequency":2.0590691871,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":54403,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7048000772648252,"acs":14595,"articleLive":2,"columnArticles":83,"formTitle":"[577]员工奖金","frequency":1.0742760328,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"","submitted":20708,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4966210987877225,"acs":9627,"articleLive":2,"columnArticles":112,"formTitle":"[578]查询回答率最高的问题","frequency":0.229388925,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"","submitted":19385,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.4111950098489823,"acs":7515,"articleLive":2,"columnArticles":128,"formTitle":"[579]查询员工的累计薪水","frequency":1.2349457052,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"","submitted":18276,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5234437939738976,"acs":9746,"articleLive":2,"columnArticles":79,"formTitle":"[580]统计各专业学生人数","frequency":0.8052541061,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"","submitted":18619,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.4044752850295885,"acs":97809,"articleLive":2,"columnArticles":849,"formTitle":"[581]最短无序连续子数组","frequency":3.0618670087,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":241817,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.4062441048858706,"acs":8614,"articleLive":2,"columnArticles":131,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"","submitted":21204,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.58863445294047,"acs":29407,"articleLive":2,"columnArticles":281,"formTitle":"[583]两个字符串的删除操作","frequency":2.2789225585,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":49958,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7740158849788393,"acs":13351,"articleLive":2,"columnArticles":59,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"","submitted":17249,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5952328727060028,"acs":8141,"articleLive":2,"columnArticles":98,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"","submitted":13677,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7475455076155602,"acs":14086,"articleLive":2,"columnArticles":87,"formTitle":"[586]订单最多的客户","frequency":1.1349067827,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"","submitted":18843,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3848129126925899,"acs":2098,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.4135624901,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5452,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.42501481920569056,"acs":1434,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":0.3791000859,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"","submitted":3374,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.745380279528264,"acs":87410,"articleLive":2,"columnArticles":560,"formTitle":"[589]N 叉树的前序遍历","frequency":1.9642413999,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":117269,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7606210355509663,"acs":61875,"articleLive":2,"columnArticles":452,"formTitle":"[590]N 叉树的后序遍历","frequency":0.1780824693,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":81348,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.34017822549399457,"acs":1756,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5162,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5220439691027926,"acs":4393,"articleLive":2,"columnArticles":106,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8415,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44169763559002534,"acs":8201,"articleLive":2,"columnArticles":132,"formTitle":"[593]有效的正方形","frequency":0.7449949145,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":18567,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5175032846781016,"acs":28753,"articleLive":2,"columnArticles":267,"formTitle":"[594]最长和谐子序列","frequency":0.2566981044,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":55561,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7966116271069832,"acs":101893,"articleLive":2,"columnArticles":235,"formTitle":"[595]大的国家","frequency":2.026373181,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":127908,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4207834665741602,"acs":80057,"articleLive":2,"columnArticles":279,"formTitle":"[596]超过5名学生的课","frequency":1.5469196787,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":190257,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.44137534803553274,"acs":9987,"articleLive":2,"columnArticles":79,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.7449949145,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"","submitted":22627,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.51777509856952,"acs":15890,"articleLive":2,"columnArticles":208,"formTitle":"[598]范围求和 II","frequency":0.7449949145,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":30689,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5219841750656312,"acs":28433,"articleLive":2,"columnArticles":267,"formTitle":"[599]两个列表的最小索引总和","frequency":0.7165434933,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":54471,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.4805563296430471,"acs":18969,"articleLive":2,"columnArticles":229,"formTitle":"[600]不含连续1的非负整数","frequency":1.4702517691,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":39473,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.4991724913633807,"acs":31066,"articleLive":2,"columnArticles":368,"formTitle":"[601]体育馆的人流量","frequency":2.5310310906,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":62235,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6276214018020891,"acs":7871,"articleLive":2,"columnArticles":87,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.7745391608,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"","submitted":12541,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6712126997981561,"acs":12304,"articleLive":2,"columnArticles":107,"formTitle":"[603]连续空余座位","frequency":1.1349067827,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"","submitted":18331,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37227877838684414,"acs":2377,"articleLive":2,"columnArticles":53,"formTitle":"[604]迭代压缩字符串","frequency":0.2852225711,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"","submitted":6385,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3340954141759445,"acs":107700,"articleLive":2,"columnArticles":1247,"formTitle":"[605]种花问题","frequency":2.4658434758,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":322363,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5689296463126426,"acs":28166,"articleLive":2,"columnArticles":308,"formTitle":"[606]根据二叉树创建字符串","frequency":0.2566981044,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":49507,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6635108481262327,"acs":11774,"articleLive":2,"columnArticles":84,"formTitle":"[607]销售员","frequency":0.2566981044,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"","submitted":17745,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6570794496227252,"acs":7402,"articleLive":2,"columnArticles":98,"formTitle":"[608]树节点","frequency":0.229388925,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"","submitted":11265,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4853607002716571,"acs":6432,"articleLive":2,"columnArticles":99,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13252,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6675404679205714,"acs":10186,"articleLive":2,"columnArticles":71,"formTitle":"[610]判断三角形","frequency":0.3150577195,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"","submitted":15259,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5318006269190033,"acs":49709,"articleLive":2,"columnArticles":386,"formTitle":"[611]有效三角形的个数","frequency":3.8003180746,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":93473,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6680014900353883,"acs":7173,"articleLive":2,"columnArticles":63,"formTitle":"[612]平面上的最近距离","frequency":0.2566981044,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"","submitted":10738,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.816676267281106,"acs":11342,"articleLive":2,"columnArticles":80,"formTitle":"[613]直线上的最近距离","frequency":0.229388925,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"","submitted":13888,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3465324778061,"acs":7885,"articleLive":2,"columnArticles":66,"formTitle":"[614]二级关注者","frequency":0.229388925,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"","submitted":22754,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.4250391494271821,"acs":5157,"articleLive":2,"columnArticles":90,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"","submitted":12133,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.45921934168365863,"acs":3153,"articleLive":2,"columnArticles":54,"formTitle":"[616]给字符串添加加粗标签","frequency":1.8164805182,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"","submitted":6866,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7880416885843928,"acs":184267,"articleLive":2,"columnArticles":1220,"formTitle":"[617]合并二叉树","frequency":3.2612593774,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":233829,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6194225721784777,"acs":4484,"articleLive":2,"columnArticles":45,"formTitle":"[618]学生地理信息报告","frequency":0.7745391608,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"","submitted":7239,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.46609811703115767,"acs":11040,"articleLive":2,"columnArticles":79,"formTitle":"[619]只出现一次的最大数字","frequency":0.229388925,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"","submitted":23686,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7731091023754467,"acs":91942,"articleLive":2,"columnArticles":307,"formTitle":"[620]有趣的电影","frequency":1.8979920144,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":118925,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.570046448229115,"acs":76950,"articleLive":2,"columnArticles":494,"formTitle":"[621]任务调度器","frequency":2.8849181037,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":134989,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4367516527600581,"acs":64016,"articleLive":2,"columnArticles":409,"formTitle":"[622]设计循环队列","frequency":1.9642413999,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":146573,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5457337024918197,"acs":10841,"articleLive":2,"columnArticles":185,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":19865,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4166342033502143,"acs":2139,"articleLive":2,"columnArticles":48,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"","submitted":5134,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.34100620261888354,"acs":2474,"articleLive":2,"columnArticles":54,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"","submitted":7255,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6833024317739538,"acs":44593,"articleLive":2,"columnArticles":344,"formTitle":"[626]换座位","frequency":1.5778244868,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":65261,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8077752537596687,"acs":84276,"articleLive":2,"columnArticles":332,"formTitle":"[627]变更性别","frequency":1.3687326889,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":104331,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5250261724599462,"acs":79238,"articleLive":2,"columnArticles":756,"formTitle":"[628]三个数的最大乘积","frequency":1.5778244868,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":150922,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.4039094444998504,"acs":4050,"articleLive":2,"columnArticles":57,"formTitle":"[629]K个逆序对数组","frequency":1.1669539601,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":10027,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.36732410950838973,"acs":6239,"articleLive":2,"columnArticles":74,"formTitle":"[630]课程表 III","frequency":0.2852225711,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":16985,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2856756756756757,"acs":1057,"articleLive":2,"columnArticles":34,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"","submitted":3700,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5977198697068404,"acs":18717,"articleLive":2,"columnArticles":238,"formTitle":"[632]最小区间","frequency":0.7745391608,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":31314,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39849379546427044,"acs":93128,"articleLive":2,"columnArticles":760,"formTitle":"[633]平方数之和","frequency":3.0022566968,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":233700,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.4395424836601307,"acs":1345,"articleLive":2,"columnArticles":20,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"","submitted":3060,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5535436412505305,"acs":3913,"articleLive":2,"columnArticles":65,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"","submitted":7069,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.55034632778064,"acs":9614,"articleLive":2,"columnArticles":111,"formTitle":"[636]函数的独占时间","frequency":0.229388925,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":17469,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6895983522142122,"acs":73656,"articleLive":2,"columnArticles":643,"formTitle":"[637]二叉树的层平均值","frequency":1.2803750284,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":106810,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5928215876342677,"acs":11314,"articleLive":2,"columnArticles":115,"formTitle":"[638]大礼包","frequency":0.2032094194,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":19085,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.31041605193272354,"acs":4208,"articleLive":2,"columnArticles":83,"formTitle":"[639]解码方法 II","frequency":1.4003059508,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"","submitted":13556,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4246857777249118,"acs":10711,"articleLive":2,"columnArticles":206,"formTitle":"[640]求解方程","frequency":1.0742760328,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25221,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5325084421148127,"acs":21131,"articleLive":2,"columnArticles":236,"formTitle":"[641]设计循环双端队列","frequency":0.7449949145,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":39682,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.48797390949857317,"acs":2394,"articleLive":2,"columnArticles":55,"formTitle":"[642]设计搜索自动补全系统","frequency":0.346310263,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"","submitted":4906,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4510558961672224,"acs":62902,"articleLive":2,"columnArticles":571,"formTitle":"[643]子数组最大平均数 I","frequency":1.5778244868,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":139455,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.3995718872636461,"acs":1120,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"","submitted":2803,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.43470250698873486,"acs":67954,"articleLive":2,"columnArticles":692,"formTitle":"[645]错误的集合","frequency":1.9642413999,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":156323,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5767599884115989,"acs":21899,"articleLive":2,"columnArticles":191,"formTitle":"[646]最长数对链","frequency":0.1780824693,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":37969,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6566600171913265,"acs":121467,"articleLive":2,"columnArticles":894,"formTitle":"[647]回文子串","frequency":2.6858265158,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":184977,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5838023678154546,"acs":21056,"articleLive":2,"columnArticles":274,"formTitle":"[648]单词替换","frequency":0.1780824693,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":36067,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.48176360037919735,"acs":28967,"articleLive":2,"columnArticles":307,"formTitle":"[649]Dota2 参议院","frequency":0.229388925,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":60127,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5659149368905905,"acs":47302,"articleLive":2,"columnArticles":634,"formTitle":"[650]只有两个键的键盘","frequency":1.0076057277,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":83585,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.581501256281407,"acs":3703,"articleLive":2,"columnArticles":63,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"","submitted":6368,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5713797322585289,"acs":31755,"articleLive":2,"columnArticles":228,"formTitle":"[652]寻找重复的子树","frequency":2.5703772035,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":55576,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5968481204797762,"acs":40107,"articleLive":2,"columnArticles":375,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":67198,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.809560856337089,"acs":58273,"articleLive":2,"columnArticles":592,"formTitle":"[654]最大二叉树","frequency":2.2104421414,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":71981,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5969299648225136,"acs":9333,"articleLive":2,"columnArticles":137,"formTitle":"[655]输出二叉树","frequency":0.7745391608,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15635,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.30763473053892215,"acs":822,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"","submitted":2672,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7834821857293768,"acs":81584,"articleLive":2,"columnArticles":616,"formTitle":"[657]机器人能否返回原点","frequency":0.2032094194,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":104130,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.454263431542461,"acs":26211,"articleLive":2,"columnArticles":236,"formTitle":"[658]找到 K 个最接近的元素","frequency":1.4670920091,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":57700,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5420379474573668,"acs":28225,"articleLive":2,"columnArticles":260,"formTitle":"[659]分割数组为连续子序列","frequency":0.1780824693,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":52072,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6517509727626459,"acs":670,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":0.6891144561,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"","submitted":1028,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5603486735989567,"acs":16328,"articleLive":2,"columnArticles":212,"formTitle":"[661]图片平滑器","frequency":0.229388925,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":29139,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4079264287278301,"acs":27945,"articleLive":2,"columnArticles":266,"formTitle":"[662]二叉树最大宽度","frequency":2.5072363066,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":68505,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4619710765934655,"acs":1725,"articleLive":2,"columnArticles":35,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"","submitted":3734,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6544765202853987,"acs":21923,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":2.5703772035,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33497,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.27045897636790994,"acs":74218,"articleLive":2,"columnArticles":927,"formTitle":"[665]非递减数列","frequency":2.3349203919,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":274415,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6181434599156118,"acs":2051,"articleLive":2,"columnArticles":75,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"","submitted":3318,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6243698802772527,"acs":7927,"articleLive":2,"columnArticles":118,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12696,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.507634164777022,"acs":6716,"articleLive":2,"columnArticles":66,"formTitle":"[668]乘法表中第k小的数","frequency":1.1349067827,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":13230,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6658846493121375,"acs":35479,"articleLive":2,"columnArticles":301,"formTitle":"[669]修剪二叉搜索树","frequency":0.7449949145,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":53281,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.45081411126187243,"acs":18606,"articleLive":2,"columnArticles":280,"formTitle":"[670]最大交换","frequency":2.7286122126,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":41272,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.4863222442535066,"acs":52978,"articleLive":2,"columnArticles":662,"formTitle":"[671]二叉树中第二小的节点","frequency":2.1084169347,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":108936,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5499771097207385,"acs":3604,"articleLive":2,"columnArticles":42,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.2032094194,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6553,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.43254307829942823,"acs":44481,"articleLive":2,"columnArticles":395,"formTitle":"[673]最长递增子序列的个数","frequency":2.0514214536,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":102836,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4948774111495796,"acs":91052,"articleLive":2,"columnArticles":754,"formTitle":"[674]最长连续递增序列","frequency":1.6601077226,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":183989,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.39952287398259895,"acs":2847,"articleLive":2,"columnArticles":47,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.2852225711,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7126,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.587127957262783,"acs":6924,"articleLive":2,"columnArticles":124,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":11793,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6166287591609806,"acs":14640,"articleLive":2,"columnArticles":244,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":23742,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.3851349518513495,"acs":42594,"articleLive":2,"columnArticles":465,"formTitle":"[678]有效的括号字符串","frequency":2.6621847527,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":110595,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.540959347187282,"acs":25589,"articleLive":2,"columnArticles":260,"formTitle":"[679]24 点游戏","frequency":3.3851848965,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":47303,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4014476326643872,"acs":85357,"articleLive":2,"columnArticles":809,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":2.0929535061,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":212623,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5008958789567988,"acs":2516,"articleLive":2,"columnArticles":60,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"","submitted":5023,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6953224154013181,"acs":45472,"articleLive":2,"columnArticles":508,"formTitle":"[682]棒球比赛","frequency":1.4003059508,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":65397,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4312036851592229,"acs":2153,"articleLive":2,"columnArticles":48,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"","submitted":4993,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6657564111208505,"acs":59243,"articleLive":2,"columnArticles":599,"formTitle":"[684]冗余连接","frequency":1.2528288714,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":88986,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.43172982951460526,"acs":19879,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":1.3687326889,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":46045,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.35509246767263747,"acs":17108,"articleLive":2,"columnArticles":192,"formTitle":"[686]重复叠加字符串匹配","frequency":0.229388925,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":48179,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.44083893481977654,"acs":37645,"articleLive":2,"columnArticles":267,"formTitle":"[687]最长同值路径","frequency":2.4870824604,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":85394,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5108205590622182,"acs":7931,"articleLive":2,"columnArticles":105,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.7745391608,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15526,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.4851455285778917,"acs":3217,"articleLive":2,"columnArticles":69,"formTitle":"[689]三个无重叠子数组的最大和","frequency":1.8164805182,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6631,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6472030543977022,"acs":55431,"articleLive":2,"columnArticles":562,"formTitle":"[690]员工的重要性","frequency":3.0147043447,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":85647,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.4906789092932666,"acs":3527,"articleLive":2,"columnArticles":46,"formTitle":"[691]贴纸拼词","frequency":0.2852225711,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7188,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5783448050102082,"acs":67136,"articleLive":2,"columnArticles":730,"formTitle":"[692]前K个高频单词","frequency":3.1340839609,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":116083,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6095348616900341,"acs":25737,"articleLive":2,"columnArticles":276,"formTitle":"[693]交替位二进制数","frequency":0.2032094194,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":42224,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5324255089658891,"acs":3949,"articleLive":2,"columnArticles":76,"formTitle":"[694]不同岛屿的数量","frequency":0.229388925,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"","submitted":7417,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6638541875666599,"acs":125730,"articleLive":2,"columnArticles":1254,"formTitle":"[695]岛屿的最大面积","frequency":3.051078952,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":189394,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6312384926966982,"acs":51427,"articleLive":2,"columnArticles":472,"formTitle":"[696]计数二进制子串","frequency":1.1040401347,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":81470,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6052802979570494,"acs":65981,"articleLive":2,"columnArticles":839,"formTitle":"[697]数组的度","frequency":0.7745391608,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":109009,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.4455049024873026,"acs":29034,"articleLive":2,"columnArticles":214,"formTitle":"[698]划分为k个相等的子集","frequency":2.7286122126,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":65171,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47604112214671546,"acs":2732,"articleLive":2,"columnArticles":41,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5739,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7594719043160931,"acs":79500,"articleLive":2,"columnArticles":502,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.9909253303,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":104678,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7235942119488326,"acs":74159,"articleLive":2,"columnArticles":554,"formTitle":"[701]二叉搜索树中的插入操作","frequency":1.4067600845,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":102487,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7400316177762164,"acs":4213,"articleLive":2,"columnArticles":76,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"","submitted":5693,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5125954888772144,"acs":59519,"articleLive":2,"columnArticles":539,"formTitle":"[703]数据流中的第 K 大元素","frequency":1.6098374638,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":116113,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5581789001690666,"acs":273367,"articleLive":2,"columnArticles":1368,"formTitle":"[704]二分查找","frequency":3.3212653787,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":489748,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6453945177028431,"acs":65878,"articleLive":2,"columnArticles":428,"formTitle":"[705]设计哈希集合","frequency":2.1401320664,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":102074,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6443936343264057,"acs":56648,"articleLive":2,"columnArticles":382,"formTitle":"[706]设计哈希映射","frequency":1.4330635473,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":87909,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3198570715266509,"acs":61497,"articleLive":2,"columnArticles":428,"formTitle":"[707]设计链表","frequency":2.7286122126,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":192264,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.3359253499222395,"acs":2160,"articleLive":2,"columnArticles":51,"formTitle":"[708]循环有序列表的插入","frequency":0.2852225711,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"","submitted":6430,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7590787544207711,"acs":70400,"articleLive":2,"columnArticles":506,"formTitle":"[709]转换成小写字母","frequency":0.229388925,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":92744,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3512671375155796,"acs":5073,"articleLive":2,"columnArticles":62,"formTitle":"[710]黑名单中的随机数","frequency":1.2002681668,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":14442,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5584935897435898,"acs":697,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"","submitted":1248,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6716240875912409,"acs":14722,"articleLive":2,"columnArticles":163,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.2566981044,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":21920,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4100752516053062,"acs":22288,"articleLive":2,"columnArticles":204,"formTitle":"[713]乘积小于K的子数组","frequency":1.8979920144,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":54351,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7199045430440163,"acs":97740,"articleLive":2,"columnArticles":656,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":2.2422615615,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":135768,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.4045936395759717,"acs":2519,"articleLive":2,"columnArticles":41,"formTitle":"[715]Range 模块","frequency":0.229388925,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6226,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4624435464701688,"acs":3891,"articleLive":2,"columnArticles":70,"formTitle":"[716]最大栈","frequency":0.8372261388,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"ac","submitted":8414,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5109284726177883,"acs":31394,"articleLive":2,"columnArticles":379,"formTitle":"[717]1比特与2比特字符","frequency":0.229388925,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":61445,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5646177958155674,"acs":82498,"articleLive":2,"columnArticles":574,"formTitle":"[718]最长重复子数组","frequency":3.1531981798,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":146113,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.36903656168200627,"acs":8741,"articleLive":2,"columnArticles":83,"formTitle":"[719]找出第 k 小的距离对","frequency":2.2069720845,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":23686,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48539109506618533,"acs":20168,"articleLive":2,"columnArticles":268,"formTitle":"[720]词典中最长的单词","frequency":0.2566981044,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":41550,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4691137706904173,"acs":28653,"articleLive":2,"columnArticles":335,"formTitle":"[721]账户合并","frequency":1.7506672996,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":61079,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3212663812118853,"acs":4952,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":1.8164805182,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15414,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7217787913340935,"acs":1266,"articleLive":2,"columnArticles":40,"formTitle":"[723]粉碎糖果","frequency":0.6009563694,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"","submitted":1754,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.46042093879758006,"acs":135390,"articleLive":2,"columnArticles":849,"formTitle":"[724]寻找数组的中心下标","frequency":1.6430366354,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":294057,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.5619842438693691,"acs":24040,"articleLive":2,"columnArticles":313,"formTitle":"[725]分隔链表","frequency":0.7449949145,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":42777,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5536020035266157,"acs":21663,"articleLive":2,"columnArticles":393,"formTitle":"[726]原子的数量","frequency":2.5226354406,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39131,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4081251794430089,"acs":2843,"articleLive":2,"columnArticles":48,"formTitle":"[727]最小窗口子序列","frequency":1.5024876702,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"","submitted":6966,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.759926860651482,"acs":33664,"articleLive":2,"columnArticles":307,"formTitle":"[728]自除数","frequency":0.229388925,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":44299,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.510934393638171,"acs":7967,"articleLive":2,"columnArticles":87,"formTitle":"[729]我的日程安排表 I","frequency":0.7745391608,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":15593,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4897134923640035,"acs":3880,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":1.8512545365,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":7923,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5073529411764706,"acs":3933,"articleLive":2,"columnArticles":40,"formTitle":"[731]我的日程安排表 II","frequency":0.229388925,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":7752,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6100571007552036,"acs":3312,"articleLive":2,"columnArticles":52,"formTitle":"[732]我的日程安排表 III","frequency":0.7449949145,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5429,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5803584531846199,"acs":63273,"articleLive":2,"columnArticles":538,"formTitle":"[733]图像渲染","frequency":2.1851847303,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":109024,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4787616990640749,"acs":1995,"articleLive":2,"columnArticles":37,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"","submitted":4167,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4051433928495334,"acs":19015,"articleLive":2,"columnArticles":247,"formTitle":"[735]行星碰撞","frequency":1.8782285253,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":46934,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.46096320670056834,"acs":1541,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3343,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4601941747572815,"acs":3792,"articleLive":2,"columnArticles":65,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"","submitted":8240,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5021444374405182,"acs":40627,"articleLive":2,"columnArticles":581,"formTitle":"[738]单调递增的数字","frequency":0.7745391608,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":80907,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6791209292921387,"acs":208247,"articleLive":2,"columnArticles":1490,"formTitle":"[739]每日温度","frequency":3.8110582108,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":306642,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6297456523700867,"acs":48850,"articleLive":2,"columnArticles":564,"formTitle":"[740]删除并获得点数","frequency":2.9996438191,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":77571,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3659586413399457,"acs":3911,"articleLive":2,"columnArticles":45,"formTitle":"[741]摘樱桃","frequency":1.1669539601,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10687,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.49164755977726826,"acs":1501,"articleLive":2,"columnArticles":43,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"","submitted":3053,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5194397063185998,"acs":56033,"articleLive":2,"columnArticles":515,"formTitle":"[743]网络延迟时间","frequency":2.3877397836,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":107872,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4592820559410382,"acs":40443,"articleLive":2,"columnArticles":362,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":1.2349457052,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":88057,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.3912741420036126,"acs":2816,"articleLive":2,"columnArticles":55,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7197,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5850478044131991,"acs":130155,"articleLive":2,"columnArticles":1260,"formTitle":"[746]使用最小花费爬楼梯","frequency":2.3395672405,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":222469,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4158142795214949,"acs":45083,"articleLive":2,"columnArticles":402,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.229388925,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":108421,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6004202501954652,"acs":12287,"articleLive":2,"columnArticles":172,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":20464,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5055619485999233,"acs":1318,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2607,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7210077806595035,"acs":1946,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.9053375646,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"","submitted":2699,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5027203482045702,"acs":1386,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"","submitted":2757,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.53074703976117,"acs":68624,"articleLive":2,"columnArticles":580,"formTitle":"[752]打开转盘锁","frequency":1.8979920144,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":129297,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5885543295305778,"acs":3147,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.2566981044,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5347,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.43001466514583675,"acs":7917,"articleLive":2,"columnArticles":92,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18411,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.49980537173997663,"acs":1284,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"","submitted":2569,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5666999750187359,"acs":4537,"articleLive":2,"columnArticles":67,"formTitle":"[756]金字塔转换矩阵","frequency":0.346310263,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8006,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4172323759791123,"acs":2397,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.4135624901,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5745,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4598356309650053,"acs":3469,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":0.5648391607,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"","submitted":7544,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6585098612125639,"acs":1803,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":0.3150577195,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"","submitted":2738,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8390977443609022,"acs":3906,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"","submitted":4655,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5887211620620906,"acs":2067,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":0.4135624901,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3511,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.6992570815621151,"acs":17601,"articleLive":2,"columnArticles":138,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":25171,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7627799566764956,"acs":79934,"articleLive":2,"columnArticles":962,"formTitle":"[763]划分字母区间","frequency":3.1531981798,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":104793,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4953136265320836,"acs":4122,"articleLive":2,"columnArticles":53,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8322,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6653609530173507,"acs":28876,"articleLive":2,"columnArticles":440,"formTitle":"[765]情侣牵手","frequency":2.5703772035,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":43399,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7082053077152451,"acs":54626,"articleLive":2,"columnArticles":631,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":77133,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.4779220779220779,"acs":39744,"articleLive":2,"columnArticles":496,"formTitle":"[767]重构字符串","frequency":1.8164805182,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":83160,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5040610627262941,"acs":5151,"articleLive":2,"columnArticles":79,"formTitle":"[768]最多能完成排序的块 II","frequency":0.7745391608,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10219,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5874129256965944,"acs":12143,"articleLive":2,"columnArticles":140,"formTitle":"[769]最多能完成排序的块","frequency":0.229388925,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":20672,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5530910806984427,"acs":1172,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2119,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8515941607146855,"acs":152139,"articleLive":2,"columnArticles":1109,"formTitle":"[771]宝石与石头","frequency":1.9305227639,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":178652,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4906776180698152,"acs":5974,"articleLive":2,"columnArticles":121,"formTitle":"[772]基本计算器 III","frequency":0.2852225711,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"","submitted":12175,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.713548267441501,"acs":23084,"articleLive":2,"columnArticles":327,"formTitle":"[773]滑动谜题","frequency":2.4744751326,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":32351,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5906593406593407,"acs":1075,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.6009563694,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"","submitted":1820,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4604804694663488,"acs":5022,"articleLive":2,"columnArticles":77,"formTitle":"[775]全局倒置与局部倒置","frequency":0.2852225711,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":10906,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5686084142394822,"acs":1757,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"","submitted":3090,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.32342289719626166,"acs":5537,"articleLive":2,"columnArticles":60,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.7745391608,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17120,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5952502553626149,"acs":23310,"articleLive":2,"columnArticles":346,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.3150577195,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":39160,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.43629701776355456,"acs":18814,"articleLive":2,"columnArticles":231,"formTitle":"[779]第K个语法符号","frequency":1.6430366354,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43122,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2856371004052229,"acs":3172,"articleLive":2,"columnArticles":49,"formTitle":"[780]到达终点","frequency":0.8705514485,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11105,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6187017046276734,"acs":42756,"articleLive":2,"columnArticles":653,"formTitle":"[781]森林中的兔子","frequency":4.338528768,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":69106,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4219025249559601,"acs":1437,"articleLive":2,"columnArticles":29,"formTitle":"[782]变为棋盘","frequency":1.5778244868,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3406,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5958110670574039,"acs":69126,"articleLive":2,"columnArticles":666,"formTitle":"[783]二叉搜索树节点最小距离","frequency":1.5778244868,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":116020,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6860246500940046,"acs":42692,"articleLive":2,"columnArticles":471,"formTitle":"[784]字母大小写全排列","frequency":1.3088345473,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":62231,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5119829073030092,"acs":39778,"articleLive":2,"columnArticles":403,"formTitle":"[785]判断二分图","frequency":2.0590691871,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":77694,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.46900056465273854,"acs":4153,"articleLive":2,"columnArticles":57,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":8855,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3915983934231938,"acs":41632,"articleLive":2,"columnArticles":394,"formTitle":"[787]K 站中转内最便宜的航班","frequency":1.4922290656,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":106313,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.607420389537383,"acs":18369,"articleLive":2,"columnArticles":190,"formTitle":"[788]旋转数字","frequency":0.7745391608,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30241,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6922106381565841,"acs":20848,"articleLive":2,"columnArticles":294,"formTitle":"[789]逃脱阻碍者","frequency":1.9060177396,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30118,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4490539428840052,"acs":3821,"articleLive":2,"columnArticles":63,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.229388925,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8509,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6948100322820958,"acs":11192,"articleLive":2,"columnArticles":200,"formTitle":"[791]自定义字符串排序","frequency":1.4003059508,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16108,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.45195729537366547,"acs":8509,"articleLive":2,"columnArticles":96,"formTitle":"[792]匹配子序列的单词数","frequency":0.7165434933,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":18827,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3944902698806759,"acs":4926,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":12487,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3407202216066482,"acs":7257,"articleLive":2,"columnArticles":101,"formTitle":"[794]有效的井字游戏","frequency":0.2032094194,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21299,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5353370135623253,"acs":7855,"articleLive":2,"columnArticles":87,"formTitle":"[795]区间子数组个数","frequency":0.8372261388,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":14673,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5278425989476092,"acs":23072,"articleLive":2,"columnArticles":271,"formTitle":"[796]旋转字符串","frequency":2.2422615615,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":43710,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7937062937062938,"acs":41995,"articleLive":2,"columnArticles":518,"formTitle":"[797]所有可能的路径","frequency":1.1464193577,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":52910,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.46303901437371664,"acs":1353,"articleLive":2,"columnArticles":33,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2922,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.40774397471355195,"acs":5160,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":2.3349203919,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":12655,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7056491575817642,"acs":1424,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"","submitted":2018,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.41922062701435686,"acs":7154,"articleLive":2,"columnArticles":86,"formTitle":"[801]使序列递增的最小交换次数","frequency":1.1349067827,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17065,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5763804767140648,"acs":30928,"articleLive":2,"columnArticles":333,"formTitle":"[802]找到最终的安全状态","frequency":2.1729577707,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":53659,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4824488503700186,"acs":12191,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25269,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7705853610866803,"acs":39427,"articleLive":2,"columnArticles":395,"formTitle":"[804]唯一摩尔斯密码词","frequency":1.1040401347,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":51165,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.29075384788226044,"acs":2588,"articleLive":2,"columnArticles":40,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":8901,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.656757965899488,"acs":13212,"articleLive":2,"columnArticles":149,"formTitle":"[806]写字符串需要的行数","frequency":0.7745391608,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":20117,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8443845835060091,"acs":16300,"articleLive":2,"columnArticles":214,"formTitle":"[807]保持城市天际线","frequency":0.2032094194,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":19304,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.48038998448925324,"acs":4336,"articleLive":2,"columnArticles":41,"formTitle":"[808]分汤","frequency":1.4003059508,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9026,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4191716183152744,"acs":4797,"articleLive":2,"columnArticles":89,"formTitle":"[809]情感丰富的文字","frequency":0.7745391608,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11444,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.734636747389469,"acs":16533,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":1.9642413999,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22505,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7040283391616331,"acs":15502,"articleLive":2,"columnArticles":197,"formTitle":"[811]子域名访问计数","frequency":0.7745391608,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22019,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6303317535545023,"acs":10640,"articleLive":2,"columnArticles":97,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":16880,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5486189630108221,"acs":6793,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":0.229388925,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":12382,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6995594986971089,"acs":22551,"articleLive":2,"columnArticles":345,"formTitle":"[814]二叉树剪枝","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":32236,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4341117050933062,"acs":26473,"articleLive":2,"columnArticles":314,"formTitle":"[815]公交路线","frequency":3.4187768027,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":60982,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.509288824383164,"acs":3509,"articleLive":2,"columnArticles":63,"formTitle":"[816]模糊坐标","frequency":0.3791000859,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":6890,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5911680282623095,"acs":13387,"articleLive":2,"columnArticles":165,"formTitle":"[817]链表组件","frequency":0.229388925,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22645,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.43035843156122205,"acs":3578,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8314,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42111339399276,"acs":21521,"articleLive":2,"columnArticles":245,"formTitle":"[819]最常见的单词","frequency":0.7745391608,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":51105,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.506960395026828,"acs":54517,"articleLive":2,"columnArticles":600,"formTitle":"[820]单词的压缩编码","frequency":1.6430366354,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":107537,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.692653715313897,"acs":24637,"articleLive":2,"columnArticles":332,"formTitle":"[821]字符的最短距离","frequency":1.6098374638,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":35569,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5019656897784132,"acs":2809,"articleLive":2,"columnArticles":39,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5596,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4294978133011612,"acs":2848,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":0.8705514485,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6631,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6146303559535262,"acs":16611,"articleLive":2,"columnArticles":238,"formTitle":"[824]山羊拉丁文","frequency":0.229388925,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":27026,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.39179127065803016,"acs":6472,"articleLive":2,"columnArticles":90,"formTitle":"[825]适龄的朋友","frequency":0.2566981044,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":16519,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3733048532114649,"acs":7515,"articleLive":2,"columnArticles":110,"formTitle":"[826]安排工作以达到最大收益","frequency":0.7745391608,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":20131,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3903185730765818,"acs":8797,"articleLive":2,"columnArticles":177,"formTitle":"[827]最大人工岛","frequency":1.3687326889,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":22538,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4932005060088552,"acs":3119,"articleLive":2,"columnArticles":53,"formTitle":"[828]统计子串中的唯一字符","frequency":0.2852225711,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6324,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.36322541759944893,"acs":8437,"articleLive":2,"columnArticles":98,"formTitle":"[829]连续整数求和","frequency":1.3687326889,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":23228,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5430649885055058,"acs":51734,"articleLive":2,"columnArticles":581,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":95263,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.40444590092304333,"acs":7405,"articleLive":2,"columnArticles":72,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18309,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7956592269396431,"acs":85344,"articleLive":2,"columnArticles":914,"formTitle":"[832]翻转图像","frequency":2.1401320664,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":107262,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4278442351743446,"acs":5043,"articleLive":2,"columnArticles":76,"formTitle":"[833]字符串中的查找与替换","frequency":0.2566981044,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":11787,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.528981764729252,"acs":13315,"articleLive":2,"columnArticles":130,"formTitle":"[834]树中距离之和","frequency":0.9417052088,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25171,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5727039091032058,"acs":4234,"articleLive":2,"columnArticles":48,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7393,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.47819897919926135,"acs":37289,"articleLive":2,"columnArticles":654,"formTitle":"[836]矩形重叠","frequency":1.2002681668,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":77978,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.3962105349591493,"acs":19301,"articleLive":2,"columnArticles":242,"formTitle":"[837]新21点","frequency":0.7745391608,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":48714,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5004995004995005,"acs":7014,"articleLive":2,"columnArticles":123,"formTitle":"[838]推多米诺","frequency":1.6430366354,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":14014,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5745290992513885,"acs":19033,"articleLive":2,"columnArticles":267,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33128,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.35904137681450804,"acs":8929,"articleLive":2,"columnArticles":112,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":24869,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6569144473476041,"acs":54809,"articleLive":2,"columnArticles":540,"formTitle":"[841]钥匙和房间","frequency":1.1349067827,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":83434,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48898983944238306,"acs":28202,"articleLive":2,"columnArticles":320,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":2.026373181,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":57674,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3782361899487747,"acs":2732,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.3150577195,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7223,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5138960885956645,"acs":87239,"articleLive":2,"columnArticles":966,"formTitle":"[844]比较含退格的字符串","frequency":1.3687326889,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":169760,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4211981046931408,"acs":37335,"articleLive":2,"columnArticles":553,"formTitle":"[845]数组中的最长山脉","frequency":1.8164805182,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":88640,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5109065917647762,"acs":8549,"articleLive":2,"columnArticles":119,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":16733,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6828388426709858,"acs":18550,"articleLive":2,"columnArticles":157,"formTitle":"[847]访问所有节点的最短路径","frequency":2.7345706405,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27166,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44792719919110213,"acs":8860,"articleLive":2,"columnArticles":94,"formTitle":"[848]字母移位","frequency":0.7745391608,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":19780,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.4260675246351839,"acs":15825,"articleLive":2,"columnArticles":185,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":37142,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4480955937266617,"acs":2400,"articleLive":2,"columnArticles":41,"formTitle":"[850]矩形面积 II","frequency":1.2710942194,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5356,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4791856232939036,"acs":4213,"articleLive":2,"columnArticles":71,"formTitle":"[851]喧闹和富有","frequency":0.2566981044,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":8792,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7147972482160406,"acs":83642,"articleLive":2,"columnArticles":719,"formTitle":"[852]山脉数组的峰顶索引","frequency":2.8286603011,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":117015,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38272734202302006,"acs":10042,"articleLive":2,"columnArticles":123,"formTitle":"[853]车队","frequency":1.4670920091,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":26238,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.35896583257128606,"acs":4318,"articleLive":2,"columnArticles":67,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12029,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4066795911173775,"acs":4615,"articleLive":2,"columnArticles":56,"formTitle":"[855]考场就座","frequency":0.7165434933,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":11348,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6264521894548705,"acs":16123,"articleLive":2,"columnArticles":217,"formTitle":"[856]括号的分数","frequency":2.0929535061,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":25737,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46631066436312235,"acs":2969,"articleLive":2,"columnArticles":47,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.3150577195,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6367,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5540514027859526,"acs":2824,"articleLive":2,"columnArticles":48,"formTitle":"[858]镜面反射","frequency":1.4670920091,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5097,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3020369783181535,"acs":27624,"articleLive":2,"columnArticles":362,"formTitle":"[859]亲密字符串","frequency":0.229388925,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":91459,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5874537616094951,"acs":88299,"articleLive":2,"columnArticles":762,"formTitle":"[860]柠檬水找零","frequency":1.045543928,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":150308,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8089876033057851,"acs":31324,"articleLive":2,"columnArticles":439,"formTitle":"[861]翻转矩阵后的得分","frequency":0.1780824693,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":38720,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.19054571565342268,"acs":15922,"articleLive":2,"columnArticles":128,"formTitle":"[862]和至少为 K 的最短子数组","frequency":2.3447052058,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":83560,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6037653924310055,"acs":34763,"articleLive":2,"columnArticles":560,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":2.6736376134,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":57577,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45442052221713236,"acs":2976,"articleLive":2,"columnArticles":44,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6549,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6555357672899971,"acs":8834,"articleLive":2,"columnArticles":127,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13476,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22421186133591015,"acs":7425,"articleLive":2,"columnArticles":83,"formTitle":"[866]回文素数","frequency":0.8372261388,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":33116,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6703893096627913,"acs":83379,"articleLive":2,"columnArticles":751,"formTitle":"[867]转置矩阵","frequency":1.4003059508,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":124374,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6240491176584161,"acs":16161,"articleLive":2,"columnArticles":234,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":25897,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5515209290233123,"acs":6364,"articleLive":2,"columnArticles":95,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.229388925,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11539,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.42772539776075424,"acs":14517,"articleLive":2,"columnArticles":184,"formTitle":"[870]优势洗牌","frequency":0.229388925,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":33940,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.341144013242597,"acs":9274,"articleLive":2,"columnArticles":122,"formTitle":"[871]最低加油次数","frequency":1.9992344734,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":27185,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6517836818314852,"acs":60129,"articleLive":2,"columnArticles":718,"formTitle":"[872]叶子相似的树","frequency":2.5747383094,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":92253,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5091456118157885,"acs":14892,"articleLive":2,"columnArticles":109,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":1.9305227639,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":29249,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41437308868501527,"acs":20325,"articleLive":2,"columnArticles":223,"formTitle":"[874]模拟行走机器人","frequency":1.7506672996,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","questionId":"906","status":"","submitted":49050,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.4788392308367723,"acs":43628,"articleLive":2,"columnArticles":345,"formTitle":"[875]爱吃香蕉的珂珂","frequency":1.8665711172,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":91112,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.705782099438978,"acs":146183,"articleLive":2,"columnArticles":1598,"formTitle":"[876]链表的中间结点","frequency":2.2864285986,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":207122,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7569930854885057,"acs":67439,"articleLive":2,"columnArticles":479,"formTitle":"[877]石子游戏","frequency":2.9207385523,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":89088,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2803527745590318,"acs":4355,"articleLive":2,"columnArticles":62,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15534,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5548628428927681,"acs":21360,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":2.9381788269,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":38496,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2519899544545184,"acs":5920,"articleLive":2,"columnArticles":76,"formTitle":"[880]索引处的解码字符串","frequency":0.2032094194,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23493,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5379194630872484,"acs":46487,"articleLive":2,"columnArticles":571,"formTitle":"[881]救生艇","frequency":1.9980055795,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":86420,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4881623449830891,"acs":1732,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3548,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6877287613176651,"acs":10710,"articleLive":2,"columnArticles":108,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15573,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6612053832650673,"acs":19210,"articleLive":2,"columnArticles":249,"formTitle":"[884]两句话中的不常见单词","frequency":0.8372261388,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":29053,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6901152213462705,"acs":4552,"articleLive":2,"columnArticles":68,"formTitle":"[885]螺旋矩阵 III","frequency":1.4003059508,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6596,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4239036973344798,"acs":8381,"articleLive":2,"columnArticles":111,"formTitle":"[886]可能的二分法","frequency":0.2566981044,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":19771,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.291678885841283,"acs":50725,"articleLive":2,"columnArticles":334,"formTitle":"[887]鸡蛋掉落","frequency":3.0022566968,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":173907,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6399469709523923,"acs":54064,"articleLive":2,"columnArticles":453,"formTitle":"[888]公平的糖果棒交换","frequency":0.229388925,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":84482,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6771833767166323,"acs":15089,"articleLive":2,"columnArticles":146,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":2.0590691871,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":22282,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7267044507417904,"acs":8719,"articleLive":2,"columnArticles":121,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":11998,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.33002104278700023,"acs":2823,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8554,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6385674400693174,"acs":33164,"articleLive":2,"columnArticles":681,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":51935,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7242522668832048,"acs":10703,"articleLive":2,"columnArticles":104,"formTitle":"[893]特殊等价字符串组","frequency":0.2852225711,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14778,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7744617224880382,"acs":12949,"articleLive":2,"columnArticles":121,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":16720,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5426147625465789,"acs":6844,"articleLive":2,"columnArticles":80,"formTitle":"[895]最大频率栈","frequency":1.4003059508,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":12613,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.586466463686763,"acs":59134,"articleLive":2,"columnArticles":715,"formTitle":"[896]单调数列","frequency":0.2852225711,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":100831,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7445847176079734,"acs":61633,"articleLive":2,"columnArticles":702,"formTitle":"[897]递增顺序搜索树","frequency":2.6379704946,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":82775,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3370651486401012,"acs":5329,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":1.4670920091,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15810,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5366421093447072,"acs":4152,"articleLive":2,"columnArticles":45,"formTitle":"[899]有序队列","frequency":0.2566981044,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7737,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.49255065554231225,"acs":3306,"articleLive":2,"columnArticles":45,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6712,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5441680583633647,"acs":18573,"articleLive":2,"columnArticles":226,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":34131,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.32792955068547985,"acs":3277,"articleLive":2,"columnArticles":74,"formTitle":"[902]最大为 N 的数字组合","frequency":0.8705514485,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":9993,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5300676293182234,"acs":2900,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.5648391607,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5471,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4530833606059189,"acs":19382,"articleLive":2,"columnArticles":265,"formTitle":"[904]水果成篮","frequency":1.7829802886,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":42778,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7010618454898997,"acs":57506,"articleLive":2,"columnArticles":596,"formTitle":"[905]按奇偶排序数组","frequency":1.1040401347,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":82027,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2756319774156294,"acs":2148,"articleLive":2,"columnArticles":38,"formTitle":"[906]超级回文数","frequency":1.5778244868,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7793,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3167843967169045,"acs":11077,"articleLive":2,"columnArticles":125,"formTitle":"[907]子数组的最小值之和","frequency":1.6775085444,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":34967,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.698265306122449,"acs":20529,"articleLive":2,"columnArticles":188,"formTitle":"[908]最小差值 I","frequency":0.229388925,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":29400,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.45926894434654086,"acs":16158,"articleLive":2,"columnArticles":192,"formTitle":"[909]蛇梯棋","frequency":1.887398695,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35182,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.31820174370464177,"acs":6533,"articleLive":2,"columnArticles":69,"formTitle":"[910]最小差值 II","frequency":0.229388925,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20531,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4251960879248572,"acs":4391,"articleLive":2,"columnArticles":67,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":10327,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5618394773280141,"acs":221953,"articleLive":2,"columnArticles":1027,"formTitle":"[912]排序数组","frequency":4.1069657255,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":395047,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.4043927648578811,"acs":1878,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":0.4135624901,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4644,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3888202421855693,"acs":48774,"articleLive":2,"columnArticles":613,"formTitle":"[914]卡牌分组","frequency":0.8052541061,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":125441,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46808402935965576,"acs":9247,"articleLive":2,"columnArticles":114,"formTitle":"[915]分割数组","frequency":0.7449949145,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":19755,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4409707651419779,"acs":6305,"articleLive":2,"columnArticles":71,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14298,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5704470052415634,"acs":29058,"articleLive":2,"columnArticles":434,"formTitle":"[917]仅仅反转字母","frequency":1.1349067827,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":50939,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.35746555650972633,"acs":19148,"articleLive":2,"columnArticles":215,"formTitle":"[918]环形子数组的最大和","frequency":1.8512545365,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":53566,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6297330097087379,"acs":5189,"articleLive":2,"columnArticles":95,"formTitle":"[919]完全二叉树插入器","frequency":0.2852225711,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8240,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.48186119873817035,"acs":1833,"articleLive":2,"columnArticles":20,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3804,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7364078016717868,"acs":20615,"articleLive":2,"columnArticles":301,"formTitle":"[921]使括号有效的最少添加","frequency":0.2032094194,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":27994,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7141031682013849,"acs":89415,"articleLive":2,"columnArticles":821,"formTitle":"[922]按奇偶排序数组 II","frequency":1.1669539601,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":125213,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.33794618341570565,"acs":6154,"articleLive":2,"columnArticles":82,"formTitle":"[923]三数之和的多种可能","frequency":0.8052541061,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18210,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3595446584938704,"acs":6159,"articleLive":2,"columnArticles":92,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":17130,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3878068055039048,"acs":50055,"articleLive":2,"columnArticles":670,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":129072,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5187068075303837,"acs":6530,"articleLive":2,"columnArticles":120,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.8052541061,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":12589,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.33907875185735514,"acs":3423,"articleLive":2,"columnArticles":69,"formTitle":"[927]三等分","frequency":1.6775085444,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10095,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4196085955487337,"acs":2187,"articleLive":2,"columnArticles":42,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5212,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6433371370609864,"acs":25370,"articleLive":2,"columnArticles":229,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":39435,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5451294637777742,"acs":33538,"articleLive":2,"columnArticles":338,"formTitle":"[930]和相同的二元子数组","frequency":2.6009840302,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":61523,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.662276417287028,"acs":19661,"articleLive":2,"columnArticles":253,"formTitle":"[931]下降路径最小和","frequency":1.045543928,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":29687,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6299002816472559,"acs":8275,"articleLive":2,"columnArticles":80,"formTitle":"[932]漂亮数组","frequency":0.2032094194,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13137,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.724968730135947,"acs":35356,"articleLive":2,"columnArticles":301,"formTitle":"[933]最近的请求次数","frequency":1.6098374638,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":48769,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47496325736405226,"acs":22945,"articleLive":2,"columnArticles":259,"formTitle":"[934]最短的桥","frequency":1.6098374638,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":48309,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4746004114575091,"acs":5998,"articleLive":2,"columnArticles":80,"formTitle":"[935]骑士拨号器","frequency":0.2566981044,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12638,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.3793018073780639,"acs":1532,"articleLive":2,"columnArticles":25,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4039,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5874370104275807,"acs":11774,"articleLive":2,"columnArticles":125,"formTitle":"[937]重新排列日志文件","frequency":0.8052541061,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":20043,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8184559710494572,"acs":96347,"articleLive":2,"columnArticles":794,"formTitle":"[938]二叉搜索树的范围和","frequency":2.2751917678,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":117718,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.45134171195652173,"acs":5315,"articleLive":2,"columnArticles":62,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":11776,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.41976575190219717,"acs":4910,"articleLive":2,"columnArticles":65,"formTitle":"[940]不同的子序列 II","frequency":0.2032094194,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":11697,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3924096546545591,"acs":61666,"articleLive":2,"columnArticles":611,"formTitle":"[941]有效的山脉数组","frequency":0.229388925,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":157147,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7299618009076365,"acs":22358,"articleLive":2,"columnArticles":211,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":30629,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.47077082255561303,"acs":1820,"articleLive":2,"columnArticles":41,"formTitle":"[943]最短超级串","frequency":0.4857969074,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":3866,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6893448524118071,"acs":21065,"articleLive":2,"columnArticles":180,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30558,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.48618936753502595,"acs":35292,"articleLive":2,"columnArticles":536,"formTitle":"[945]使数组唯一的最小增量","frequency":0.8052541061,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":72589,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.623004683895323,"acs":26735,"articleLive":2,"columnArticles":294,"formTitle":"[946]验证栈序列","frequency":2.3349203919,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":42913,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6127022481226163,"acs":25864,"articleLive":2,"columnArticles":334,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":42213,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3913776073441404,"acs":6736,"articleLive":2,"columnArticles":96,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17211,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.37071790957661743,"acs":8257,"articleLive":2,"columnArticles":116,"formTitle":"[949]给定数字能组成的最大时间","frequency":1.7829802886,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":22273,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.77344,"acs":9668,"articleLive":2,"columnArticles":143,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.8052541061,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12500,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.663542300669507,"acs":10902,"articleLive":2,"columnArticles":164,"formTitle":"[951]翻转等价二叉树","frequency":0.8372261388,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":16430,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3494874184529357,"acs":3000,"articleLive":2,"columnArticles":56,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8584,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5527736071095241,"acs":13622,"articleLive":2,"columnArticles":164,"formTitle":"[953]验证外星语词典","frequency":1.1040401347,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":24643,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.29988784401690965,"acs":6952,"articleLive":2,"columnArticles":103,"formTitle":"[954]二倍数对数组","frequency":1.4003059508,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":23182,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.329447278026439,"acs":3165,"articleLive":2,"columnArticles":49,"formTitle":"[955]删列造序 II","frequency":0.346310263,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9607,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4364374245914226,"acs":3979,"articleLive":2,"columnArticles":51,"formTitle":"[956]最高的广告牌","frequency":0.2566981044,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9117,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.35974259974259976,"acs":13976,"articleLive":2,"columnArticles":139,"formTitle":"[957]N 天后的牢房","frequency":1.4003059508,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":38850,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5360703159768581,"acs":24091,"articleLive":2,"columnArticles":220,"formTitle":"[958]二叉树的完全性检验","frequency":1.5469196787,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":44940,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7432057470827473,"acs":19553,"articleLive":2,"columnArticles":304,"formTitle":"[959]由斜杠划分区域","frequency":1.2349457052,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26309,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.553041018387553,"acs":1955,"articleLive":2,"columnArticles":33,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3535,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6762910011541755,"acs":36329,"articleLive":2,"columnArticles":297,"formTitle":"[961]重复 N 次的元素","frequency":0.8052541061,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":53718,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4412404970025788,"acs":13175,"articleLive":2,"columnArticles":126,"formTitle":"[962]最大宽度坡","frequency":0.8052541061,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":29859,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5016064257028112,"acs":2498,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":4980,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4267669172932331,"acs":1419,"articleLive":2,"columnArticles":26,"formTitle":"[964]表示数字的最少运算符","frequency":0.637073578,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3325,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6837472492926753,"acs":32625,"articleLive":2,"columnArticles":384,"formTitle":"[965]单值二叉树","frequency":0.229388925,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":47715,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.4015716568993074,"acs":3015,"articleLive":2,"columnArticles":49,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7508,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.4623235348041313,"acs":7565,"articleLive":2,"columnArticles":148,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16363,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4979812940006898,"acs":24545,"articleLive":2,"columnArticles":323,"formTitle":"[968]监控二叉树","frequency":1.8979920144,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":49289,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6528929206996832,"acs":15042,"articleLive":2,"columnArticles":195,"formTitle":"[969]煎饼排序","frequency":0.2032094194,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":23039,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4142873350225012,"acs":10955,"articleLive":2,"columnArticles":124,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26443,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4415012488497437,"acs":6717,"articleLive":2,"columnArticles":103,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.2852225711,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15214,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4103225806451613,"acs":1272,"articleLive":2,"columnArticles":27,"formTitle":"[972]相等的有理数","frequency":0.637073578,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3100,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6399758488830108,"acs":66777,"articleLive":2,"columnArticles":635,"formTitle":"[973]最接近原点的 K 个点","frequency":0.2032094194,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":104343,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.46584854682726057,"acs":36898,"articleLive":2,"columnArticles":384,"formTitle":"[974]和可被 K 整除的子数组","frequency":2.6035792098,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":79206,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4459419865221213,"acs":3044,"articleLive":2,"columnArticles":45,"formTitle":"[975]奇偶跳","frequency":0.2852225711,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6826,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5973356976117795,"acs":53225,"articleLive":2,"columnArticles":496,"formTitle":"[976]三角形的最大周长","frequency":0.7745391608,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":89104,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7123662035982692,"acs":162656,"articleLive":2,"columnArticles":1275,"formTitle":"[977]有序数组的平方","frequency":2.4958475266,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":228332,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4734361233480176,"acs":42988,"articleLive":2,"columnArticles":597,"formTitle":"[978]最长湍流子数组","frequency":0.229388925,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":90800,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7121588089330024,"acs":8323,"articleLive":2,"columnArticles":132,"formTitle":"[979]在二叉树中分配硬币","frequency":1.4330635473,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11687,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7344001662596769,"acs":14135,"articleLive":2,"columnArticles":208,"formTitle":"[980]不同路径 III","frequency":1.6430366354,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":19247,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5330408693240551,"acs":21142,"articleLive":2,"columnArticles":310,"formTitle":"[981]基于时间的键值存储","frequency":2.59796516,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":39663,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5446447968716055,"acs":2507,"articleLive":2,"columnArticles":25,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4603,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6340688402936765,"acs":32127,"articleLive":2,"columnArticles":451,"formTitle":"[983]最低票价","frequency":2.026373181,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":50668,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41658500163330064,"acs":8927,"articleLive":2,"columnArticles":139,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":21429,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.5998220442664887,"acs":16179,"articleLive":2,"columnArticles":184,"formTitle":"[985]查询后的偶数和","frequency":0.2566981044,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":26973,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6764893764754896,"acs":24357,"articleLive":2,"columnArticles":232,"formTitle":"[986]区间列表的交集","frequency":2.2104421414,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":36005,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5325522660305879,"acs":22773,"articleLive":2,"columnArticles":406,"formTitle":"[987]二叉树的垂序遍历","frequency":2.5310310906,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":42762,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.49876786594381467,"acs":9108,"articleLive":2,"columnArticles":109,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.229388925,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":18261,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4715354586857515,"acs":52182,"articleLive":2,"columnArticles":589,"formTitle":"[989]数组形式的整数加法","frequency":0.7745391608,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":110664,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5022793581327498,"acs":33054,"articleLive":2,"columnArticles":494,"formTitle":"[990]等式方程的可满足性","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":65808,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5187159369946697,"acs":8661,"articleLive":2,"columnArticles":108,"formTitle":"[991]坏了的计算器","frequency":0.229388925,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16697,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45216620413197656,"acs":23462,"articleLive":2,"columnArticles":270,"formTitle":"[992]K 个不同整数的子数组","frequency":0.7745391608,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":51888,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5569535183491797,"acs":50553,"articleLive":2,"columnArticles":797,"formTitle":"[993]二叉树的堂兄弟节点","frequency":2.4528051415,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":90767,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5090550766787528,"acs":53210,"articleLive":2,"columnArticles":1381,"formTitle":"[994]腐烂的橘子","frequency":1.5170524484,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":104527,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5397964080931572,"acs":21370,"articleLive":2,"columnArticles":250,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.2566981044,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39589,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49452979515828677,"acs":4249,"articleLive":2,"columnArticles":84,"formTitle":"[996]正方形数组的数目","frequency":0.2852225711,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8592,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.511309730417679,"acs":35354,"articleLive":2,"columnArticles":382,"formTitle":"[997]找到小镇的法官","frequency":0.7165434933,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":69144,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6143250688705234,"acs":7582,"articleLive":2,"columnArticles":108,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12342,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6908145343400014,"acs":30286,"articleLive":2,"columnArticles":567,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.229388925,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":43841,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4086071804467314,"acs":3494,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":1.6430366354,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8551,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29233586925894617,"acs":2075,"articleLive":2,"columnArticles":50,"formTitle":"[1001]网格照明","frequency":0.4857969074,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7098,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7366730221746285,"acs":56410,"articleLive":2,"columnArticles":596,"formTitle":"[1002]查找常用字符","frequency":1.9305227639,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":76574,"title":"查找常用字符","titleSlug":"find-common-characters"},{"acceptance":0.5765438008616562,"acs":12044,"articleLive":2,"columnArticles":181,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":20890,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5970476850144377,"acs":66372,"articleLive":2,"columnArticles":697,"formTitle":"[1004]最大连续1的个数 III","frequency":2.3877397836,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":111167,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5335063709296838,"acs":24871,"articleLive":2,"columnArticles":406,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":1.0742760328,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":46618,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6274100279897135,"acs":44159,"articleLive":2,"columnArticles":599,"formTitle":"[1006]笨阶乘","frequency":2.4021417838,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70383,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46494684410081033,"acs":6254,"articleLive":2,"columnArticles":83,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13451,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7246190169564284,"acs":16880,"articleLive":2,"columnArticles":216,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":1.7506672996,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":23295,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5930332681017613,"acs":15152,"articleLive":2,"columnArticles":207,"formTitle":"[1009]十进制整数的反码","frequency":0.229388925,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":25550,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.4510998224501874,"acs":18293,"articleLive":2,"columnArticles":240,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.2852225711,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40552,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6268502943650126,"acs":59626,"articleLive":2,"columnArticles":572,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":3.3517369624,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":95120,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3311716860848538,"acs":3013,"articleLive":2,"columnArticles":63,"formTitle":"[1012]至少有 1 位重复的数字","frequency":1.5024876702,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9098,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39755554987343067,"acs":46644,"articleLive":2,"columnArticles":915,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":1.5778244868,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":117327,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5490190267322624,"acs":37050,"articleLive":2,"columnArticles":438,"formTitle":"[1014]最佳观光组合","frequency":0.7165434933,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":67484,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35469360666617505,"acs":4810,"articleLive":2,"columnArticles":40,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.8372261388,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13561,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5833711433756806,"acs":5143,"articleLive":2,"columnArticles":78,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8816,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5610460452430611,"acs":3497,"articleLive":2,"columnArticles":55,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6233,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5162958948013385,"acs":43817,"articleLive":2,"columnArticles":375,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":84868,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5976409304553483,"acs":19963,"articleLive":2,"columnArticles":259,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.2032094194,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":33403,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5368433423434011,"acs":9136,"articleLive":2,"columnArticles":134,"formTitle":"[1020]飞地的数量","frequency":0.7745391608,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":17018,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7834581124651621,"acs":57346,"articleLive":2,"columnArticles":648,"formTitle":"[1021]删除最外层的括号","frequency":0.7449949145,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":73196,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7033347769597228,"acs":19488,"articleLive":2,"columnArticles":257,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.2032094194,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":27708,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5653019862180786,"acs":6973,"articleLive":2,"columnArticles":152,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12335,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5577293136626043,"acs":33041,"articleLive":2,"columnArticles":378,"formTitle":"[1024]视频拼接","frequency":0.8052541061,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":59242,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7096107344364895,"acs":74832,"articleLive":2,"columnArticles":644,"formTitle":"[1025]除数博弈","frequency":1.71946352,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":105455,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6697197539302803,"acs":9798,"articleLive":2,"columnArticles":164,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14630,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.43340767617589293,"acs":13020,"articleLive":2,"columnArticles":118,"formTitle":"[1027]最长等差数列","frequency":1.6098374638,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":30041,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7316745856153204,"acs":20173,"articleLive":2,"columnArticles":421,"formTitle":"[1028]从先序遍历还原二叉树","frequency":1.1669539601,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27571,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6549670702370154,"acs":16608,"articleLive":2,"columnArticles":179,"formTitle":"[1029]两地调度","frequency":0.1780824693,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":25357,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7113194909578031,"acs":40356,"articleLive":2,"columnArticles":442,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":56734,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5664931377188831,"acs":4788,"articleLive":2,"columnArticles":71,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.2852225711,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8452,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.3969514131470308,"acs":2500,"articleLive":2,"columnArticles":39,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6298,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.39016006015683746,"acs":10896,"articleLive":2,"columnArticles":163,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":27927,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4325682198798148,"acs":4391,"articleLive":2,"columnArticles":93,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10151,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6314503429926334,"acs":34887,"articleLive":2,"columnArticles":377,"formTitle":"[1035]不相交的线","frequency":2.5785706127,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":55249,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.2986391365556077,"acs":3182,"articleLive":2,"columnArticles":52,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10655,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43855354916177897,"acs":9496,"articleLive":2,"columnArticles":110,"formTitle":"[1037]有效的回旋镖","frequency":0.2032094194,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":21653,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7934398010901789,"acs":24891,"articleLive":2,"columnArticles":315,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.6891144561,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":31371,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5549017152873419,"acs":4432,"articleLive":2,"columnArticles":58,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":7987,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5225189318453567,"acs":2622,"articleLive":2,"columnArticles":29,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5018,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.4816221250985169,"acs":6722,"articleLive":2,"columnArticles":112,"formTitle":"[1041]困于环中的机器人","frequency":1.4003059508,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":13957,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5286343612334802,"acs":11280,"articleLive":2,"columnArticles":149,"formTitle":"[1042]不邻接植花","frequency":0.8372261388,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":21338,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6904480596201036,"acs":7597,"articleLive":2,"columnArticles":98,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11003,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20925416964722715,"acs":5558,"articleLive":2,"columnArticles":71,"formTitle":"[1044]最长重复子串","frequency":2.6712182378,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":26561,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6427122347066168,"acs":8237,"articleLive":2,"columnArticles":104,"formTitle":"[1045]买下所有产品的客户","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"","submitted":12816,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6596114757248173,"acs":65227,"articleLive":2,"columnArticles":905,"formTitle":"[1046]最后一块石头的重量","frequency":1.3088345473,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":98887,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7249389693692685,"acs":103638,"articleLive":2,"columnArticles":969,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":2.8702227621,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":142961,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4520627261761158,"acs":9369,"articleLive":2,"columnArticles":129,"formTitle":"[1048]最长字符串链","frequency":1.9305227639,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":20725,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6434423704798866,"acs":41780,"articleLive":2,"columnArticles":397,"formTitle":"[1049]最后一块石头的重量 II","frequency":2.9016101955,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":64932,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7579056148811574,"acs":11001,"articleLive":2,"columnArticles":53,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.7745391608,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"","submitted":14515,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.753198956835409,"acs":30903,"articleLive":2,"columnArticles":363,"formTitle":"[1051]高度检查器","frequency":0.2566981044,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":41029,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5811158379755477,"acs":47673,"articleLive":2,"columnArticles":744,"formTitle":"[1052]爱生气的书店老板","frequency":0.8372261388,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":82037,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.45845316750874465,"acs":5898,"articleLive":2,"columnArticles":94,"formTitle":"[1053]交换一次的先前排列","frequency":0.8372261388,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":12865,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37594452415112384,"acs":7861,"articleLive":2,"columnArticles":105,"formTitle":"[1054]距离相等的条形码","frequency":0.7745391608,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":20910,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.584573573184936,"acs":4517,"articleLive":2,"columnArticles":81,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"","submitted":7727,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4086166687124095,"acs":3329,"articleLive":2,"columnArticles":62,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"","submitted":8147,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4661187781051326,"acs":3006,"articleLive":2,"columnArticles":36,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"","submitted":6449,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3405250844814141,"acs":1310,"articleLive":2,"columnArticles":28,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"","submitted":3847,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.3590329957530219,"acs":2198,"articleLive":2,"columnArticles":36,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"","submitted":6122,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5279448621553885,"acs":4213,"articleLive":2,"columnArticles":61,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.2852225711,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"","submitted":7980,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6033643204957946,"acs":2726,"articleLive":2,"columnArticles":58,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"","submitted":4518,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.54064,"acs":3379,"articleLive":2,"columnArticles":43,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"","submitted":6250,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.702251552795031,"acs":1809,"articleLive":2,"columnArticles":38,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"","submitted":2576,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6510989010989011,"acs":4740,"articleLive":2,"columnArticles":67,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"","submitted":7280,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5396718363677231,"acs":2401,"articleLive":2,"columnArticles":68,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"","submitted":4449,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.47488799811365245,"acs":2014,"articleLive":2,"columnArticles":40,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"","submitted":4241,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.42179353493222105,"acs":809,"articleLive":2,"columnArticles":25,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"","submitted":1918,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8638200431034483,"acs":12826,"articleLive":2,"columnArticles":61,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"","submitted":14848,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8200105876124933,"acs":10843,"articleLive":2,"columnArticles":54,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"","submitted":13223,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.4838565879131376,"acs":7598,"articleLive":2,"columnArticles":71,"formTitle":"[1070]产品销售分析 III","frequency":0.229388925,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"","submitted":15703,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5866870956758597,"acs":34462,"articleLive":2,"columnArticles":668,"formTitle":"[1071]字符串的最大公因子","frequency":0.8052541061,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":58740,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5790125641479384,"acs":3272,"articleLive":2,"columnArticles":52,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.3150577195,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5651,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.3361996053002537,"acs":2385,"articleLive":2,"columnArticles":51,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7094,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6695702882968254,"acs":18371,"articleLive":2,"columnArticles":184,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":2.2069720845,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27437,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.69220409995511,"acs":9252,"articleLive":2,"columnArticles":69,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"","submitted":13366,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4958289624856386,"acs":9926,"articleLive":2,"columnArticles":84,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"","submitted":20019,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7222825550399842,"acs":7316,"articleLive":2,"columnArticles":87,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"","submitted":10129,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6220603203514223,"acs":11612,"articleLive":2,"columnArticles":176,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":18667,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7338048651507139,"acs":11101,"articleLive":2,"columnArticles":186,"formTitle":"[1079]活字印刷","frequency":0.229388925,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15128,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4902654867256637,"acs":4155,"articleLive":2,"columnArticles":86,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8475,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.571360400843043,"acs":14368,"articleLive":2,"columnArticles":138,"formTitle":"[1081]不同字符的最小子序列","frequency":1.9305227639,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":25147,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7609706083390294,"acs":11133,"articleLive":2,"columnArticles":91,"formTitle":"[1082]销售分析 I ","frequency":0.229388925,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"","submitted":14630,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5278510473235066,"acs":10206,"articleLive":2,"columnArticles":94,"formTitle":"[1083]销售分析 II","frequency":0.7745391608,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"","submitted":19335,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5371066480506927,"acs":10002,"articleLive":2,"columnArticles":93,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"","submitted":18622,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7733046286329387,"acs":3592,"articleLive":2,"columnArticles":72,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"","submitted":4645,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6893991475319675,"acs":5014,"articleLive":2,"columnArticles":79,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"","submitted":7273,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5312033442818752,"acs":1779,"articleLive":2,"columnArticles":52,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"","submitted":3349,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.44638949671772427,"acs":1020,"articleLive":2,"columnArticles":33,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"","submitted":2285,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.585564538440257,"acs":19049,"articleLive":2,"columnArticles":279,"formTitle":"[1089]复写零","frequency":0.229388925,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":32531,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.543313708999159,"acs":3876,"articleLive":2,"columnArticles":77,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7134,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3779400859113742,"acs":27011,"articleLive":2,"columnArticles":275,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":2.0480425013,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":71469,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4888003037205771,"acs":2575,"articleLive":2,"columnArticles":48,"formTitle":"[1092]最短公共超序列","frequency":0.8372261388,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5268,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.37999583680266447,"acs":3651,"articleLive":2,"columnArticles":57,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9608,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6107950571228724,"acs":26197,"articleLive":2,"columnArticles":369,"formTitle":"[1094]拼车","frequency":1.5778244868,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":42890,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.37256589770075366,"acs":19477,"articleLive":2,"columnArticles":381,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":52278,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.55,"acs":1661,"articleLive":2,"columnArticles":46,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3020,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5190713101160862,"acs":5947,"articleLive":2,"columnArticles":105,"formTitle":"[1097]游戏玩法分析 V","frequency":1.6430366354,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"","submitted":11457,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.47203564540799364,"acs":7098,"articleLive":2,"columnArticles":99,"formTitle":"[1098]小众书籍","frequency":0.2032094194,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"","submitted":15037,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5804050756466569,"acs":4757,"articleLive":2,"columnArticles":89,"formTitle":"[1099]小于 K 的两数之和","frequency":0.2566981044,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"","submitted":8196,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.7009046624913013,"acs":5036,"articleLive":2,"columnArticles":96,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"","submitted":7185,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6699029126213593,"acs":2346,"articleLive":2,"columnArticles":50,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"","submitted":3502,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.3676842029299271,"acs":5095,"articleLive":2,"columnArticles":65,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"","submitted":13857,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6369321151177668,"acs":35344,"articleLive":2,"columnArticles":1096,"formTitle":"[1103]分糖果 II","frequency":0.7449949145,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":55491,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7610664387038175,"acs":28489,"articleLive":2,"columnArticles":667,"formTitle":"[1104]二叉树寻路","frequency":2.1084169347,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37433,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.558091286307054,"acs":5111,"articleLive":2,"columnArticles":65,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9158,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5739587657395877,"acs":4148,"articleLive":2,"columnArticles":123,"formTitle":"[1106]解析布尔表达式","frequency":0.8705514485,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7227,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4103695179644547,"acs":6419,"articleLive":2,"columnArticles":88,"formTitle":"[1107]每日新用户统计","frequency":0.229388925,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"","submitted":15642,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.839320804151761,"acs":66632,"articleLive":2,"columnArticles":677,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":79388,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5762427964665298,"acs":57796,"articleLive":2,"columnArticles":575,"formTitle":"[1109]航班预订统计","frequency":1.2992430677,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":100298,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6295063145809414,"acs":10966,"articleLive":2,"columnArticles":201,"formTitle":"[1110]删点成林","frequency":1.1040401347,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":17420,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7712829063391798,"acs":24054,"articleLive":2,"columnArticles":397,"formTitle":"[1111]有效括号的嵌套深度","frequency":1.1669539601,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31187,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6426400347372991,"acs":7400,"articleLive":2,"columnArticles":82,"formTitle":"[1112]每位学生的最高成绩","frequency":0.2852225711,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"","submitted":11515,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5404923874311629,"acs":6674,"articleLive":2,"columnArticles":47,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"","submitted":12348,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6533366465588155,"acs":76247,"articleLive":2,"columnArticles":570,"formTitle":"[1114]按序打印","frequency":3.81382044,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":116704,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5623349566740535,"acs":42377,"articleLive":2,"columnArticles":476,"formTitle":"[1115]交替打印FooBar","frequency":2.2104421414,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":75359,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5179686771697586,"acs":22225,"articleLive":2,"columnArticles":363,"formTitle":"[1116]打印零与奇偶数","frequency":2.7056553215,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":42908,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5209020902090209,"acs":17046,"articleLive":2,"columnArticles":250,"formTitle":"[1117]H2O 生成","frequency":2.1729577707,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":32724,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6417037861915368,"acs":2305,"articleLive":2,"columnArticles":36,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"","submitted":3592,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8663247147492934,"acs":8276,"articleLive":2,"columnArticles":143,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"","submitted":9553,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6078755010610705,"acs":2578,"articleLive":2,"columnArticles":47,"formTitle":"[1120]子树的最大平均值","frequency":0.4135624901,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"","submitted":4241,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5738485971413446,"acs":1084,"articleLive":2,"columnArticles":17,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"","submitted":1889,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.707244212098581,"acs":64396,"articleLive":2,"columnArticles":865,"formTitle":"[1122]数组的相对排序","frequency":2.3679365961,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":91052,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7059240865555162,"acs":7960,"articleLive":2,"columnArticles":102,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11276,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3170921896616778,"acs":12606,"articleLive":2,"columnArticles":129,"formTitle":"[1124]表现良好的最长时间段","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":39755,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4907694821107662,"acs":3004,"articleLive":2,"columnArticles":50,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6121,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6933160132262636,"acs":5871,"articleLive":2,"columnArticles":89,"formTitle":"[1126]查询活跃业务","frequency":0.7745391608,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"","submitted":8468,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4142146257031588,"acs":3829,"articleLive":2,"columnArticles":70,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"","submitted":9244,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5447184448836317,"acs":36933,"articleLive":2,"columnArticles":475,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.7449949145,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":67802,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3798602954812388,"acs":6145,"articleLive":2,"columnArticles":110,"formTitle":"[1129]颜色交替的最短路径","frequency":0.8705514485,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16177,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6273218142548597,"acs":5809,"articleLive":2,"columnArticles":98,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.3150577195,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9260,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4543954395439544,"acs":3029,"articleLive":2,"columnArticles":45,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6666,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3881703742024487,"acs":4502,"articleLive":2,"columnArticles":51,"formTitle":"[1132]报告的记录 II","frequency":0.8052541061,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"","submitted":11598,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6445190156599553,"acs":2881,"articleLive":2,"columnArticles":61,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"","submitted":4470,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7748639287481445,"acs":3132,"articleLive":2,"columnArticles":52,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"","submitted":4042,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5351745700885878,"acs":6162,"articleLive":2,"columnArticles":70,"formTitle":"[1135]最低成本联通所有城市","frequency":0.8052541061,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"","submitted":11514,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5691624365482234,"acs":2691,"articleLive":2,"columnArticles":47,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"","submitted":4728,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6071689231854227,"acs":74040,"articleLive":2,"columnArticles":832,"formTitle":"[1137]第 N 个泰波那契数","frequency":1.7995768027,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":121943,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4327101469958613,"acs":6064,"articleLive":2,"columnArticles":137,"formTitle":"[1138]字母板上的路径","frequency":0.2852225711,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14014,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.47707699448197616,"acs":9251,"articleLive":2,"columnArticles":149,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.8052541061,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":19391,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6531973322871715,"acs":6660,"articleLive":2,"columnArticles":93,"formTitle":"[1140]石子游戏 II","frequency":0.3150577195,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10196,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5109627214890373,"acs":9718,"articleLive":2,"columnArticles":64,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.8052541061,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"","submitted":19019,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3710529211134338,"acs":6745,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"","submitted":18178,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6343218958791798,"acs":159688,"articleLive":2,"columnArticles":1076,"formTitle":"[1143]最长公共子序列","frequency":3.8956422824,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":251746,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44161844718887644,"acs":10227,"articleLive":2,"columnArticles":144,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":1.1349067827,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23158,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4690658828589863,"acs":6543,"articleLive":2,"columnArticles":105,"formTitle":"[1145]二叉树着色游戏","frequency":0.9053375646,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":13949,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2853970016657413,"acs":4112,"articleLive":2,"columnArticles":60,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":14408,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5609756097560976,"acs":4002,"articleLive":2,"columnArticles":77,"formTitle":"[1147]段式回文","frequency":1.7133495366,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7134,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7169169736469255,"acs":7590,"articleLive":2,"columnArticles":35,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"","submitted":10587,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.44253564679608315,"acs":5152,"articleLive":2,"columnArticles":45,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"","submitted":11642,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6059843770687144,"acs":4577,"articleLive":2,"columnArticles":80,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.8372261388,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"","submitted":7553,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.4836154123154483,"acs":4029,"articleLive":2,"columnArticles":56,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.8372261388,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"","submitted":8331,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3868443929295856,"acs":1335,"articleLive":2,"columnArticles":31,"formTitle":"[1152]用户网站访问行为分析","frequency":0.521914116,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"","submitted":3451,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.37014134275618377,"acs":1676,"articleLive":2,"columnArticles":23,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"","submitted":4528,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5685547268695827,"acs":14103,"articleLive":2,"columnArticles":219,"formTitle":"[1154]一年中的第几天","frequency":1.4003059508,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":24805,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4799493670886076,"acs":9479,"articleLive":2,"columnArticles":124,"formTitle":"[1155]掷骰子的N种方法","frequency":0.229388925,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":19750,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4338163392301538,"acs":4880,"articleLive":2,"columnArticles":78,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11249,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.3171377156769345,"acs":2996,"articleLive":2,"columnArticles":44,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9447,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5505349537758388,"acs":5300,"articleLive":2,"columnArticles":60,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"","submitted":9627,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.48729884293124087,"acs":3664,"articleLive":2,"columnArticles":81,"formTitle":"[1159]市场分析 II","frequency":0.7745391608,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"","submitted":7519,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6872005396101781,"acs":59091,"articleLive":2,"columnArticles":905,"formTitle":"[1160]拼写单词","frequency":0.7449949145,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":85988,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6329330000609644,"acs":10382,"articleLive":2,"columnArticles":171,"formTitle":"[1161]最大层内元素和","frequency":0.7449949145,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16403,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4690568228131059,"acs":37980,"articleLive":2,"columnArticles":491,"formTitle":"[1162]地图分析","frequency":1.1040401347,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":80971,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2675907651351723,"acs":5830,"articleLive":2,"columnArticles":96,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":21787,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6101788474276882,"acs":5527,"articleLive":2,"columnArticles":82,"formTitle":"[1164]指定日期的产品价格","frequency":0.8372261388,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"","submitted":9058,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8382385730211818,"acs":7519,"articleLive":2,"columnArticles":112,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"","submitted":8970,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4843864805290228,"acs":2637,"articleLive":2,"columnArticles":47,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"","submitted":5444,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.4292211483797612,"acs":2265,"articleLive":2,"columnArticles":34,"formTitle":"[1167]连接棒材的最低费用","frequency":0.346310263,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"","submitted":5277,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5707460492466006,"acs":1553,"articleLive":2,"columnArticles":25,"formTitle":"[1168]水资源分配优化","frequency":0.4496796987,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"","submitted":2721,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.32225559538804377,"acs":6652,"articleLive":2,"columnArticles":79,"formTitle":"[1169]查询无效交易","frequency":0.8372261388,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20642,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6168677978404864,"acs":13597,"articleLive":2,"columnArticles":212,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.2032094194,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22042,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.4737857593410263,"acs":12769,"articleLive":2,"columnArticles":151,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":1.1349067827,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":26951,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.26928162185985016,"acs":2444,"articleLive":2,"columnArticles":50,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9076,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.756546014632268,"acs":7859,"articleLive":2,"columnArticles":73,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"","submitted":10388,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.619942196531792,"acs":4719,"articleLive":2,"columnArticles":58,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"","submitted":7612,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.4902390574696897,"acs":7157,"articleLive":2,"columnArticles":110,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14599,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.44785082174462704,"acs":4251,"articleLive":2,"columnArticles":60,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"","submitted":9492,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.2644082519001086,"acs":6088,"articleLive":2,"columnArticles":93,"formTitle":"[1177]构建回文串检测","frequency":0.2852225711,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23025,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46199486450776556,"acs":18532,"articleLive":2,"columnArticles":182,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40113,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6354073696289685,"acs":29901,"articleLive":2,"columnArticles":179,"formTitle":"[1179]重新格式化部门表","frequency":2.5310310906,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":47058,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7762167586552935,"acs":3094,"articleLive":2,"columnArticles":66,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"","submitted":3986,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3705481182116696,"acs":1467,"articleLive":2,"columnArticles":27,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"","submitted":3959,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.39188370684433677,"acs":1941,"articleLive":2,"columnArticles":39,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"","submitted":4953,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.6024667931688804,"acs":635,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"","submitted":1054,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5854782261994418,"acs":13216,"articleLive":2,"columnArticles":254,"formTitle":"[1184]公交站间的距离","frequency":0.7745391608,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22573,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.609811154544954,"acs":11076,"articleLive":2,"columnArticles":198,"formTitle":"[1185]一周中的第几天","frequency":0.229388925,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":18163,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.3931446239138547,"acs":7375,"articleLive":2,"columnArticles":104,"formTitle":"[1186]删除一次得到子数组最大和","frequency":1.3687326889,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":18759,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4426467036947597,"acs":1833,"articleLive":2,"columnArticles":31,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4141,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6936703391661266,"acs":3211,"articleLive":2,"columnArticles":64,"formTitle":"[1188]设计有限阻塞队列","frequency":0.9778224174,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"","submitted":4629,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6446981545198623,"acs":20611,"articleLive":2,"columnArticles":321,"formTitle":"[1189]“气球” 的最大数量","frequency":0.2032094194,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":31970,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6503904247058996,"acs":44395,"articleLive":2,"columnArticles":608,"formTitle":"[1190]反转每对括号间的子串","frequency":4.3301245589,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":68259,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.26745391445441025,"acs":5934,"articleLive":2,"columnArticles":93,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22187,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.49945802721907745,"acs":4147,"articleLive":2,"columnArticles":47,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8303,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.606640405177265,"acs":5390,"articleLive":2,"columnArticles":69,"formTitle":"[1193]每月交易 I","frequency":0.2852225711,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"","submitted":8885,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5102985074626866,"acs":3419,"articleLive":2,"columnArticles":60,"formTitle":"[1194]锦标赛优胜者","frequency":0.3150577195,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"","submitted":6700,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6360146081093735,"acs":13584,"articleLive":2,"columnArticles":261,"formTitle":"[1195]交替打印字符串","frequency":1.4003059508,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":21358,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6912152566443498,"acs":3407,"articleLive":2,"columnArticles":56,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"","submitted":4929,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.36939190245427544,"acs":4726,"articleLive":2,"columnArticles":58,"formTitle":"[1197]进击的骑士","frequency":0.8052541061,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"","submitted":12794,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7481438061742869,"acs":3829,"articleLive":2,"columnArticles":55,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"","submitted":5118,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.4343918514080288,"acs":725,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"","submitted":1669,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6867352505650378,"acs":17623,"articleLive":2,"columnArticles":247,"formTitle":"[1200]最小绝对差","frequency":1.1040401347,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":25662,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24734130940511798,"acs":5954,"articleLive":2,"columnArticles":84,"formTitle":"[1201]丑数 III","frequency":1.4003059508,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24072,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5033703633967238,"acs":26734,"articleLive":2,"columnArticles":292,"formTitle":"[1202]交换字符串中的元素","frequency":0.229388925,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53110,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.622070816558274,"acs":12052,"articleLive":2,"columnArticles":143,"formTitle":"[1203]项目管理","frequency":0.346310263,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19374,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7278666666666667,"acs":5459,"articleLive":2,"columnArticles":78,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.229388925,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"","submitted":7500,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4609890606635928,"acs":5099,"articleLive":2,"columnArticles":81,"formTitle":"[1205]每月交易II","frequency":0.8372261388,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"","submitted":11061,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6193615218005462,"acs":6577,"articleLive":2,"columnArticles":86,"formTitle":"[1206]设计跳表","frequency":0.8052541061,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":10619,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7305649267006072,"acs":59552,"articleLive":2,"columnArticles":825,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":81515,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4970006476477645,"acs":46811,"articleLive":2,"columnArticles":603,"formTitle":"[1208]尽可能使字符串相等","frequency":0.8052541061,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":94187,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5315363640427339,"acs":11891,"articleLive":2,"columnArticles":158,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":1.4003059508,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":22371,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.44940934771443247,"acs":2625,"articleLive":2,"columnArticles":53,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.4135624901,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5841,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.655035904989873,"acs":7115,"articleLive":2,"columnArticles":60,"formTitle":"[1211]查询结果的质量和占比","frequency":0.8372261388,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"","submitted":10862,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5101912825337096,"acs":4881,"articleLive":2,"columnArticles":94,"formTitle":"[1212]查询球队积分","frequency":0.229388925,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"","submitted":9567,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7735723771580345,"acs":5825,"articleLive":2,"columnArticles":122,"formTitle":"[1213]三个有序数组的交集","frequency":0.9417052088,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"","submitted":7530,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6346743295019157,"acs":3313,"articleLive":2,"columnArticles":70,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.3150577195,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"","submitted":5220,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.41147818720880985,"acs":1943,"articleLive":2,"columnArticles":39,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"","submitted":4722,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5353007097497199,"acs":1433,"articleLive":2,"columnArticles":37,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"","submitted":2677,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6953435089870599,"acs":21548,"articleLive":2,"columnArticles":347,"formTitle":"[1217]玩筹码","frequency":1.4003059508,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":30989,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.4209200719609355,"acs":8189,"articleLive":2,"columnArticles":108,"formTitle":"[1218]最长定差子序列","frequency":0.2566981044,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":19455,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6306875497743563,"acs":11879,"articleLive":2,"columnArticles":167,"formTitle":"[1219]黄金矿工","frequency":1.6098374638,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":18835,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5255102040816326,"acs":3811,"articleLive":2,"columnArticles":71,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7252,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.843900481540931,"acs":75708,"articleLive":2,"columnArticles":1102,"formTitle":"[1221]分割平衡字符串","frequency":0.8842841554,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":89712,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6726259577432088,"acs":5794,"articleLive":2,"columnArticles":126,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8614,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4730231230373965,"acs":3314,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7006,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.325635103926097,"acs":4653,"articleLive":2,"columnArticles":68,"formTitle":"[1224]最大相等频率","frequency":1.3896539541,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14289,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5429054054054054,"acs":3214,"articleLive":2,"columnArticles":75,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.8052541061,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"","submitted":5920,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5988153489569921,"acs":11626,"articleLive":2,"columnArticles":134,"formTitle":"[1226]哲学家进餐","frequency":2.3679365961,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":19415,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6625492421713294,"acs":9923,"articleLive":2,"columnArticles":154,"formTitle":"[1227]飞机座位分配概率","frequency":0.1780824693,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":14977,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5393714689265536,"acs":3055,"articleLive":2,"columnArticles":50,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"","submitted":5664,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.41704825642831983,"acs":2368,"articleLive":2,"columnArticles":42,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"","submitted":5678,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.49172655858265085,"acs":2942,"articleLive":2,"columnArticles":56,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"","submitted":5983,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5600229753015509,"acs":2925,"articleLive":2,"columnArticles":41,"formTitle":"[1231]分享巧克力","frequency":0.2032094194,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"","submitted":5223,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4693863309653738,"acs":33632,"articleLive":2,"columnArticles":418,"formTitle":"[1232]缀点成线","frequency":0.7449949145,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":71651,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48121546961325967,"acs":7839,"articleLive":2,"columnArticles":111,"formTitle":"[1233]删除子文件夹","frequency":0.229388925,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":16290,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.34212695795548226,"acs":5810,"articleLive":2,"columnArticles":88,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.7745391608,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":16982,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4581487704292042,"acs":5999,"articleLive":2,"columnArticles":106,"formTitle":"[1235]规划兼职工作","frequency":1.8512545365,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":13094,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5613437195715677,"acs":1153,"articleLive":2,"columnArticles":31,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"","submitted":2054,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7108136667840789,"acs":10090,"articleLive":2,"columnArticles":128,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14195,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6585893552574643,"acs":3044,"articleLive":2,"columnArticles":70,"formTitle":"[1238]循环码排列","frequency":0.2852225711,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4622,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.490847756775222,"acs":34485,"articleLive":2,"columnArticles":384,"formTitle":"[1239]串联字符串的最大长度","frequency":1.887398695,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":70256,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.49584487534626037,"acs":2506,"articleLive":2,"columnArticles":38,"formTitle":"[1240]铺瓷砖","frequency":1.3088345473,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5054,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5945142418720629,"acs":6199,"articleLive":2,"columnArticles":63,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"","submitted":10427,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.47133512889572915,"acs":1225,"articleLive":2,"columnArticles":20,"formTitle":"[1242]多线程网页爬虫","frequency":0.7449949145,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"","submitted":2599,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.540500736377025,"acs":2569,"articleLive":2,"columnArticles":53,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"","submitted":4753,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6178376976925072,"acs":2383,"articleLive":2,"columnArticles":39,"formTitle":"[1244]力扣排行榜","frequency":0.4496796987,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"","submitted":3857,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5089846603360116,"acs":3484,"articleLive":2,"columnArticles":61,"formTitle":"[1245]树的直径","frequency":0.2852225711,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"","submitted":6845,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.48030328003955824,"acs":2914,"articleLive":2,"columnArticles":41,"formTitle":"[1246]删除回文子数组","frequency":0.4496796987,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"","submitted":6067,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6170459486882157,"acs":8514,"articleLive":2,"columnArticles":155,"formTitle":"[1247]交换字符使得字符串相同","frequency":1.1040401347,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":13798,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5592926939752799,"acs":34571,"articleLive":2,"columnArticles":472,"formTitle":"[1248]统计「优美子数组」","frequency":0.7745391608,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":61812,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.573221101061327,"acs":21928,"articleLive":2,"columnArticles":314,"formTitle":"[1249]移除无效的括号","frequency":1.6892983532,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":38254,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5612523639420046,"acs":2671,"articleLive":2,"columnArticles":37,"formTitle":"[1250]检查「好数组」","frequency":0.4496796987,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4759,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7712964784576037,"acs":7841,"articleLive":2,"columnArticles":93,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"","submitted":10166,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7493517356754495,"acs":17917,"articleLive":2,"columnArticles":310,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":23910,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3934787565554458,"acs":5177,"articleLive":2,"columnArticles":78,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.346310263,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13157,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5977453027139875,"acs":14316,"articleLive":2,"columnArticles":225,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.2852225711,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":23950,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6794545874740004,"acs":2940,"articleLive":2,"columnArticles":63,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4327,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6653508771929825,"acs":1517,"articleLive":2,"columnArticles":35,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"","submitted":2280,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5623830318153462,"acs":1803,"articleLive":2,"columnArticles":37,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"","submitted":3206,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5587419056429233,"acs":1208,"articleLive":2,"columnArticles":43,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"","submitted":2162,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4767270945614895,"acs":1946,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.6891144561,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"","submitted":4082,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6038948200869909,"acs":12218,"articleLive":2,"columnArticles":248,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":20232,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7280477408354646,"acs":7686,"articleLive":2,"columnArticles":97,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10557,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5253925417075564,"acs":12849,"articleLive":2,"columnArticles":195,"formTitle":"[1262]可被三整除的最大和","frequency":1.9305227639,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":24456,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4172927195738287,"acs":3055,"articleLive":2,"columnArticles":57,"formTitle":"[1263]推箱子","frequency":0.8705514485,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7321,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5687741312741312,"acs":4714,"articleLive":2,"columnArticles":82,"formTitle":"[1264]页面推荐","frequency":0.229388925,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"","submitted":8288,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9201388888888888,"acs":2650,"articleLive":2,"columnArticles":65,"formTitle":"[1265]逆序打印不可变链表","frequency":0.3791000859,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"","submitted":2880,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8238634789594703,"acs":29739,"articleLive":2,"columnArticles":453,"formTitle":"[1266]访问所有点的最小时间","frequency":0.229388925,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36097,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6078097359627859,"acs":9277,"articleLive":2,"columnArticles":144,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15263,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.58379346366214,"acs":7824,"articleLive":2,"columnArticles":144,"formTitle":"[1268]搜索推荐系统","frequency":0.3150577195,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":13402,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.491424285900613,"acs":30142,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":2.2789225585,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61336,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8040568511108045,"acs":5827,"articleLive":2,"columnArticles":81,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"","submitted":7247,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5062396006655574,"acs":2434,"articleLive":2,"columnArticles":39,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"","submitted":4808,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5182410423452769,"acs":1591,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"","submitted":3070,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5453908166841921,"acs":1556,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"","submitted":2853,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6008771929824561,"acs":959,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"","submitted":1596,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5411528150134048,"acs":8074,"articleLive":2,"columnArticles":168,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.7745391608,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":14920,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5015110422316932,"acs":6472,"articleLive":2,"columnArticles":97,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":12905,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7247277782068113,"acs":18769,"articleLive":2,"columnArticles":232,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":1.5469196787,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":25898,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5963581183611533,"acs":3537,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":2.8286603011,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":5931,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6236341562120599,"acs":1541,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"","submitted":2471,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5054570787212632,"acs":6530,"articleLive":2,"columnArticles":68,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.7745391608,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"","submitted":12919,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8318399320117501,"acs":45025,"articleLive":2,"columnArticles":613,"formTitle":"[1281]整数的各位积和之差","frequency":0.229388925,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":54127,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8109535910124381,"acs":12127,"articleLive":2,"columnArticles":227,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":14954,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.4171158621525044,"acs":6887,"articleLive":2,"columnArticles":98,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.8052541061,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16511,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6596509240246407,"acs":2570,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.6009563694,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3896,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8122146118721462,"acs":4269,"articleLive":2,"columnArticles":59,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"","submitted":5256,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6462894120886686,"acs":4694,"articleLive":2,"columnArticles":88,"formTitle":"[1286]字母组合迭代器","frequency":0.2852225711,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7263,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6037363244993879,"acs":15286,"articleLive":2,"columnArticles":215,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.7745391608,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":25319,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5633058549989431,"acs":13325,"articleLive":2,"columnArticles":168,"formTitle":"[1288]删除被覆盖区间","frequency":1.1349067827,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":23655,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6264614769661238,"acs":6269,"articleLive":2,"columnArticles":92,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":10007,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8094903768372533,"acs":53037,"articleLive":2,"columnArticles":692,"formTitle":"[1290]二进制链表转整数","frequency":0.1780824693,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":65519,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5193810096153846,"acs":6914,"articleLive":2,"columnArticles":151,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13312,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.469005476625129,"acs":5909,"articleLive":2,"columnArticles":95,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.229388925,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12599,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.35748166124317465,"acs":12963,"articleLive":2,"columnArticles":126,"formTitle":"[1293]网格中的最短路径","frequency":2.701282774,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":36262,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6564033484075821,"acs":6822,"articleLive":2,"columnArticles":72,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"","submitted":10393,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8087988471645333,"acs":47707,"articleLive":2,"columnArticles":630,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.7449949145,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":58985,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.453215156742609,"acs":7619,"articleLive":2,"columnArticles":121,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":16811,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.4572408373222833,"acs":6400,"articleLive":2,"columnArticles":90,"formTitle":"[1297]子串的最大出现次数","frequency":1.2349457052,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":13997,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5968334098210188,"acs":2601,"articleLive":2,"columnArticles":87,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4358,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7858501628664495,"acs":30157,"articleLive":2,"columnArticles":427,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":38375,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.46726515033494315,"acs":23995,"articleLive":2,"columnArticles":362,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.1780824693,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":51352,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.36223840906463173,"acs":3133,"articleLive":2,"columnArticles":69,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8649,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8176555104800541,"acs":19349,"articleLive":2,"columnArticles":292,"formTitle":"[1302]层数最深叶子节点的和","frequency":1.1349067827,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":23664,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8226896354811079,"acs":8644,"articleLive":2,"columnArticles":81,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"","submitted":10507,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7247015105116471,"acs":21062,"articleLive":2,"columnArticles":379,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.229388925,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29063,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7460293450310089,"acs":14796,"articleLive":2,"columnArticles":223,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.2032094194,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":19833,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5744752308984047,"acs":17105,"articleLive":2,"columnArticles":266,"formTitle":"[1306]跳跃游戏 III","frequency":1.4330635473,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":29775,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33248268319358365,"acs":1824,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5486,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7527225206911573,"acs":5184,"articleLive":2,"columnArticles":58,"formTitle":"[1308]不同性别每日分数总计","frequency":0.229388925,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"","submitted":6887,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7561682931320198,"acs":16427,"articleLive":2,"columnArticles":286,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":21724,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7127421471019526,"acs":36940,"articleLive":2,"columnArticles":497,"formTitle":"[1310]子数组异或查询","frequency":2.5653696818,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":51828,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3778817700089464,"acs":5491,"articleLive":2,"columnArticles":86,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.2566981044,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14531,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6662785432434181,"acs":10300,"articleLive":2,"columnArticles":145,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":1.8164805182,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":15459,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8318051575931232,"acs":34836,"articleLive":2,"columnArticles":542,"formTitle":"[1313]解压缩编码列表","frequency":0.1780824693,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":41880,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.736918797191681,"acs":11126,"articleLive":2,"columnArticles":187,"formTitle":"[1314]矩阵区域和","frequency":1.3088345473,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":15098,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8101290075360837,"acs":12685,"articleLive":2,"columnArticles":261,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15658,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.4389465283320032,"acs":2750,"articleLive":2,"columnArticles":57,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6265,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6141694008992588,"acs":10108,"articleLive":2,"columnArticles":190,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16458,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6545091444187513,"acs":6227,"articleLive":2,"columnArticles":111,"formTitle":"[1318]或运算的最小翻转次数","frequency":1.9642413999,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9514,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6170337087707279,"acs":30624,"articleLive":2,"columnArticles":510,"formTitle":"[1319]连通网络的操作次数","frequency":0.229388925,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":49631,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5895069225163955,"acs":2427,"articleLive":2,"columnArticles":56,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4117,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6163494809688581,"acs":4275,"articleLive":2,"columnArticles":75,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.1780824693,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"","submitted":6936,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5934381094413216,"acs":5173,"articleLive":2,"columnArticles":63,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"","submitted":8717,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.754950495049505,"acs":24095,"articleLive":2,"columnArticles":474,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":1.1349067827,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":31916,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5894980850634952,"acs":5849,"articleLive":2,"columnArticles":114,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":9922,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7289021116029316,"acs":10045,"articleLive":2,"columnArticles":180,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.229388925,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":13781,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.4743524631792788,"acs":5604,"articleLive":2,"columnArticles":91,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.2566981044,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":11814,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6902222793267377,"acs":5372,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"","submitted":7783,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.45941673911325376,"acs":5813,"articleLive":2,"columnArticles":115,"formTitle":"[1328]破坏回文串","frequency":0.2852225711,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12653,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7704624342178927,"acs":6881,"articleLive":2,"columnArticles":156,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.2852225711,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":8931,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3774140752864157,"acs":1153,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.6009563694,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3055,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5362994415470531,"acs":11620,"articleLive":2,"columnArticles":200,"formTitle":"[1331]数组序号转换","frequency":1.1349067827,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":21667,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6856762945999852,"acs":9282,"articleLive":2,"columnArticles":132,"formTitle":"[1332]删除回文子序列","frequency":0.229388925,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13537,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5437756497948016,"acs":5565,"articleLive":2,"columnArticles":117,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10234,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.49070074922873513,"acs":5567,"articleLive":2,"columnArticles":92,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":2.3349203919,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11345,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.585642967808573,"acs":3402,"articleLive":2,"columnArticles":56,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":5809,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.42283349561830574,"acs":1737,"articleLive":2,"columnArticles":48,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"","submitted":4108,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7061389101792036,"acs":38695,"articleLive":2,"columnArticles":615,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":1.7829802886,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":54798,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6395015754798052,"acs":8930,"articleLive":2,"columnArticles":127,"formTitle":"[1338]数组大小减半","frequency":0.229388925,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":13964,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.39790525141831934,"acs":8206,"articleLive":2,"columnArticles":130,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.2566981044,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":20623,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.572759952070297,"acs":4302,"articleLive":2,"columnArticles":95,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7511,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.4804493726291217,"acs":3293,"articleLive":2,"columnArticles":45,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"","submitted":6854,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.820549186463381,"acs":41656,"articleLive":2,"columnArticles":635,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":50766,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5436705599450361,"acs":12661,"articleLive":2,"columnArticles":212,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23288,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5924736578023081,"acs":5904,"articleLive":2,"columnArticles":121,"formTitle":"[1344]时钟指针的夹角","frequency":0.2032094194,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":9965,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.36645764013309445,"acs":5727,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":0.229388925,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15628,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43513429722950314,"acs":15439,"articleLive":2,"columnArticles":265,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":35481,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.739578319052662,"acs":7682,"articleLive":2,"columnArticles":113,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10387,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3046549888706087,"acs":3148,"articleLive":2,"columnArticles":49,"formTitle":"[1348]推文计数","frequency":0.3150577195,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":10333,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5053798500163026,"acs":3100,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.2852225711,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6134,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8488348113012992,"acs":8232,"articleLive":2,"columnArticles":83,"formTitle":"[1350]院系无效的学生","frequency":0.229388925,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"","submitted":9698,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7552834490355304,"acs":29484,"articleLive":2,"columnArticles":541,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.229388925,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":39037,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.4435095338264233,"acs":6536,"articleLive":2,"columnArticles":71,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.229388925,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":14737,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.2831201722172977,"acs":11179,"articleLive":2,"columnArticles":150,"formTitle":"[1353]最多可以参加的会议数目","frequency":2.5310310906,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":39485,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.28240149356391864,"acs":2874,"articleLive":2,"columnArticles":70,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10177,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6628794603230961,"acs":3734,"articleLive":2,"columnArticles":56,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"","submitted":5633,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7313811020591443,"acs":45606,"articleLive":2,"columnArticles":504,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.7449949145,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":62356,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5291347059615126,"acs":3932,"articleLive":2,"columnArticles":41,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7431,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4903785912467556,"acs":5479,"articleLive":2,"columnArticles":110,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.2566981044,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":11173,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5495226730310262,"acs":2763,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5028,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5045866059116254,"acs":8416,"articleLive":2,"columnArticles":139,"formTitle":"[1360]日期之间隔几天","frequency":1.4003059508,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":16679,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.402672800963961,"acs":7352,"articleLive":2,"columnArticles":195,"formTitle":"[1361]验证二叉树","frequency":0.229388925,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":18258,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5246164644540259,"acs":5232,"articleLive":2,"columnArticles":68,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":9973,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3653672486453943,"acs":4855,"articleLive":2,"columnArticles":98,"formTitle":"[1363]形成三的最大倍数","frequency":1.4670920091,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":13288,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.675759454432734,"acs":3270,"articleLive":2,"columnArticles":63,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.2566981044,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"","submitted":4839,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8248774581600172,"acs":84479,"articleLive":2,"columnArticles":1081,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.7745391608,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":102414,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5385326045115097,"acs":6995,"articleLive":2,"columnArticles":140,"formTitle":"[1366]通过投票对团队排名","frequency":0.8052541061,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":12989,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4174692423314591,"acs":14998,"articleLive":2,"columnArticles":219,"formTitle":"[1367]二叉树中的列表","frequency":0.2566981044,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":35926,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5237040319007532,"acs":3546,"articleLive":2,"columnArticles":87,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6771,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6097277170118688,"acs":2620,"articleLive":2,"columnArticles":41,"formTitle":"[1369]获取最近第二次的活动","frequency":0.2566981044,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"","submitted":4297,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7902191297465746,"acs":47926,"articleLive":2,"columnArticles":575,"formTitle":"[1370]上升下降字符串","frequency":0.2032094194,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60649,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5799835028869947,"acs":21094,"articleLive":2,"columnArticles":263,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":2.0929535061,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36370,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5132811007070514,"acs":8058,"articleLive":2,"columnArticles":161,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.2566981044,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":15699,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.3989428932551994,"acs":6944,"articleLive":2,"columnArticles":157,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":1.1040401347,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":17406,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7397025171624714,"acs":16809,"articleLive":2,"columnArticles":224,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22724,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5736122284794851,"acs":8556,"articleLive":2,"columnArticles":170,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":14916,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5027400040592652,"acs":7431,"articleLive":2,"columnArticles":152,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14781,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32469261492677576,"acs":4146,"articleLive":2,"columnArticles":129,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12769,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8621236133122029,"acs":7072,"articleLive":2,"columnArticles":60,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"","submitted":8203,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8371409921671018,"acs":10260,"articleLive":2,"columnArticles":160,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12256,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7278827476602507,"acs":16488,"articleLive":2,"columnArticles":248,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22652,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.731157973546294,"acs":11719,"articleLive":2,"columnArticles":151,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":16028,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6917786410240081,"acs":10863,"articleLive":2,"columnArticles":172,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":15703,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32415967892209563,"acs":4523,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":0.346310263,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":13953,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.54414725337935,"acs":1892,"articleLive":2,"columnArticles":45,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"","submitted":3477,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7015532544378699,"acs":13279,"articleLive":2,"columnArticles":197,"formTitle":"[1385]两个数组间的距离值","frequency":0.229388925,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":18928,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3112155607780389,"acs":6224,"articleLive":2,"columnArticles":129,"formTitle":"[1386]安排电影院座位","frequency":1.1669539601,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":19999,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6943027516344565,"acs":9664,"articleLive":2,"columnArticles":168,"formTitle":"[1387]将整数按权重排序","frequency":0.8372261388,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":13919,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5391899000526039,"acs":4100,"articleLive":2,"columnArticles":52,"formTitle":"[1388]3n 块披萨","frequency":0.7745391608,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7604,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.83091141422246,"acs":27961,"articleLive":2,"columnArticles":477,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.7449949145,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33651,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.352010361527199,"acs":6251,"articleLive":2,"columnArticles":114,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17758,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.3994681815434822,"acs":6610,"articleLive":2,"columnArticles":202,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.8705514485,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16547,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.40113173621027026,"acs":7585,"articleLive":2,"columnArticles":139,"formTitle":"[1392]最长快乐前缀","frequency":0.3150577195,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":18909,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8568950563746748,"acs":3952,"articleLive":2,"columnArticles":57,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"","submitted":4612,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6646442360728075,"acs":16870,"articleLive":2,"columnArticles":270,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":25382,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7492695883134131,"acs":14105,"articleLive":2,"columnArticles":210,"formTitle":"[1395]统计作战单位数","frequency":0.2566981044,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":18825,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.41409299168505004,"acs":9761,"articleLive":2,"columnArticles":140,"formTitle":"[1396]设计地铁系统","frequency":0.8052541061,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":23572,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3713235294117647,"acs":1010,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2720,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7697737556561086,"acs":4253,"articleLive":2,"columnArticles":63,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"","submitted":5525,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6706902782797254,"acs":9279,"articleLive":2,"columnArticles":150,"formTitle":"[1399]统计最大组的数目","frequency":0.229388925,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":13835,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.605268911237429,"acs":5537,"articleLive":2,"columnArticles":92,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.229388925,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9148,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41646046261430875,"acs":3871,"articleLive":2,"columnArticles":89,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9295,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7529448968297889,"acs":9524,"articleLive":2,"columnArticles":170,"formTitle":"[1402]做菜顺序","frequency":0.2032094194,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12649,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6915894017883657,"acs":20960,"articleLive":2,"columnArticles":359,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.7449949145,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":30307,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4928256070640177,"acs":7144,"articleLive":2,"columnArticles":153,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.229388925,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14496,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.507183643396574,"acs":5507,"articleLive":2,"columnArticles":138,"formTitle":"[1405]最长快乐字符串","frequency":0.8052541061,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":10858,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.569047619047619,"acs":4780,"articleLive":2,"columnArticles":79,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8400,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6671697237055956,"acs":5747,"articleLive":2,"columnArticles":64,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"","submitted":8614,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6149323378441437,"acs":13178,"articleLive":2,"columnArticles":200,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":21430,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8063058540014058,"acs":8030,"articleLive":2,"columnArticles":129,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":9959,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.47527684779809426,"acs":7382,"articleLive":2,"columnArticles":118,"formTitle":"[1410]HTML 实体解析器","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15532,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.550432482664951,"acs":7700,"articleLive":2,"columnArticles":140,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":1.1349067827,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":13989,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5582722086389568,"acs":2740,"articleLive":2,"columnArticles":66,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"","submitted":4908,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6929460580912863,"acs":10688,"articleLive":2,"columnArticles":216,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.7745391608,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":15424,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6026276648487853,"acs":7293,"articleLive":2,"columnArticles":145,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":1.1669539601,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12102,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6843490158930639,"acs":6502,"articleLive":2,"columnArticles":174,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.346310263,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9501,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.4088560885608856,"acs":2770,"articleLive":2,"columnArticles":48,"formTitle":"[1416]恢复数组","frequency":0.8052541061,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6775,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5188821444575712,"acs":12737,"articleLive":2,"columnArticles":182,"formTitle":"[1417]重新格式化字符串","frequency":0.2852225711,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24547,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7325475717125817,"acs":25793,"articleLive":2,"columnArticles":412,"formTitle":"[1418]点菜展示表","frequency":2.3447052058,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35210,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.41875033463618355,"acs":7821,"articleLive":2,"columnArticles":150,"formTitle":"[1419]数青蛙","frequency":1.4330635473,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18677,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5960248447204969,"acs":2399,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":0.5648391607,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4025,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7494407158836689,"acs":2680,"articleLive":2,"columnArticles":33,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"","submitted":3576,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5408844388819357,"acs":10372,"articleLive":2,"columnArticles":191,"formTitle":"[1422]分割字符串的最大得分","frequency":1.1349067827,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19176,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5544165932569872,"acs":34615,"articleLive":2,"columnArticles":504,"formTitle":"[1423]可获得的最大点数","frequency":0.229388925,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":62435,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.3975181344044122,"acs":6631,"articleLive":2,"columnArticles":139,"formTitle":"[1424]对角线遍历 II","frequency":1.2002681668,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16681,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.435847208619001,"acs":3115,"articleLive":2,"columnArticles":68,"formTitle":"[1425]带限制的子序列和","frequency":0.3150577195,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7147,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7095497278574963,"acs":1434,"articleLive":2,"columnArticles":48,"formTitle":"[1426]数元素","frequency":0.9053375646,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"","submitted":2021,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6588669950738916,"acs":1070,"articleLive":2,"columnArticles":44,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"","submitted":1624,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5934475055845123,"acs":797,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"","submitted":1343,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5004428697962799,"acs":1130,"articleLive":2,"columnArticles":38,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"","submitted":2258,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.584192439862543,"acs":680,"articleLive":2,"columnArticles":25,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"","submitted":1164,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8464246639151582,"acs":78136,"articleLive":2,"columnArticles":1027,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.229388925,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":92313,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3935711140466755,"acs":4469,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11355,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6440567775490302,"acs":5944,"articleLive":2,"columnArticles":101,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9229,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.46337433449605286,"acs":2524,"articleLive":2,"columnArticles":44,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5447,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6188126445643793,"acs":4013,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"","submitted":6485,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.7844058588157556,"acs":21368,"articleLive":2,"columnArticles":372,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"","submitted":27241,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5893321018299371,"acs":10209,"articleLive":2,"columnArticles":173,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.2566981044,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":17323,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.48254498676642366,"acs":32635,"articleLive":2,"columnArticles":461,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":1.5778244868,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":67631,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5614973262032086,"acs":3675,"articleLive":2,"columnArticles":56,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6545,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6988987375772227,"acs":2602,"articleLive":2,"columnArticles":35,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"","submitted":3723,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6477118675118162,"acs":17678,"articleLive":2,"columnArticles":372,"formTitle":"[1441]用栈操作构建数组","frequency":0.229388925,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":27293,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7916800293214825,"acs":34560,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":2.4197169286,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43654,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4103095837653681,"acs":5540,"articleLive":2,"columnArticles":137,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13502,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5244598450876478,"acs":2573,"articleLive":2,"columnArticles":59,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":4906,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8602892102335928,"acs":3867,"articleLive":2,"columnArticles":47,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"","submitted":4495,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5724065055591289,"acs":12459,"articleLive":2,"columnArticles":213,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":21766,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6168412144292817,"acs":5831,"articleLive":2,"columnArticles":71,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9453,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7115963855421686,"acs":9450,"articleLive":2,"columnArticles":150,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.229388925,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":13280,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6276820327793344,"acs":16353,"articleLive":2,"columnArticles":206,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":1.7133495366,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26053,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8022350493321699,"acs":23905,"articleLive":2,"columnArticles":340,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.2032094194,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":29798,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5221276148428466,"acs":9934,"articleLive":2,"columnArticles":150,"formTitle":"[1451]重新排列句子中的单词","frequency":0.2852225711,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19026,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.498645903859174,"acs":5892,"articleLive":2,"columnArticles":88,"formTitle":"[1452]收藏清单","frequency":0.229388925,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11816,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.3636567331391441,"acs":1623,"articleLive":2,"columnArticles":30,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.637073578,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4463,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.40221948212083847,"acs":4893,"articleLive":2,"columnArticles":77,"formTitle":"[1454]活跃用户","frequency":0.2852225711,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"","submitted":12165,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6327677567842424,"acs":11822,"articleLive":2,"columnArticles":201,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":18683,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5215686274509804,"acs":13034,"articleLive":2,"columnArticles":203,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":24990,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6342898597452845,"acs":7869,"articleLive":2,"columnArticles":136,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12406,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.44164814226738647,"acs":5563,"articleLive":2,"columnArticles":88,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12596,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5954446854663774,"acs":2196,"articleLive":2,"columnArticles":46,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"","submitted":3688,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7447448929241094,"acs":15093,"articleLive":2,"columnArticles":308,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":20266,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5003026372676178,"acs":5786,"articleLive":2,"columnArticles":83,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11565,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.42723762723762726,"acs":6086,"articleLive":2,"columnArticles":124,"formTitle":"[1462]课程表 IV","frequency":0.2032094194,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":14245,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5906966392165591,"acs":2654,"articleLive":2,"columnArticles":63,"formTitle":"[1463]摘樱桃 II","frequency":0.4135624901,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4493,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.768087912087912,"acs":26211,"articleLive":2,"columnArticles":363,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.7449949145,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":34125,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.30858548585485857,"acs":6272,"articleLive":2,"columnArticles":79,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20325,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4842738205365402,"acs":6282,"articleLive":2,"columnArticles":123,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":12972,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6149752945648043,"acs":1618,"articleLive":2,"columnArticles":47,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2631,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7107274969173859,"acs":2882,"articleLive":2,"columnArticles":49,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"","submitted":4055,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.8005908419497785,"acs":2168,"articleLive":2,"columnArticles":83,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"","submitted":2708,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8433934077111345,"acs":53068,"articleLive":2,"columnArticles":723,"formTitle":"[1470]重新排列数组","frequency":1.7829802886,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":62922,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5431098558049651,"acs":7307,"articleLive":2,"columnArticles":104,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13454,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6168935148118495,"acs":7705,"articleLive":2,"columnArticles":127,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":12490,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6745719776380154,"acs":15445,"articleLive":2,"columnArticles":163,"formTitle":"[1473]粉刷房子 III","frequency":2.2422615615,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":22896,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.717291507268554,"acs":1875,"articleLive":2,"columnArticles":61,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"","submitted":2614,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7206872648049119,"acs":14555,"articleLive":2,"columnArticles":225,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":20196,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8648611303026116,"acs":12518,"articleLive":2,"columnArticles":115,"formTitle":"[1476]子矩形查询","frequency":0.8372261388,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14474,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.28888354476041606,"acs":4805,"articleLive":2,"columnArticles":96,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.7745391608,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":16633,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5773743635156077,"acs":2608,"articleLive":2,"columnArticles":56,"formTitle":"[1478]安排邮筒","frequency":0.9778224174,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4517,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5660377358490566,"acs":1890,"articleLive":2,"columnArticles":39,"formTitle":"[1479]周内每天的销售情况","frequency":0.229388925,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"","submitted":3339,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8693031451333093,"acs":127778,"articleLive":2,"columnArticles":1281,"formTitle":"[1480]一维数组的动态和","frequency":1.3016309432,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":146989,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5130828149899759,"acs":9981,"articleLive":2,"columnArticles":144,"formTitle":"[1481]不同整数的最少数目","frequency":1.6098374638,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":19453,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5869128787878788,"acs":30989,"articleLive":2,"columnArticles":401,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":2.2422615615,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":52800,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.30052240857849877,"acs":3279,"articleLive":2,"columnArticles":68,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":10911,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8060796645702306,"acs":769,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"","submitted":954,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6604860486048605,"acs":3669,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"","submitted":5555,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8586875874232196,"acs":70597,"articleLive":2,"columnArticles":677,"formTitle":"[1486]数组异或操作","frequency":2.2751917678,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":82215,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.30938350875767057,"acs":7613,"articleLive":2,"columnArticles":104,"formTitle":"[1487]保证文件名唯一","frequency":1.1349067827,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24607,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.2359803791594856,"acs":7120,"articleLive":2,"columnArticles":112,"formTitle":"[1488]避免洪水泛滥","frequency":2.9036060448,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":30172,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6919565086802427,"acs":11519,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16647,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8577912254160364,"acs":1134,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"","submitted":1322,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6717497356121858,"acs":19691,"articleLive":2,"columnArticles":297,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":29313,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6646328852119958,"acs":6427,"articleLive":2,"columnArticles":77,"formTitle":"[1492]n 的第 k 个因子","frequency":0.229388925,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":9670,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.566543368309806,"acs":7505,"articleLive":2,"columnArticles":141,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":1.1349067827,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":13247,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.36791194129419613,"acs":2206,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":1.618022825,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":5996,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5429257271957074,"acs":3845,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"","submitted":7082,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5371761078231462,"acs":10801,"articleLive":2,"columnArticles":163,"formTitle":"[1496]判断路径是否相交","frequency":0.2566981044,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":20107,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3902072839984502,"acs":8057,"articleLive":2,"columnArticles":108,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.7449949145,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":20648,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.333484514707788,"acs":5147,"articleLive":2,"columnArticles":65,"formTitle":"[1498]满足条件的子序列数目","frequency":0.8052541061,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15434,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3755520729448639,"acs":2636,"articleLive":2,"columnArticles":58,"formTitle":"[1499]满足不等式的最大值","frequency":0.2852225711,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7019,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.2985938792390405,"acs":722,"articleLive":2,"columnArticles":26,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"","submitted":2418,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5912810593661657,"acs":3974,"articleLive":2,"columnArticles":58,"formTitle":"[1501]可以放心投资的国家","frequency":1.1349067827,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"","submitted":6721,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7167450477412,"acs":25147,"articleLive":2,"columnArticles":300,"formTitle":"[1502]判断能否形成等差数列","frequency":1.6098374638,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":35085,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5123310913167303,"acs":8455,"articleLive":2,"columnArticles":86,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.7745391608,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16503,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5932546101585248,"acs":7335,"articleLive":2,"columnArticles":131,"formTitle":"[1504]统计全 1 子矩形","frequency":1.4003059508,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12364,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3622658241880058,"acs":3268,"articleLive":2,"columnArticles":72,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":1.539358206,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9021,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8438948995363215,"acs":546,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":1.2002681668,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"","submitted":647,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5883262227168738,"acs":9515,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":1.4003059508,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16173,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5524933173564384,"acs":5994,"articleLive":2,"columnArticles":52,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.2566981044,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":10849,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5454841157974628,"acs":5031,"articleLive":2,"columnArticles":75,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.229388925,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9223,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5782533256217467,"acs":4999,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":1.4003059508,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8645,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6821034775233249,"acs":4021,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":0.2852225711,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"","submitted":5895,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8485457830623069,"acs":58234,"articleLive":2,"columnArticles":740,"formTitle":"[1512]好数对的数目","frequency":0.1780824693,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":68628,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.3790745856353591,"acs":10978,"articleLive":2,"columnArticles":147,"formTitle":"[1513]仅含 1 的子串数","frequency":0.2032094194,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":28960,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.31927076754662964,"acs":7583,"articleLive":2,"columnArticles":134,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":23751,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.342200328407225,"acs":3126,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9135,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5767326732673267,"acs":233,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"","submitted":404,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7332599118942731,"acs":3329,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"","submitted":4540,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6740308804204993,"acs":24621,"articleLive":2,"columnArticles":393,"formTitle":"[1518]换酒问题","frequency":0.7745391608,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":36528,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.29659819584827735,"acs":5458,"articleLive":2,"columnArticles":123,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18402,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.3322267959102377,"acs":2502,"articleLive":2,"columnArticles":70,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7531,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3959842995169082,"acs":2623,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.5648391607,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6624,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7030927835051546,"acs":682,"articleLive":2,"columnArticles":27,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"","submitted":970,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.57709977618094,"acs":9798,"articleLive":2,"columnArticles":169,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":16978,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4264614289527538,"acs":4793,"articleLive":2,"columnArticles":98,"formTitle":"[1524]和为奇数的子数组数目","frequency":1.1349067827,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":11239,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6634422110552763,"acs":5281,"articleLive":2,"columnArticles":109,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":7960,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6131531889529108,"acs":3086,"articleLive":2,"columnArticles":49,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5033,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5047853828306265,"acs":3481,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"","submitted":6896,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7848415930607712,"acs":29678,"articleLive":2,"columnArticles":354,"formTitle":"[1528]重新排列字符串","frequency":0.7745391608,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":37814,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6897952805125801,"acs":8828,"articleLive":2,"columnArticles":134,"formTitle":"[1529]灯泡开关 IV","frequency":0.2852225711,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12798,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5663047054952287,"acs":8605,"articleLive":2,"columnArticles":146,"formTitle":"[1530]好叶子节点对的数量","frequency":0.8052541061,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15195,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3252663897417374,"acs":1801,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":1.1040401347,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5537,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6183460076045627,"acs":2602,"articleLive":2,"columnArticles":46,"formTitle":"[1532]最近的三笔订单","frequency":0.229388925,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"","submitted":4208,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6135371179039302,"acs":281,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"","submitted":458,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7896328695733098,"acs":16970,"articleLive":2,"columnArticles":158,"formTitle":"[1534]统计好三元组","frequency":0.2566981044,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21491,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4526449924231988,"acs":13143,"articleLive":2,"columnArticles":181,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.2566981044,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29036,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.43919793014230274,"acs":4074,"articleLive":2,"columnArticles":77,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9276,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.36513212564400865,"acs":4394,"articleLive":2,"columnArticles":88,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12034,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.6060606060606061,"acs":120,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"","submitted":198,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5380901287553648,"acs":16048,"articleLive":2,"columnArticles":244,"formTitle":"[1539]第 k 个缺失的正整数","frequency":1.3687326889,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":29824,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.31674596880782446,"acs":4793,"articleLive":2,"columnArticles":84,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15132,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.46006793585591277,"acs":5824,"articleLive":2,"columnArticles":92,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12659,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.38170445660672403,"acs":2441,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6395,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.54909510974201,"acs":2852,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"","submitted":5194,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.545043780871127,"acs":19421,"articleLive":2,"columnArticles":316,"formTitle":"[1544]整理字符串","frequency":1.6430366354,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":35632,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5526178595367544,"acs":7420,"articleLive":2,"columnArticles":100,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.8052541061,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13427,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4127022653721683,"acs":5101,"articleLive":2,"columnArticles":77,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12360,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5354657387580299,"acs":4001,"articleLive":2,"columnArticles":69,"formTitle":"[1547]切棍子的最小成本","frequency":1.2002681668,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7472,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7151898734177216,"acs":339,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"","submitted":474,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6694748666105027,"acs":2384,"articleLive":2,"columnArticles":47,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"","submitted":3561,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6593731333899211,"acs":20974,"articleLive":2,"columnArticles":286,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.2032094194,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":31809,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8170578218701414,"acs":11036,"articleLive":2,"columnArticles":152,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.2566981044,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13507,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.509224044956576,"acs":8971,"articleLive":2,"columnArticles":123,"formTitle":"[1552]两球之间的磁力","frequency":0.7449949145,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17617,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29538093769278223,"acs":7661,"articleLive":2,"columnArticles":122,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":1.6775085444,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":25936,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7080394922425952,"acs":502,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"","submitted":709,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4357417826473201,"acs":2943,"articleLive":2,"columnArticles":56,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"","submitted":6754,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5784447476125512,"acs":10600,"articleLive":2,"columnArticles":161,"formTitle":"[1556]千位分隔数","frequency":2.1729577707,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":18325,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7656695156695157,"acs":7525,"articleLive":2,"columnArticles":103,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":9828,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6230292792792793,"acs":4426,"articleLive":2,"columnArticles":68,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.229388925,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7104,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.366637706342311,"acs":3376,"articleLive":2,"columnArticles":61,"formTitle":"[1559]二维网格图中探测环","frequency":0.4135624901,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":9208,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5742287484844403,"acs":8525,"articleLive":2,"columnArticles":89,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.229388925,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":14846,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7798507462686567,"acs":11495,"articleLive":2,"columnArticles":161,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":1.1040401347,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":14740,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.30940684800938484,"acs":4220,"articleLive":2,"columnArticles":84,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.4496796987,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13639,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.37813013632408393,"acs":3911,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":0.8052541061,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10343,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5351493848857645,"acs":609,"articleLive":2,"columnArticles":23,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"","submitted":1138,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7260748959778086,"acs":3141,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.3150577195,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"","submitted":4326,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.44632833085118573,"acs":7792,"articleLive":2,"columnArticles":119,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.229388925,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17458,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.39613261562725,"acs":11554,"articleLive":2,"columnArticles":190,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":1.1040401347,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":29167,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45537470935431945,"acs":2546,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5591,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.4723384472338447,"acs":2032,"articleLive":2,"columnArticles":45,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4302,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8970238095238096,"acs":1507,"articleLive":2,"columnArticles":37,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"","submitted":1680,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.757803599908863,"acs":3326,"articleLive":2,"columnArticles":42,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"","submitted":4389,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.805162613786914,"acs":18840,"articleLive":2,"columnArticles":318,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.7745391608,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":23399,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2954484425349087,"acs":4401,"articleLive":2,"columnArticles":64,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":14896,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.32627385196057873,"acs":4668,"articleLive":2,"columnArticles":81,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.7745391608,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14307,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.596514745308311,"acs":4005,"articleLive":2,"columnArticles":65,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":6714,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.4760318142734308,"acs":17716,"articleLive":2,"columnArticles":251,"formTitle":"[1576]替换所有的问号","frequency":0.229388925,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":37216,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3244142875432083,"acs":5068,"articleLive":2,"columnArticles":78,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.3791000859,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15622,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5815087795360937,"acs":10730,"articleLive":2,"columnArticles":201,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18452,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6197145061728395,"acs":16063,"articleLive":2,"columnArticles":294,"formTitle":"[1579]保证图可完全遍历","frequency":0.3150577195,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":25920,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6286407766990292,"acs":259,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"","submitted":412,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.809023633325376,"acs":3389,"articleLive":2,"columnArticles":44,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"","submitted":4189,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6704942586120819,"acs":9401,"articleLive":2,"columnArticles":108,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.2852225711,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14021,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6857817631646924,"acs":18584,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":2.3447052058,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27099,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6657853810264386,"acs":25686,"articleLive":2,"columnArticles":327,"formTitle":"[1584]连接所有点的最小费用","frequency":0.8372261388,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":38580,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.42935079105291873,"acs":2361,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5499,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6188034188034188,"acs":362,"articleLive":2,"columnArticles":23,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"","submitted":585,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8251730959446093,"acs":3337,"articleLive":2,"columnArticles":41,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"","submitted":4044,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8391061452513966,"acs":43558,"articleLive":2,"columnArticles":692,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.9975566543,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":51910,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2933768656716418,"acs":3774,"articleLive":2,"columnArticles":55,"formTitle":"[1589]所有排列中的最大和","frequency":0.2852225711,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":12864,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2666064166290104,"acs":3540,"articleLive":2,"columnArticles":56,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.8052541061,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13278,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5815565031982942,"acs":1091,"articleLive":2,"columnArticles":32,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1876,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.44424260181658365,"acs":7581,"articleLive":2,"columnArticles":124,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17065,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5297356828193832,"acs":5291,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.2852225711,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":9988,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3136824579990919,"acs":4145,"articleLive":2,"columnArticles":99,"formTitle":"[1594]矩阵的最大非负积","frequency":0.2566981044,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13214,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4635416666666667,"acs":1869,"articleLive":2,"columnArticles":38,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4032,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7585983127839065,"acs":2338,"articleLive":2,"columnArticles":39,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"","submitted":3082,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6635294117647059,"acs":282,"articleLive":2,"columnArticles":19,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"","submitted":425,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6715215370312985,"acs":10835,"articleLive":2,"columnArticles":148,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.229388925,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16135,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4193583587952859,"acs":3843,"articleLive":2,"columnArticles":69,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9164,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.679645444610839,"acs":16792,"articleLive":2,"columnArticles":204,"formTitle":"[1600]皇位继承顺序","frequency":0.8052541061,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24707,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.488197911938266,"acs":2151,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4406,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.784037558685446,"acs":668,"articleLive":2,"columnArticles":28,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"","submitted":852,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8445838936202003,"acs":56528,"articleLive":2,"columnArticles":452,"formTitle":"[1603]设计停车系统","frequency":1.9305227639,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":66930,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4147880973850316,"acs":3680,"articleLive":2,"columnArticles":61,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":8872,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7346128391793514,"acs":3330,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4533,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3416135881104034,"acs":1609,"articleLive":2,"columnArticles":33,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4710,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5451505016722408,"acs":2771,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"","submitted":5083,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6396839099541802,"acs":9633,"articleLive":2,"columnArticles":159,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15059,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5127383898675207,"acs":7044,"articleLive":2,"columnArticles":119,"formTitle":"[1609]奇偶树","frequency":0.229388925,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":13738,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.27123383432366305,"acs":2328,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8583,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6094622392007053,"acs":2074,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3403,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7312925170068028,"acs":430,"articleLive":2,"columnArticles":20,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"","submitted":588,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7213261648745519,"acs":1610,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"","submitted":2232,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8207509881422925,"acs":16612,"articleLive":2,"columnArticles":282,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.1780824693,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":20240,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49554839931805267,"acs":5232,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10558,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.2753905164267052,"acs":4954,"articleLive":2,"columnArticles":92,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.2852225711,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":17989,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6192005710206995,"acs":1735,"articleLive":2,"columnArticles":32,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2802,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5934489402697495,"acs":308,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"","submitted":519,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6735857877512856,"acs":7204,"articleLive":2,"columnArticles":127,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10695,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3715378729915838,"acs":2428,"articleLive":2,"columnArticles":41,"formTitle":"[1620]网络信号最好的坐标","frequency":0.346310263,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6535,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4380040322580645,"acs":1738,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":3968,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14847295474058628,"acs":2421,"articleLive":2,"columnArticles":53,"formTitle":"[1622]奇妙序列","frequency":0.8052541061,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":16306,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7828746177370031,"acs":3328,"articleLive":2,"columnArticles":42,"formTitle":"[1623]三人国家代表队","frequency":0.2566981044,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"","submitted":4251,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6262699564586357,"acs":11219,"articleLive":2,"columnArticles":194,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":1.1349067827,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":17914,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5417522884363908,"acs":2900,"articleLive":2,"columnArticles":65,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5353,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3849934797873408,"acs":3838,"articleLive":2,"columnArticles":82,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.2852225711,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":9969,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3802949482271729,"acs":2424,"articleLive":2,"columnArticles":37,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6374,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8392857142857143,"acs":376,"articleLive":2,"columnArticles":18,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"","submitted":448,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.524085150170429,"acs":8149,"articleLive":2,"columnArticles":97,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":15549,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7690857681432611,"acs":7344,"articleLive":2,"columnArticles":114,"formTitle":"[1630]等差子数组","frequency":0.229388925,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9549,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4927547660824478,"acs":24994,"articleLive":2,"columnArticles":299,"formTitle":"[1631]最小体力消耗路径","frequency":1.4330635473,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":50723,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31813198859899144,"acs":1451,"articleLive":2,"columnArticles":26,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4561,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6547589308018986,"acs":2621,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"","submitted":4003,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5222513089005235,"acs":399,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"","submitted":764,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.54443359375,"acs":1115,"articleLive":2,"columnArticles":30,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.4135624901,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"","submitted":2048,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7065009560229446,"acs":8868,"articleLive":2,"columnArticles":172,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.229388925,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12552,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8063331803579624,"acs":5271,"articleLive":2,"columnArticles":70,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6537,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7093142272262026,"acs":2772,"articleLive":2,"columnArticles":46,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.346310263,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3908,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4035714285714286,"acs":1243,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3080,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6612376133248998,"acs":12545,"articleLive":2,"columnArticles":215,"formTitle":"[1640]能否连接形成数组","frequency":0.2032094194,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":18972,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7700455800218271,"acs":11995,"articleLive":2,"columnArticles":273,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":1.8164805182,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15577,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.45108656929105806,"acs":6331,"articleLive":2,"columnArticles":103,"formTitle":"[1642]可以到达的最远建筑","frequency":0.2852225711,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14035,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4507042253521127,"acs":2208,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":4899,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5407368967306694,"acs":1042,"articleLive":2,"columnArticles":22,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.3150577195,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"","submitted":1927,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.41189073379753616,"acs":769,"articleLive":2,"columnArticles":24,"formTitle":"[1645]Hopper Company Queries II","frequency":0.4496796987,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"","submitted":1867,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5369626793662652,"acs":34502,"articleLive":2,"columnArticles":354,"formTitle":"[1646]获取生成数组中的最大值","frequency":1.0177797904,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":64254,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.513199653779573,"acs":7115,"articleLive":2,"columnArticles":104,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.8052541061,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":13864,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2772623697916667,"acs":3407,"articleLive":2,"columnArticles":87,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.9053375646,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12288,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4741020793950851,"acs":2508,"articleLive":2,"columnArticles":63,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5290,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7912984364377974,"acs":1164,"articleLive":2,"columnArticles":28,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.3150577195,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"","submitted":1471,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6869565217391305,"acs":711,"articleLive":2,"columnArticles":23,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"","submitted":1035,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6597445646875305,"acs":6767,"articleLive":2,"columnArticles":175,"formTitle":"[1652]拆炸弹","frequency":0.7449949145,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":10257,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5042517006802721,"acs":3558,"articleLive":2,"columnArticles":84,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.229388925,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7056,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.27366539367839443,"acs":3368,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":0.8052541061,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":12307,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.38608087091757387,"acs":1986,"articleLive":2,"columnArticles":32,"formTitle":"[1655]分配重复整数","frequency":0.3150577195,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5144,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7809369624607913,"acs":7718,"articleLive":2,"columnArticles":90,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":9883,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.4645161290322581,"acs":5400,"articleLive":2,"columnArticles":75,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.2566981044,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11625,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.29828001375988994,"acs":8671,"articleLive":2,"columnArticles":150,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.2032094194,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":29070,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.41112828438948995,"acs":1330,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.637073578,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3235,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7388781431334622,"acs":382,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"","submitted":517,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7256850346281241,"acs":2410,"articleLive":2,"columnArticles":53,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.8705514485,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"","submitted":3321,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8118756493247024,"acs":20318,"articleLive":2,"columnArticles":278,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.7745391608,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":25026,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5720656035069156,"acs":7569,"articleLive":2,"columnArticles":130,"formTitle":"[1663]具有给定数值的最小字符串","frequency":1.2710942194,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13231,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5451388888888888,"acs":5338,"articleLive":2,"columnArticles":106,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9792,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6653706583722135,"acs":5134,"articleLive":2,"columnArticles":80,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.2852225711,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7716,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6967930029154519,"acs":239,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"","submitted":343,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6019585253456221,"acs":2090,"articleLive":2,"columnArticles":32,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"","submitted":3472,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.441669449081803,"acs":6614,"articleLive":2,"columnArticles":127,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":14975,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7609747137696687,"acs":12429,"articleLive":2,"columnArticles":227,"formTitle":"[1669]合并两个链表","frequency":0.229388925,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":16333,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.528277960943444,"acs":4166,"articleLive":2,"columnArticles":76,"formTitle":"[1670]设计前中后队列","frequency":0.229388925,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":7886,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46550925925925923,"acs":2011,"articleLive":2,"columnArticles":38,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.2852225711,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4320,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8503867010400925,"acs":38264,"articleLive":2,"columnArticles":440,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":44996,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.3520064510008538,"acs":7421,"articleLive":2,"columnArticles":165,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.2032094194,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21082,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3624042427813789,"acs":2460,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.2566981044,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6788,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.434826883910387,"acs":2562,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":5892,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7583826429980276,"acs":769,"articleLive":2,"columnArticles":21,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.3150577195,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"","submitted":1014,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.39344262295081966,"acs":1920,"articleLive":2,"columnArticles":31,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"","submitted":4880,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8303210920976736,"acs":17274,"articleLive":2,"columnArticles":280,"formTitle":"[1678]设计 Goal 解析器","frequency":0.1780824693,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":20804,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4963620488940629,"acs":6822,"articleLive":2,"columnArticles":109,"formTitle":"[1679]K 和数对的最大数目","frequency":0.2032094194,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":13744,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4631816602987148,"acs":5334,"articleLive":2,"columnArticles":70,"formTitle":"[1680]连接连续二进制数字","frequency":0.2852225711,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11516,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38480392156862747,"acs":2355,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6120,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5255102040816326,"acs":309,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"","submitted":588,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8956498532159061,"acs":3356,"articleLive":2,"columnArticles":36,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"","submitted":3747,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.828082808280828,"acs":16560,"articleLive":2,"columnArticles":351,"formTitle":"[1684]统计一致字符串的数目","frequency":0.229388925,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":19998,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.597915977505789,"acs":3615,"articleLive":2,"columnArticles":82,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6046,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4687782805429864,"acs":2590,"articleLive":2,"columnArticles":47,"formTitle":"[1686]石子游戏 VI","frequency":0.229388925,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5525,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.4019607843137255,"acs":943,"articleLive":2,"columnArticles":21,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2346,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8051156128504194,"acs":19673,"articleLive":2,"columnArticles":263,"formTitle":"[1688]比赛中的配对次数","frequency":0.2032094194,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":24435,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8668029091783375,"acs":14421,"articleLive":2,"columnArticles":187,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.7449949145,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":16637,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.516904129437334,"acs":4281,"articleLive":2,"columnArticles":106,"formTitle":"[1690]石子游戏 VII","frequency":0.2852225711,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8282,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.48733535967578523,"acs":2405,"articleLive":2,"columnArticles":62,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":4935,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6297709923664122,"acs":165,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"","submitted":262,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8016254155892132,"acs":2170,"articleLive":2,"columnArticles":33,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"","submitted":2707,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6352715441728539,"acs":7615,"articleLive":2,"columnArticles":135,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":11987,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.45941015506232896,"acs":6044,"articleLive":2,"columnArticles":128,"formTitle":"[1695]删除子数组的最大得分","frequency":0.2032094194,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":13156,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.39743422766345404,"acs":6103,"articleLive":2,"columnArticles":109,"formTitle":"[1696]跳跃游戏 VI","frequency":1.1349067827,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":15356,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5251518833535844,"acs":2161,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4115,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5395858708891595,"acs":443,"articleLive":2,"columnArticles":16,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"","submitted":821,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8018147086914995,"acs":1679,"articleLive":2,"columnArticles":41,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"","submitted":2094,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7110216312388801,"acs":7593,"articleLive":2,"columnArticles":178,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.2566981044,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":10679,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6103750997605746,"acs":3824,"articleLive":2,"columnArticles":78,"formTitle":"[1701]平均等待时间","frequency":0.8052541061,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6265,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4756801319043693,"acs":2885,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.9053375646,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6065,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.385771235817234,"acs":1258,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3261,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7815587985079511,"acs":11943,"articleLive":2,"columnArticles":182,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":15281,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.34723498070916775,"acs":5670,"articleLive":2,"columnArticles":118,"formTitle":"[1705]吃苹果的最大数目","frequency":0.229388925,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16329,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.583585372559802,"acs":4245,"articleLive":2,"columnArticles":110,"formTitle":"[1706]球会落何处","frequency":0.8052541061,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7274,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5030292230933714,"acs":14115,"articleLive":2,"columnArticles":150,"formTitle":"[1707]与数组中元素的最大异或值","frequency":1.887398695,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28060,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6984496124031008,"acs":901,"articleLive":2,"columnArticles":24,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"","submitted":1290,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7120418848167539,"acs":1360,"articleLive":2,"columnArticles":35,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"","submitted":1910,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6942663378545006,"acs":11261,"articleLive":2,"columnArticles":181,"formTitle":"[1710]卡车上的最大单元数","frequency":1.1040401347,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":16220,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.35895288459237634,"acs":30002,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":2.3679365961,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":83582,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.2626518435850109,"acs":6119,"articleLive":2,"columnArticles":104,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.2852225711,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":23297,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.49679538280029334,"acs":15580,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":2.2422615615,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31361,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6388140161725068,"acs":237,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"","submitted":371,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7374712643678161,"acs":1604,"articleLive":2,"columnArticles":36,"formTitle":"[1715]苹果和橘子的个数","frequency":0.8052541061,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"","submitted":2175,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6734506631078488,"acs":8074,"articleLive":2,"columnArticles":189,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":11989,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43149038461538464,"acs":2154,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.2566981044,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":4992,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4883720930232558,"acs":1911,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":3913,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3669235328986366,"acs":619,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1687,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8692724399969904,"acs":46214,"articleLive":2,"columnArticles":483,"formTitle":"[1720]解码异或后的数组","frequency":2.7345706405,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53164,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6458512599877074,"acs":10508,"articleLive":2,"columnArticles":165,"formTitle":"[1721]交换链表中的节点","frequency":0.229388925,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":16270,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5145323426573427,"acs":4709,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9152,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5072240670287863,"acs":23065,"articleLive":2,"columnArticles":175,"formTitle":"[1723]完成所有工作的最短时间","frequency":3.5344585992,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":45473,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5598650927487352,"acs":332,"articleLive":2,"columnArticles":10,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"","submitted":593,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7884629698548568,"acs":10593,"articleLive":2,"columnArticles":141,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.229388925,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13435,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4788732394366197,"acs":5474,"articleLive":2,"columnArticles":106,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11431,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5751102068497795,"acs":3392,"articleLive":2,"columnArticles":83,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.2852225711,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5898,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.35614206581948515,"acs":1093,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3069,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6230605415272285,"acs":2048,"articleLive":2,"columnArticles":21,"formTitle":"[1729]求关注者的数量","frequency":0.2566981044,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"","submitted":3287,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.535483870967742,"acs":581,"articleLive":2,"columnArticles":23,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"","submitted":1085,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.4719891745602165,"acs":1744,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"","submitted":3695,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.792687908496732,"acs":11643,"articleLive":2,"columnArticles":199,"formTitle":"[1732]找到最高海拔","frequency":1.4003059508,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":14688,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.45963828848698723,"acs":2084,"articleLive":2,"columnArticles":54,"formTitle":"[1733]需要教语言的最少人数","frequency":0.2566981044,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4534,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7232272444536596,"acs":27905,"articleLive":2,"columnArticles":366,"formTitle":"[1734]解码异或后的排列","frequency":2.6736376134,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38584,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4846153846153846,"acs":1008,"articleLive":2,"columnArticles":25,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2080,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4490409095940668,"acs":28396,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":2.026373181,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":63237,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.30968693088197036,"acs":3571,"articleLive":2,"columnArticles":101,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.3150577195,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11531,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6543369407204006,"acs":28357,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":1.8665711172,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43337,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.47147413182140324,"acs":2661,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5644,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7,"acs":546,"articleLive":2,"columnArticles":17,"formTitle":"[1740]找到二叉树中的距离","frequency":0.4496796987,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"","submitted":780,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8451193058568329,"acs":1948,"articleLive":2,"columnArticles":31,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"","submitted":2305,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.708130705571197,"acs":8300,"articleLive":2,"columnArticles":128,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.2032094194,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11721,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6969469469469469,"acs":22280,"articleLive":2,"columnArticles":326,"formTitle":"[1743]从相邻元素对还原数组","frequency":1.9992344734,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":31968,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36276083467094705,"acs":28250,"articleLive":2,"columnArticles":367,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":2.6379704946,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":77875,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4844729552412888,"acs":3323,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":0.2852225711,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":6859,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5864045864045864,"acs":716,"articleLive":2,"columnArticles":29,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.2566981044,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"","submitted":1221,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7043774872086412,"acs":1239,"articleLive":2,"columnArticles":34,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"","submitted":1759,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7496349857470626,"acs":10782,"articleLive":2,"columnArticles":216,"formTitle":"[1748]唯一元素的和","frequency":0.8052541061,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":14383,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5313570683747951,"acs":3567,"articleLive":2,"columnArticles":84,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.2566981044,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6713,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.45842309349418353,"acs":3192,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":6963,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4727838258164852,"acs":2128,"articleLive":2,"columnArticles":32,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.8705514485,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4501,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6826909090909091,"acs":9387,"articleLive":2,"columnArticles":111,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.229388925,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":13750,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.628482972136223,"acs":5887,"articleLive":2,"columnArticles":126,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9367,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.42124542124542125,"acs":4140,"articleLive":2,"columnArticles":90,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.2852225711,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":9828,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4006076388888889,"acs":2769,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.346310263,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":6912,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8192488262910798,"acs":349,"articleLive":2,"columnArticles":13,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"","submitted":426,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9229067930489732,"acs":2921,"articleLive":2,"columnArticles":31,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"","submitted":3165,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6378437047756874,"acs":7052,"articleLive":2,"columnArticles":114,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11056,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.42839587862746953,"acs":4532,"articleLive":2,"columnArticles":95,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.3150577195,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10579,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5388139808875507,"acs":4116,"articleLive":2,"columnArticles":77,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7639,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4289806234203875,"acs":2546,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.4857969074,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":5935,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.681087762669963,"acs":551,"articleLive":2,"columnArticles":20,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"","submitted":809,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6090458488228006,"acs":3932,"articleLive":2,"columnArticles":79,"formTitle":"[1763]最长的美好子字符串","frequency":0.229388925,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":6456,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4769392033542977,"acs":2275,"articleLive":2,"columnArticles":54,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4770,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5522294979731837,"acs":3542,"articleLive":2,"columnArticles":82,"formTitle":"[1765]地图中的最高点","frequency":0.7745391608,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6414,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37544145612605273,"acs":1382,"articleLive":2,"columnArticles":25,"formTitle":"[1766]互质树","frequency":0.521914116,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3681,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7823936696340257,"acs":791,"articleLive":2,"columnArticles":21,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"","submitted":1011,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7640758033507278,"acs":11128,"articleLive":2,"columnArticles":201,"formTitle":"[1768]交替合并字符串","frequency":0.7745391608,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":14564,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8555201789863178,"acs":9942,"articleLive":2,"columnArticles":168,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11621,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.36944696282864914,"acs":4075,"articleLive":2,"columnArticles":100,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.4496796987,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11030,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3653048196616661,"acs":2289,"articleLive":2,"columnArticles":46,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6266,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5200642054574639,"acs":324,"articleLive":2,"columnArticles":10,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"","submitted":623,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8423718871647203,"acs":15797,"articleLive":2,"columnArticles":198,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":1.0742760328,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":18753,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5521592821088054,"acs":5907,"articleLive":2,"columnArticles":89,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.2566981044,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10698,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4746486790331647,"acs":4222,"articleLive":2,"columnArticles":91,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.3150577195,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":8895,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4627545551982851,"acs":1727,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":1.2710942194,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3732,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7811320754716982,"acs":5175,"articleLive":2,"columnArticles":59,"formTitle":"[1777]每家商店的产品价格","frequency":2.6379704946,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"","submitted":6625,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5119047619047619,"acs":172,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"","submitted":336,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6473144236572118,"acs":5363,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.229388925,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8285,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6634889191531509,"acs":5359,"articleLive":2,"columnArticles":108,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8077,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5178159446295821,"acs":4040,"articleLive":2,"columnArticles":59,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.346310263,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7802,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.28786013297217433,"acs":1169,"articleLive":2,"columnArticles":32,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4061,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7971830985915493,"acs":1132,"articleLive":2,"columnArticles":29,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"","submitted":1420,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42098896845364814,"acs":8701,"articleLive":2,"columnArticles":100,"formTitle":"[1784]检查二进制字符串字段","frequency":0.229388925,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":20668,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.34889882430866037,"acs":6321,"articleLive":2,"columnArticles":61,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18117,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3402228976697062,"acs":3358,"articleLive":2,"columnArticles":87,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9870,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.654303084388421,"acs":11731,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":2.8571847678,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":17929,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6934865900383141,"acs":181,"articleLive":2,"columnArticles":14,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"","submitted":261,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7086383601756955,"acs":1452,"articleLive":2,"columnArticles":29,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"","submitted":2049,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6475788627687362,"acs":12892,"articleLive":2,"columnArticles":142,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":19908,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.809937369519833,"acs":9699,"articleLive":2,"columnArticles":136,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":11975,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5129757785467128,"acs":6523,"articleLive":2,"columnArticles":104,"formTitle":"[1792]最大平均通过率","frequency":1.6430366354,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12716,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4131929522990975,"acs":3846,"articleLive":2,"columnArticles":92,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9308,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.6909090909090909,"acs":152,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"","submitted":220,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7904717853839038,"acs":1709,"articleLive":2,"columnArticles":28,"formTitle":"[1795]每个产品在不同商店的价格","frequency":1.1349067827,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"","submitted":2162,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.4874364112841067,"acs":6324,"articleLive":2,"columnArticles":119,"formTitle":"[1796]字符串中第二大的数字","frequency":0.2032094194,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":12974,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.575521183591123,"acs":4279,"articleLive":2,"columnArticles":69,"formTitle":"[1797]设计一个验证系统","frequency":0.7449949145,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":7435,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5212068965517241,"acs":3023,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5800,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5178571428571429,"acs":2291,"articleLive":2,"columnArticles":35,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.3150577195,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4424,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6836158192090396,"acs":9559,"articleLive":2,"columnArticles":155,"formTitle":"[1800]最大升序子数组和","frequency":0.229388925,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":13983,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.3776328052190121,"acs":4052,"articleLive":2,"columnArticles":108,"formTitle":"[1801]积压订单中的订单总数","frequency":0.346310263,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10730,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.26226283393616345,"acs":4133,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":15759,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.4088612514574427,"acs":2104,"articleLive":2,"columnArticles":54,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.4496796987,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5146,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5720053835800808,"acs":425,"articleLive":2,"columnArticles":25,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.346310263,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"","submitted":743,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4901650165016502,"acs":11139,"articleLive":2,"columnArticles":145,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.229388925,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":22725,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6632560549151665,"acs":5121,"articleLive":2,"columnArticles":80,"formTitle":"[1806]还原排列的最少操作步数","frequency":1.2710942194,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7721,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5849585062240664,"acs":5639,"articleLive":2,"columnArticles":86,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9640,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2675060746631323,"acs":2422,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.5648391607,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9054,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6322941646682654,"acs":1582,"articleLive":2,"columnArticles":31,"formTitle":"[1809]没有广告的剧集","frequency":1.1669539601,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"","submitted":2502,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6298932384341637,"acs":177,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":1.0177797904,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"","submitted":281,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6635354397950469,"acs":777,"articleLive":2,"columnArticles":26,"formTitle":"[1811]寻找面试候选人","frequency":0.2852225711,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"","submitted":1171,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7943204868154158,"acs":7832,"articleLive":2,"columnArticles":183,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":9860,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.514257907542579,"acs":5284,"articleLive":2,"columnArticles":71,"formTitle":"[1813]句子相似性 III","frequency":1.3088345473,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10275,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.34320522979397783,"acs":3465,"articleLive":2,"columnArticles":78,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.229388925,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10096,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.29911373707533234,"acs":1620,"articleLive":2,"columnArticles":38,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5416,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7521095484826055,"acs":10161,"articleLive":2,"columnArticles":150,"formTitle":"[1816]截断句子","frequency":0.229388925,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":13510,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6971814306016106,"acs":5887,"articleLive":2,"columnArticles":95,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.229388925,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8444,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3741825294873292,"acs":25633,"articleLive":2,"columnArticles":337,"formTitle":"[1818]绝对差值和","frequency":2.2069720845,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":68504,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.366158781074579,"acs":2283,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6235,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5,"acs":93,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"","submitted":186,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9011904761904762,"acs":2271,"articleLive":2,"columnArticles":21,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":1.1669539601,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"","submitted":2520,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8118170947923968,"acs":19689,"articleLive":2,"columnArticles":196,"formTitle":"[1822]数组元素积的符号","frequency":0.7449949145,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":24253,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.710840132699722,"acs":7928,"articleLive":2,"columnArticles":97,"formTitle":"[1823]找出游戏的获胜者","frequency":1.0742760328,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":11153,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6584298584298585,"acs":7674,"articleLive":2,"columnArticles":152,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11655,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.28569872562901644,"acs":2623,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.3791000859,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9181,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4381818181818182,"acs":241,"articleLive":2,"columnArticles":20,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"","submitted":550,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7947363864600467,"acs":9180,"articleLive":2,"columnArticles":137,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":11551,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.869111162682757,"acs":7490,"articleLive":2,"columnArticles":99,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.7449949145,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8618,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6805990943921978,"acs":3908,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5742,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4844290657439446,"acs":840,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1734,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7421383647798742,"acs":826,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"","submitted":1113,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8228822182650725,"acs":12939,"articleLive":2,"columnArticles":208,"formTitle":"[1832]判断句子是否为全字母句","frequency":1.1040401347,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":15724,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6848964907851552,"acs":43406,"articleLive":2,"columnArticles":389,"formTitle":"[1833]雪糕的最大数量","frequency":1.3687326889,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":63376,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3509540381615265,"acs":5849,"articleLive":2,"columnArticles":124,"formTitle":"[1834]单线程 CPU","frequency":1.4003059508,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":16666,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5090754395916052,"acs":3590,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.4135624901,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7052,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7110266159695817,"acs":374,"articleLive":2,"columnArticles":27,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.9417052088,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"","submitted":526,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7950481430536451,"acs":7514,"articleLive":2,"columnArticles":85,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.229388925,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9451,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42971327454861735,"acs":28655,"articleLive":2,"columnArticles":301,"formTitle":"[1838]最高频元素的频数","frequency":2.8048011031,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":66684,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5753167945743352,"acs":6447,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11206,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.38822115384615385,"acs":1938,"articleLive":2,"columnArticles":46,"formTitle":"[1840]最高建筑高度","frequency":0.4135624901,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":4992,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5179584120982986,"acs":822,"articleLive":2,"columnArticles":27,"formTitle":"[1841]联赛信息统计","frequency":1.2002681668,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"","submitted":1587,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6815286624203821,"acs":107,"articleLive":2,"columnArticles":10,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"","submitted":157,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5127978817299206,"acs":581,"articleLive":2,"columnArticles":22,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.229388925,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"","submitted":1133,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8012519561815337,"acs":6656,"articleLive":2,"columnArticles":110,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":8307,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5474347434743474,"acs":6082,"articleLive":2,"columnArticles":58,"formTitle":"[1845]座位预约管理系统","frequency":0.2032094194,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":11110,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6336846484537512,"acs":27417,"articleLive":2,"columnArticles":374,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":1.9305227639,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43266,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3602767730775279,"acs":2291,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.2852225711,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6359,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6832415846945221,"acs":7571,"articleLive":2,"columnArticles":99,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11081,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.32904564315352697,"acs":5551,"articleLive":2,"columnArticles":108,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.2852225711,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":16870,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6064718162839249,"acs":2324,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.346310263,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3832,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40171814276948253,"acs":1964,"articleLive":2,"columnArticles":47,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4889,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7096774193548387,"acs":176,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"","submitted":248,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6464989802855201,"acs":951,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.2852225711,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"","submitted":1471,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7906303823630727,"acs":11476,"articleLive":2,"columnArticles":118,"formTitle":"[1854]人口最多的年份","frequency":1.1349067827,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":14515,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6862485957840481,"acs":10385,"articleLive":2,"columnArticles":99,"formTitle":"[1855]下标对中的最大距离","frequency":1.0742760328,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15133,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.3555827220863896,"acs":4363,"articleLive":2,"columnArticles":81,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.8052541061,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12270,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.44970414201183434,"acs":2128,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4732,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6511627906976745,"acs":308,"articleLive":2,"columnArticles":16,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.6009563694,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"","submitted":473,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7704766311892642,"acs":6660,"articleLive":2,"columnArticles":144,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":8644,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7713504006253664,"acs":3947,"articleLive":2,"columnArticles":64,"formTitle":"[1860]增长的内存泄露","frequency":0.229388925,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5117,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6175465248765667,"acs":3252,"articleLive":2,"columnArticles":67,"formTitle":"[1861]旋转盒子","frequency":0.2852225711,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5266,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.31083556432295334,"acs":2206,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7097,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9135811611374408,"acs":12337,"articleLive":2,"columnArticles":139,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":1.9642413999,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":13504,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.38684281965432993,"acs":4275,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.2852225711,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11051,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5138219380226267,"acs":5223,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.2032094194,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10165,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5960591133004927,"acs":2178,"articleLive":2,"columnArticles":48,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":0.9778224174,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3654,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7400346620450606,"acs":427,"articleLive":2,"columnArticles":14,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"","submitted":577,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5416666666666666,"acs":130,"articleLive":2,"columnArticles":10,"formTitle":"[1868]两个行程编码数组的积","frequency":0.637073578,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"","submitted":240,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7914377723053608,"acs":12534,"articleLive":2,"columnArticles":135,"formTitle":"[1869]哪种连续子字符串更长","frequency":1.4003059508,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":15837,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.45866056520932535,"acs":7417,"articleLive":2,"columnArticles":70,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.3150577195,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16171,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27665665477754836,"acs":5895,"articleLive":2,"columnArticles":125,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":21308,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6207970112079702,"acs":1994,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3212,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8064791133844842,"acs":1892,"articleLive":2,"columnArticles":30,"formTitle":"[1873]计算特殊奖金","frequency":1.5778244868,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"","submitted":2346,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8848684210526315,"acs":269,"articleLive":2,"columnArticles":16,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"","submitted":304,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7415506958250497,"acs":373,"articleLive":2,"columnArticles":18,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"","submitted":503,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7285534591194969,"acs":5792,"articleLive":2,"columnArticles":91,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":7950,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8187183356688584,"acs":30381,"articleLive":2,"columnArticles":400,"formTitle":"[1877]数组中最大数对和的最小值","frequency":2.5310310906,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":37108,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.42770105605199027,"acs":2106,"articleLive":2,"columnArticles":54,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":4924,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.41081081081081083,"acs":1824,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.346310263,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4440,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7710920089143585,"acs":7266,"articleLive":2,"columnArticles":95,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.2032094194,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":9423,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3532252295218791,"acs":5925,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":16774,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2778078798668628,"acs":3589,"articleLive":2,"columnArticles":109,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":12919,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.37467419635099913,"acs":1725,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4604,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6929577464788732,"acs":1722,"articleLive":2,"columnArticles":35,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":1.5469196787,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":2485,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5264423076923077,"acs":219,"articleLive":2,"columnArticles":10,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"","submitted":416,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5713822193380922,"acs":5283,"articleLive":2,"columnArticles":76,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.7745391608,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9246,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6440005122294788,"acs":5029,"articleLive":2,"columnArticles":62,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.229388925,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7809,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3154068090017311,"acs":2733,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.3150577195,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8665,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2715318869165023,"acs":2065,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.8705514485,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7605,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7044897959183674,"acs":863,"articleLive":2,"columnArticles":19,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"","submitted":1225,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.5148063781321185,"acs":226,"articleLive":2,"columnArticles":10,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"","submitted":439,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.32806621519939805,"acs":436,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.3150577195,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"","submitted":1329,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5915345923887254,"acs":31165,"articleLive":2,"columnArticles":408,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":2.1401320664,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":52685,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.45851800986328733,"acs":36725,"articleLive":2,"columnArticles":509,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.5359395914,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":80095,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5286389910667367,"acs":2012,"articleLive":2,"columnArticles":39,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3806,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5042424242424243,"acs":832,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1650,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5305294066845151,"acs":6143,"articleLive":2,"columnArticles":76,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.7745391608,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11579,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.30893996463986473,"acs":4019,"articleLive":2,"columnArticles":61,"formTitle":"[1898]可移除字符的最大数目","frequency":0.346310263,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13009,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6298085216491288,"acs":3651,"articleLive":2,"columnArticles":42,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5797,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.43251859723698194,"acs":1221,"articleLive":2,"columnArticles":33,"formTitle":"[1900]最佳运动员的比拼回合","frequency":1.5268969855,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2823,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6565040650406504,"acs":646,"articleLive":2,"columnArticles":24,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":984,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.43670886075949367,"acs":69,"articleLive":2,"columnArticles":3,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"","submitted":158,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6439326044093924,"acs":7185,"articleLive":2,"columnArticles":101,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":11158,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.27779610689541406,"acs":3368,"articleLive":2,"columnArticles":69,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":12124,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5702005730659025,"acs":4577,"articleLive":2,"columnArticles":90,"formTitle":"[1905]统计子岛屿","frequency":0.2032094194,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":8027,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.42320289605240474,"acs":2455,"articleLive":2,"columnArticles":54,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.8372261388,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5801,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.596100278551532,"acs":428,"articleLive":2,"columnArticles":17,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"","submitted":718,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6906077348066298,"acs":125,"articleLive":2,"columnArticles":6,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"","submitted":181,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.32663206374734993,"acs":4468,"articleLive":2,"columnArticles":71,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.346310263,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":13679,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.674914350970689,"acs":3546,"articleLive":2,"columnArticles":56,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5254,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5716885007278021,"acs":3142,"articleLive":2,"columnArticles":68,"formTitle":"[1911]最大子序列交替和","frequency":0.7449949145,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5496,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2785140937091656,"acs":1492,"articleLive":2,"columnArticles":37,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":5357,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.841556183438383,"acs":7744,"articleLive":2,"columnArticles":80,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.7745391608,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":9202,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.442169341449917,"acs":3196,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.8705514485,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7228,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.391025641025641,"acs":2806,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7176,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5485110470701249,"acs":1142,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":1.0177797904,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2082,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.2828402366863905,"acs":239,"articleLive":2,"columnArticles":9,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"","submitted":845,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.47280334728033474,"acs":113,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"","submitted":239,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.38687782805429866,"acs":342,"articleLive":2,"columnArticles":11,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"","submitted":884,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9206682577565632,"acs":9644,"articleLive":2,"columnArticles":82,"formTitle":"[1920]基于排列构建数组","frequency":0.229388925,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":10475,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.34360564449788017,"acs":5430,"articleLive":2,"columnArticles":87,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.8052541061,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":15803,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.361523869743914,"acs":4574,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.2032094194,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12652,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23708010335917312,"acs":1468,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":1.3088345473,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6192,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.40458015267175573,"acs":53,"articleLive":2,"columnArticles":4,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"","submitted":131,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6978361669242659,"acs":4515,"articleLive":2,"columnArticles":55,"formTitle":"[1925]统计平方和三元组的数目","frequency":1.4003059508,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":6470,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.34311800510504614,"acs":3495,"articleLive":2,"columnArticles":57,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10186,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4126908396946565,"acs":1730,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":0.346310263,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4192,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.3963570127504554,"acs":2176,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":1.4670920091,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5490,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9207605679778031,"acs":11283,"articleLive":2,"columnArticles":98,"formTitle":"[1929]数组串联","frequency":1.0742760328,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":12254,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.47666519629466253,"acs":5403,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.7745391608,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11335,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5570789031897034,"acs":1991,"articleLive":2,"columnArticles":62,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.4135624901,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3574,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3252307692307692,"acs":1057,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.9417052088,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3250,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.557510148849797,"acs":412,"articleLive":2,"columnArticles":23,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.4857969074,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"","submitted":739,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7557755775577558,"acs":229,"articleLive":2,"columnArticles":10,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"","submitted":303,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7395178795841426,"acs":6473,"articleLive":2,"columnArticles":91,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":8753,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.4490789580459304,"acs":5534,"articleLive":2,"columnArticles":59,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12323,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.2422131789012365,"acs":3095,"articleLive":2,"columnArticles":62,"formTitle":"[1937]扣分后的最大得分","frequency":0.7745391608,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":12778,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3411402157164869,"acs":1107,"articleLive":2,"columnArticles":40,"formTitle":"[1938]查询最大基因差","frequency":1.0597851257,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3245,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6194398682042833,"acs":376,"articleLive":2,"columnArticles":12,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"","submitted":607,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.8037383177570093,"acs":344,"articleLive":2,"columnArticles":23,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"","submitted":428,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7733676975945017,"acs":4501,"articleLive":2,"columnArticles":82,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":5820,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.38522278623801465,"acs":2732,"articleLive":2,"columnArticles":65,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7092,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.40607000443066016,"acs":1833,"articleLive":2,"columnArticles":49,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4514,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5717344753747323,"acs":1869,"articleLive":2,"columnArticles":48,"formTitle":"[1944]队列中可以看到的人数","frequency":0.2566981044,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3269,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6627459144373894,"acs":6367,"articleLive":2,"columnArticles":70,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.229388925,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":9607,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30327348305525087,"acs":5253,"articleLive":2,"columnArticles":78,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.7745391608,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17321,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5409184372858122,"acs":3946,"articleLive":2,"columnArticles":85,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7295,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5141304347826087,"acs":946,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.6009563694,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1840,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.520891364902507,"acs":187,"articleLive":2,"columnArticles":11,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"","submitted":359,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.547945205479452,"acs":120,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"","submitted":219,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6945244956772334,"acs":241,"articleLive":2,"columnArticles":12,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"","submitted":347,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5434464836771155,"acs":6692,"articleLive":2,"columnArticles":77,"formTitle":"[1952]三除数","frequency":0.229388925,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":12314,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3242802824551874,"acs":4179,"articleLive":2,"columnArticles":82,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":12887,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.48019392219463164,"acs":4061,"articleLive":2,"columnArticles":66,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.2566981044,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8457,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4950648345268047,"acs":2558,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5167,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4429530201342282,"acs":132,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":1.1040401347,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"","submitted":298,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6114471160938192,"acs":4145,"articleLive":2,"columnArticles":55,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":6779,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.4220689655172414,"acs":2448,"articleLive":2,"columnArticles":43,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5800,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.41242450388265744,"acs":1434,"articleLive":2,"columnArticles":31,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3477,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.28378378378378377,"acs":588,"articleLive":2,"columnArticles":18,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.9417052088,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2072,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5357993332274964,"acs":6750,"articleLive":2,"columnArticles":61,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.1780824693,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":12598,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.426483300589391,"acs":5427,"articleLive":2,"columnArticles":73,"formTitle":"[1962]移除石子使总数最小","frequency":0.8372261388,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":12725,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6131751929122606,"acs":4291,"articleLive":2,"columnArticles":54,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.2566981044,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":6998,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.38296812749003983,"acs":3076,"articleLive":2,"columnArticles":45,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8032,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.76,"acs":285,"articleLive":2,"columnArticles":11,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"","submitted":375,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7291666666666666,"acs":35,"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":"","submitted":48,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7766185125735687,"acs":5806,"articleLive":2,"columnArticles":55,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":7476,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.35556776269324336,"acs":4531,"articleLive":2,"columnArticles":65,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":12743,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.27798254122211447,"acs":2866,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":1.1349067827,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10310,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4799731483553368,"acs":2145,"articleLive":2,"columnArticles":48,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":0.8705514485,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4469,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5607638888888888,"acs":323,"articleLive":2,"columnArticles":17,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":576,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4750830564784053,"acs":143,"articleLive":2,"columnArticles":6,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.3150577195,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"","submitted":301,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5233644859813084,"acs":56,"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":"","submitted":107,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7498983326555511,"acs":3688,"articleLive":2,"columnArticles":53,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.229388925,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":4918,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.38071625344352616,"acs":2764,"articleLive":2,"columnArticles":45,"formTitle":"[1975]最大方阵和","frequency":0.6891144561,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":7260,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.28282208588957053,"acs":1844,"articleLive":2,"columnArticles":35,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":6520,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.2473266643670231,"acs":717,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":2899,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5502958579881657,"acs":186,"articleLive":2,"columnArticles":7,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.2852225711,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"","submitted":338,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8189156626506024,"acs":6797,"articleLive":2,"columnArticles":74,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":8300,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.579353643474681,"acs":5629,"articleLive":2,"columnArticles":90,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.6891144561,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":9716,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.2965025466893039,"acs":4366,"articleLive":2,"columnArticles":82,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":1.0742760328,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":14725,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4570938215102975,"acs":799,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.2852225711,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1748,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6461538461538462,"acs":42,"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":"","submitted":65,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5788416825195519,"acs":5477,"articleLive":2,"columnArticles":61,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":9462,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.4103273397879207,"acs":5340,"articleLive":2,"columnArticles":75,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":13014,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2728998576174656,"acs":3450,"articleLive":2,"columnArticles":71,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.0361172086,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":12642,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.4547890154052244,"acs":1358,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":2986,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6686746987951807,"acs":111,"articleLive":2,"columnArticles":4,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":1.0177797904,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"","submitted":166,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.4177215189873418,"acs":33,"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":"","submitted":79,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.6054054054054054,"acs":112,"articleLive":2,"columnArticles":6,"formTitle":"[1990]Count the Number of Experiments","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"","submitted":185,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6586187535092645,"acs":3519,"articleLive":2,"columnArticles":46,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":5343,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5933780566976845,"acs":2742,"articleLive":2,"columnArticles":54,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":4621,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.38261263300882953,"acs":1690,"articleLive":2,"columnArticles":41,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4417,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.3620140216698534,"acs":1136,"articleLive":2,"columnArticles":32,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3138,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5462367820858387,"acs":5269,"articleLive":2,"columnArticles":39,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":9646,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.242617976919326,"acs":4478,"articleLive":2,"columnArticles":93,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":18457,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.3405067684831656,"acs":1962,"articleLive":2,"columnArticles":35,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.229388925,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":5762,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.4160483649354218,"acs":1514,"articleLive":2,"columnArticles":30,"formTitle":"[1998]数组的最大公因数排序","frequency":0.521914116,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3639,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6935483870967742,"acs":43,"articleLive":2,"columnArticles":5,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"","submitted":62,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7806982609849993,"acs":5881,"articleLive":2,"columnArticles":69,"formTitle":"[2000]反转单词前缀","frequency":0.1780824693,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":7533,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.35366018368449487,"acs":5237,"articleLive":2,"columnArticles":112,"formTitle":"[2001]可互换矩形的组数","frequency":0.1307139174,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":14808,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.567477096546864,"acs":3221,"articleLive":2,"columnArticles":82,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":5676,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.3875376418809358,"acs":1673,"articleLive":2,"columnArticles":36,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4317,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.37168141592920356,"acs":42,"articleLive":2,"columnArticles":2,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"","submitted":113,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.7222222222222222,"acs":13,"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":"","submitted":18,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.908785046728972,"acs":2431,"articleLive":2,"columnArticles":28,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":2675,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.2773200054032149,"acs":2053,"articleLive":2,"columnArticles":42,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.0,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":7403,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.39291553133514984,"acs":1442,"articleLive":2,"columnArticles":31,"formTitle":"[2008]出租车的最大盈利","frequency":0.0,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":3670,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.40522088353413654,"acs":1009,"articleLive":2,"columnArticles":34,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":2490,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.8125,"acs":13,"articleLive":2,"columnArticles":1,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"","submitted":16,"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.943519188993483,"acs":3909,"articleLive":2,"columnArticles":25,"formTitle":"[2011]执行操作后的变量值","frequency":0.0,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":4143,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.344156519929233,"acs":3307,"articleLive":2,"columnArticles":63,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":9609,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.3096837391547719,"acs":2213,"articleLive":2,"columnArticles":45,"formTitle":"[2013]检测正方形","frequency":0.5648391607,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":7146,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.49921752738654146,"acs":957,"articleLive":2,"columnArticles":22,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":1917,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.8449906866746196,"acs":80749,"articleLive":2,"columnArticles":623,"formTitle":"[LCP 01]猜数字","frequency":1.6098374638,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":95562,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6906460054389656,"acs":13460,"articleLive":2,"columnArticles":232,"formTitle":"[LCP 02]分式化简","frequency":1.3382657475,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":19489,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.218707069902642,"acs":10985,"articleLive":2,"columnArticles":180,"formTitle":"[LCP 03]机器人大冒险","frequency":1.1349067827,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":50227,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.37748637100338883,"acs":2562,"articleLive":2,"columnArticles":59,"formTitle":"[LCP 04]覆盖","frequency":0.9053375646,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6787,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19854316369721428,"acs":2017,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10159,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.839939291343179,"acs":43167,"articleLive":2,"columnArticles":650,"formTitle":"[LCP 06]拿硬币","frequency":1.6098374638,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":51393,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7703320620594637,"acs":38579,"articleLive":2,"columnArticles":465,"formTitle":"[LCP 07]传递信息","frequency":3.1744282786,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":50081,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2861819434872502,"acs":4983,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 08]剧情触发时间","frequency":0.8052541061,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17412,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.27206101666027527,"acs":6385,"articleLive":2,"columnArticles":104,"formTitle":"[LCP 09]最小跳跃次数","frequency":3.1100458828,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":23469,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5852272727272727,"acs":1751,"articleLive":2,"columnArticles":34,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.8052541061,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":2992,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6867936055391508,"acs":6745,"articleLive":2,"columnArticles":67,"formTitle":"[LCP 11]期望个数统计","frequency":0.2566981044,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":9821,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.408316961362148,"acs":6235,"articleLive":2,"columnArticles":100,"formTitle":"[LCP 12]小张刷题计划","frequency":1.7829802886,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":15270,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6132118451025057,"acs":9422,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.2852225711,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15365,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.20949327494526118,"acs":2679,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":1.1669539601,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12788,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5742778541953233,"acs":835,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.4496796987,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1454,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.3039624608967675,"acs":583,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1918,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7981795784286887,"acs":23326,"articleLive":2,"columnArticles":247,"formTitle":"[LCP 17]速算机器人","frequency":1.3088345473,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":29224,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2858234873788989,"acs":17200,"articleLive":2,"columnArticles":221,"formTitle":"[LCP 18]早餐组合","frequency":1.4003059508,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":60177,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5162905946857866,"acs":19586,"articleLive":2,"columnArticles":202,"formTitle":"[LCP 19]秋叶收藏集","frequency":1.5778244868,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":37936,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.30607142857142855,"acs":1714,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 20]快速公交","frequency":0.8705514485,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5600,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.33081126523749477,"acs":787,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 21]追逐游戏","frequency":0.3150577195,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2379,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3330203913027151,"acs":8868,"articleLive":2,"columnArticles":185,"formTitle":"[LCP 22]黑白方格画","frequency":2.2751917678,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26629,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.33970022549409734,"acs":2561,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":0.7745391608,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7539,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.27607942010715414,"acs":876,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3173,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.3303206997084548,"acs":1133,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3430,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.336489898989899,"acs":533,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1584,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32774674115456237,"acs":1232,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.4496796987,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3759,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.27884752531735846,"acs":9775,"articleLive":2,"columnArticles":168,"formTitle":"[LCP 28]采购方案","frequency":1.2803750284,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":35055,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.18466412703202204,"acs":4896,"articleLive":2,"columnArticles":120,"formTitle":"[LCP 29]乐团站位","frequency":2.3679365961,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":26513,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.34568690095846644,"acs":5410,"articleLive":2,"columnArticles":92,"formTitle":"[LCP 30]魔塔游戏","frequency":0.2032094194,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":15650,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.2495164410058027,"acs":1677,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":1.3687326889,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6721,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.40063593004769477,"acs":1008,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":0.7449949145,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2516,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.2125625183877611,"acs":4335,"articleLive":2,"columnArticles":83,"formTitle":"[LCP 33]蓄水","frequency":1.4003059508,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":20394,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4759472115793955,"acs":2236,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 34]二叉树染色","frequency":1.4003059508,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4698,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.39288256227758006,"acs":1104,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 35]电动车游城市","frequency":0.8705514485,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2810,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.2579529737206086,"acs":746,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":1.7895827159,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":2892,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.1908456167571761,"acs":738,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 37]最小矩形面积","frequency":1.4670920091,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":3867,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5527318932655655,"acs":435,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 38]守卫城堡","frequency":0.9053375646,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":787,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.4980231573001977,"acs":3527,"articleLive":2,"columnArticles":27,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7082,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.22099447513812154,"acs":2520,"articleLive":2,"columnArticles":57,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":11403,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.4117046614494726,"acs":1210,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":2939,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.19597989949748743,"acs":975,"articleLive":2,"columnArticles":27,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":4975,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.3926645091693635,"acs":364,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":927,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.5439413175342079,"acs":3856,"articleLive":2,"columnArticles":92,"formTitle":"[LCS 01]下载插件","frequency":1.4003059508,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":7089,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.7,"acs":3171,"articleLive":2,"columnArticles":65,"formTitle":"[LCS 02]完成一半题目","frequency":0.8052541061,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":4530,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4177279673968416,"acs":1640,"articleLive":2,"columnArticles":53,"formTitle":"[LCS 03]主题空间","frequency":0.2852225711,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":3926,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.678368815218107,"acs":391488,"articleLive":2,"columnArticles":2748,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":4.5024841167,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":577102,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4030364458960981,"acs":254688,"articleLive":2,"columnArticles":2041,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":3.5162060742,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":631923,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7609028456042931,"acs":277343,"articleLive":2,"columnArticles":1902,"formTitle":"[剑指 Offer 05]替换空格","frequency":3.2351536869,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":364492,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.751704471210386,"acs":293388,"articleLive":2,"columnArticles":2047,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":3.7566547631,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":390297,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6972737997730671,"acs":185585,"articleLive":2,"columnArticles":1432,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":3.6006817471,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":266158,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7163600861190825,"acs":253873,"articleLive":2,"columnArticles":1622,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":4.3631619037,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":354393,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.35965703086722195,"acs":256921,"articleLive":2,"columnArticles":1840,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":2.5607955269,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":714350,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4429127763927588,"acs":190274,"articleLive":2,"columnArticles":1298,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":3.2979705914,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":429597,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49299198394860466,"acs":255535,"articleLive":2,"columnArticles":1609,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":3.7959833505,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":518335,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.4523700779695299,"acs":166398,"articleLive":2,"columnArticles":1118,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":2.7563678324,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":367836,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5260567069975997,"acs":172696,"articleLive":2,"columnArticles":1687,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":3.7025121842,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":328284,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5690518684796408,"acs":154637,"articleLive":2,"columnArticles":1289,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":2.9996438191,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":271745,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3115069610387631,"acs":81736,"articleLive":2,"columnArticles":483,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":1.3382657475,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":262389,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7467705377040438,"acs":196031,"articleLive":2,"columnArticles":1240,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":2.2176903007,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":262505,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.33925790478746753,"acs":121340,"articleLive":2,"columnArticles":745,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":1.3382657475,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":357663,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7772210333713648,"acs":147822,"articleLive":2,"columnArticles":1109,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":3.0274352614,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":190193,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.596056899133061,"acs":184330,"articleLive":2,"columnArticles":1441,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":2.7690478983,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":309249,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.37589655985597525,"acs":65353,"articleLive":2,"columnArticles":437,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":2.6379704946,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":173859,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24079918570632933,"acs":75230,"articleLive":2,"columnArticles":834,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":3.1845807789,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":312418,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6428012279877746,"acs":188864,"articleLive":2,"columnArticles":1604,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":2.7623852046,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":293814,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7975874366982955,"acs":255618,"articleLive":2,"columnArticles":2415,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":2.9074258785,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":320489,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7425691284930525,"acs":283827,"articleLive":2,"columnArticles":1796,"formTitle":"[剑指 Offer 24]反转链表","frequency":4.3873853876,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":382223,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7285440419735647,"acs":180515,"articleLive":2,"columnArticles":1172,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":3.6749656056,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":247775,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.46533472589673724,"acs":141237,"articleLive":2,"columnArticles":1159,"formTitle":"[剑指 Offer 26]树的子结构","frequency":3.3212653787,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":303517,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7914371663418355,"acs":186795,"articleLive":2,"columnArticles":1379,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":2.8957996039,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":236020,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5801571646729448,"acs":145884,"articleLive":2,"columnArticles":1070,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":2.4067968522,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":251456,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.4400467813158634,"acs":142602,"articleLive":2,"columnArticles":1464,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":3.901386682,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":324061,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.57070942877274,"acs":134458,"articleLive":2,"columnArticles":898,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":2.8391272168,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":235598,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6149392913513182,"acs":110258,"articleLive":2,"columnArticles":927,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":1.8512545365,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":179299,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6446327519097678,"acs":132824,"articleLive":2,"columnArticles":933,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":2.957931385,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":206046,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6860416570023659,"acs":133101,"articleLive":2,"columnArticles":1072,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":2.688282916,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":194013,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5886063403154401,"acs":115803,"articleLive":2,"columnArticles":1113,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":2.7413683011,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":196741,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5506749164781495,"acs":110271,"articleLive":2,"columnArticles":933,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":2.7690478983,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":200247,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5767015451245596,"acs":129962,"articleLive":2,"columnArticles":852,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":3.1122832204,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":225354,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7207173289661101,"acs":114860,"articleLive":2,"columnArticles":803,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":2.9351231501,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":159369,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6541937478662484,"acs":101559,"articleLive":2,"columnArticles":883,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":3.2205429425,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":155243,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5605643369188857,"acs":75929,"articleLive":2,"columnArticles":552,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":3.3517369624,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":135451,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5790874113217124,"acs":155174,"articleLive":2,"columnArticles":1100,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":4.3018408677,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":267963,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6900797525700612,"acs":164662,"articleLive":2,"columnArticles":1010,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":2.6616010838,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":238613,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5697569820562333,"acs":241953,"articleLive":2,"columnArticles":1794,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":3.5270465826,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":424660,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5811892835458409,"acs":61262,"articleLive":2,"columnArticles":452,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":2.1084169347,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":105408,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6054483833682697,"acs":216337,"articleLive":2,"columnArticles":1501,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":4.224144894,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":357317,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4842841096000321,"acs":48287,"articleLive":2,"columnArticles":502,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":2.538286437,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":99708,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.4143220752301408,"acs":54369,"articleLive":2,"columnArticles":452,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":2.3568031032,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":131224,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5615902706843718,"acs":105561,"articleLive":2,"columnArticles":791,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":3.3508270939,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":187968,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5365481599955624,"acs":116072,"articleLive":2,"columnArticles":1406,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":3.4284629613,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":216331,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6887925363315591,"acs":115173,"articleLive":2,"columnArticles":972,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":2.6616010838,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":167210,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4645131059461958,"acs":146716,"articleLive":2,"columnArticles":1010,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":3.4468376999,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":315849,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6514309088430015,"acs":85998,"articleLive":2,"columnArticles":507,"formTitle":"[剑指 Offer 49]丑数","frequency":3.0682156317,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":132014,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6141642329853481,"acs":147841,"articleLive":2,"columnArticles":1031,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":3.0803708805,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":240719,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4819646076018064,"acs":99464,"articleLive":2,"columnArticles":837,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":4.3066511131,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":206372,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6485893464528668,"acs":170854,"articleLive":2,"columnArticles":1034,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":3.2351536869,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":263424,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5382457310526608,"acs":183988,"articleLive":2,"columnArticles":1549,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":3.0034302681,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":341829,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.4469039825798264,"acs":162341,"articleLive":2,"columnArticles":1438,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":2.7459268175,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":363257,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7558800489128358,"acs":158245,"articleLive":2,"columnArticles":1125,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":2.2422615615,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":209352,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7897090296434589,"acs":173428,"articleLive":2,"columnArticles":1247,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":2.6835988473,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":219610,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5871993108267881,"acs":133599,"articleLive":2,"columnArticles":918,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":2.4067968522,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":227519,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6995550252318095,"acs":112564,"articleLive":2,"columnArticles":1007,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":2.9645475725,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":160908,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.7998071394781849,"acs":87918,"articleLive":2,"columnArticles":683,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":2.3030151335,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":109924,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6647283160855869,"acs":130201,"articleLive":2,"columnArticles":829,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":3.163906296,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":195871,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7067697236434892,"acs":136338,"articleLive":2,"columnArticles":1843,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":2.781896591,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":192903,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.44128590616265656,"acs":125834,"articleLive":2,"columnArticles":956,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":2.8788212674,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":285153,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8570281505912013,"acs":198528,"articleLive":2,"columnArticles":1760,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":2.4801278459,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":231647,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.4438681734008766,"acs":128716,"articleLive":2,"columnArticles":1175,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":3.5363961149,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":289987,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4748115745589715,"acs":92480,"articleLive":2,"columnArticles":1050,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":2.3200612775,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":194772,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5612097512858452,"acs":63722,"articleLive":2,"columnArticles":575,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":2.4658434758,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":113544,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4595340183205685,"acs":99780,"articleLive":2,"columnArticles":959,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":2.8849181037,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":217133,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6554369233958743,"acs":107491,"articleLive":2,"columnArticles":755,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":3.5201342719,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":163999,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6335889739909053,"acs":126235,"articleLive":2,"columnArticles":934,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":3.1733293049,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":199238,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8572264668274032,"acs":134750,"articleLive":2,"columnArticles":1276,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":2.3655398353,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":157193,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.582439475453934,"acs":69287,"articleLive":2,"columnArticles":483,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":2.2422615615,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":118960,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5975873305306522,"acs":70789,"articleLive":2,"columnArticles":511,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":2.7535725043,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":118458,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28608699389667325,"acs":66561,"articleLive":2,"columnArticles":549,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":2.1796629051,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":232660,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.69337859140298,"acs":114802,"articleLive":2,"columnArticles":678,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":2.1851847303,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":165569,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.6998970613465356,"acs":114226,"articleLive":2,"columnArticles":672,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":2.8350697577,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":163204,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20403565796672352,"acs":6340,"articleLive":2,"columnArticles":79,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.9909253303,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":31073,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5818784745928021,"acs":5966,"articleLive":2,"columnArticles":102,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.6009563694,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":10253,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7821205380785934,"acs":7384,"articleLive":2,"columnArticles":117,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.5648391607,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":9441,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6840372388737511,"acs":6025,"articleLive":2,"columnArticles":80,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.1539383704,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":8808,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7112370790263421,"acs":4266,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.229388925,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":5998,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6659136546184738,"acs":5306,"articleLive":2,"columnArticles":79,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.7449949145,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":7968,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4533752280559497,"acs":4473,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.6891144561,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":9866,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.505158145334996,"acs":4456,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":8821,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5426820152489161,"acs":3630,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":6689,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.43426899317221196,"acs":4007,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.6626438794,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":9227,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5689826796735019,"acs":2858,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.9909253303,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":5023,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6601012943162634,"acs":3519,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.1083516259,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":5331,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6610901241230437,"acs":2450,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.1539383704,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":3706,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5048508803449515,"acs":2810,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":5566,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.64,"acs":2256,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":3525,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.4943401633471844,"acs":3450,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.1780824693,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":6979,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.520065970313359,"acs":1892,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":3638,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5302393272962483,"acs":3279,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":6184,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4713626260899299,"acs":2757,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":0.6891144561,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":5849,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7017272492910543,"acs":2722,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.1780824693,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":3879,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5336414997431946,"acs":4156,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":1.0742760328,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":7788,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5207119398241339,"acs":4915,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.6626438794,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":9439,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7037646574778852,"acs":3421,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.1780824693,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":4861,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7671714214004852,"acs":9170,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 024]反转链表","frequency":1.045543928,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":11953,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6089701720008709,"acs":2797,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":1.5469196787,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":4593,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.645824929407019,"acs":3202,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 026]重排链表","frequency":1.0742760328,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":4958,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6082122552116235,"acs":4814,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0722344173,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":7915,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6181499342393687,"acs":1410,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.7745391608,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":2281,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.2914964723356851,"acs":1570,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":5386,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5329648637978681,"acs":1350,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":2533,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5750636132315522,"acs":1808,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":3144,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.5980962453728186,"acs":2262,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":3782,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7882676443629697,"acs":1720,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":2182,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5749191519942508,"acs":1600,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":2783,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6892872385830132,"acs":1615,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":2343,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5860696517412936,"acs":1767,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":3015,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4450675503441244,"acs":1746,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":3923,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.77696,"acs":2428,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.1539383704,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":3125,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5155025553662692,"acs":1513,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":2935,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5735955056179776,"acs":1021,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.6891144561,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":1780,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.790856731461483,"acs":2197,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":2778,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8497674418604652,"acs":1827,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":2150,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6469864698646987,"acs":1052,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.2032094194,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":1626,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6371359223300971,"acs":2100,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":3296,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8069246435845214,"acs":1981,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":2455,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7187028657616893,"acs":1906,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.2032094194,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":2652,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6849367573783058,"acs":1787,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.2032094194,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":2609,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6701754385964912,"acs":1146,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.2852225711,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":1710,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7448512585812357,"acs":1953,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.7165434933,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":2622,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.611190137505927,"acs":1289,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":2109,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.4146431199411332,"acs":1127,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":1.1349067827,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":2718,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7348920863309353,"acs":2043,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.1083516259,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":2780,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6314209472981988,"acs":1893,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.2032094194,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":2998,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8442796610169492,"acs":1594,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":1888,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8918529199711608,"acs":1237,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":1387,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7314846127832263,"acs":2163,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.1780824693,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":2957,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.35276207046541974,"acs":811,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":2299,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.586875466070097,"acs":787,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":1341,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6203531598513011,"acs":1335,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":2152,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6703652334720296,"acs":1450,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":2163,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5346478873239436,"acs":949,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.1780824693,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":1775,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7390146471371505,"acs":1110,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":1502,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7250650477016479,"acs":836,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":1153,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6336088154269972,"acs":690,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":1089,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6216494845360825,"acs":603,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":970,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6329346826126955,"acs":688,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":1087,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.63347022587269,"acs":617,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":974,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.509150991357397,"acs":2003,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":3934,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7266000739918609,"acs":1964,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"","submitted":2703,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6889840404826781,"acs":1770,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":2569,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5,"acs":660,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.229388925,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":1320,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4237885462555066,"acs":2405,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":5675,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5365733922434953,"acs":1093,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":2037,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.54332784184514,"acs":1649,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.6891144561,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":3035,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7096097356273605,"acs":1691,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":2383,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6746134020618557,"acs":3141,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":1.4330635473,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":4656,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.57421875,"acs":2793,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.1780824693,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":4864,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6342097659635944,"acs":2195,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.229388925,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":3461,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8428338762214984,"acs":2070,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.1780824693,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":2456,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8074745186862967,"acs":1426,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":1766,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7915216703574818,"acs":2502,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.1780824693,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":3161,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6359743040685225,"acs":1782,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.2032094194,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":2802,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8557084417999257,"acs":2301,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.7165434933,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":2689,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6737723639132089,"acs":1770,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":1.1349067827,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":2627,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8563283922462942,"acs":2253,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.2032094194,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":2631,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7601905770248809,"acs":1436,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.2032094194,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":1889,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6386159760785989,"acs":1495,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":1.1349067827,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":2341,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7459387483355526,"acs":2801,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":3755,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6198529411764706,"acs":1686,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":2720,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5169628432956381,"acs":960,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.1780824693,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":1857,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7481396680022896,"acs":1307,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.229388925,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":1747,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6588785046728972,"acs":987,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":1498,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5510335917312662,"acs":853,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":1548,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5770491803278689,"acs":704,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":1220,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6601819893316598,"acs":4208,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":2.2751917678,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":6374,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.4904416611733685,"acs":744,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.229388925,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":1517,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5304568527918782,"acs":627,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.1780824693,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":1182,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7703488372093024,"acs":1325,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":1720,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6809256661991585,"acs":1942,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":1.0742760328,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":2852,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7326100829610721,"acs":1148,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":1567,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.470494923857868,"acs":1483,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":3152,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5932315859323158,"acs":894,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":1507,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.4941368966457595,"acs":1812,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":1.4003059508,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":3667,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5640087783467447,"acs":771,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":1367,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6902654867256637,"acs":2418,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.7745391608,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":3503,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5457715780296426,"acs":626,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.1780824693,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":1147,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5457543281121187,"acs":662,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":1213,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5677830940988836,"acs":356,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":627,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.6033386327503975,"acs":759,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":1258,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8315301391035549,"acs":1076,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":1294,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6693548387096774,"acs":332,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":496,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5758028379387603,"acs":771,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.2032094194,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":1339,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5756207674943566,"acs":765,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.7449949145,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":1329,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.40636474908200737,"acs":332,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":817,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.278815196394076,"acs":433,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.229388925,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":1553,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6312247644683715,"acs":2814,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 116]朋友圈","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":4458,"title":"朋友圈","titleSlug":"bLyHh0"},{"acceptance":0.6527331189710611,"acs":406,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":622,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.7036082474226805,"acs":546,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":776,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.451380042462845,"acs":2126,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.7745391608,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":4710,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7208402202712693,"acs":86787,"articleLive":2,"columnArticles":1503,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":3.5173124404,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":120397,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6496511072539404,"acs":55768,"articleLive":2,"columnArticles":1072,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":2.1498597696,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":85843,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5797692797787689,"acs":42769,"articleLive":2,"columnArticles":472,"formTitle":"[面试题 01.03]URL化","frequency":1.7506672996,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":73769,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5509269662921348,"acs":39226,"articleLive":2,"columnArticles":762,"formTitle":"[面试题 01.04]回文排列","frequency":2.1401320664,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":71200,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3330082679669281,"acs":31416,"articleLive":2,"columnArticles":540,"formTitle":"[面试题 01.05]一次编辑","frequency":1.7829802886,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":94340,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4726810003230677,"acs":71692,"articleLive":2,"columnArticles":1153,"formTitle":"[面试题 01.06]字符串压缩","frequency":3.2205429425,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":151671,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7543580308069728,"acs":63959,"articleLive":2,"columnArticles":947,"formTitle":"[面试题 01.07]旋转矩阵","frequency":2.4528051415,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":84786,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6215384162149422,"acs":42195,"articleLive":2,"columnArticles":476,"formTitle":"[面试题 01.08]零矩阵","frequency":1.8512545365,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":67888,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5508753113755882,"acs":31845,"articleLive":2,"columnArticles":409,"formTitle":"[面试题 01.09]字符串轮转","frequency":1.7506672996,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":57808,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6832863622352371,"acs":62067,"articleLive":2,"columnArticles":677,"formTitle":"[面试题 02.01]移除重复节点","frequency":2.3877397836,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":90836,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7802322322810181,"acs":64036,"articleLive":2,"columnArticles":930,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":2.7608241677,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":82073,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8540396710208031,"acs":70612,"articleLive":2,"columnArticles":673,"formTitle":"[面试题 02.03]删除中间节点","frequency":2.7847752021,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":82680,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6555806837834243,"acs":24640,"articleLive":2,"columnArticles":348,"formTitle":"[面试题 02.04]分割链表","frequency":2.3030151335,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":37585,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4668143886383663,"acs":36025,"articleLive":2,"columnArticles":511,"formTitle":"[面试题 02.05]链表求和","frequency":3.4074513327,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":77172,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.48333206869514633,"acs":38219,"articleLive":2,"columnArticles":497,"formTitle":"[面试题 02.06]回文链表","frequency":1.0742760328,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":79074,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.685241258793932,"acs":45487,"articleLive":2,"columnArticles":405,"formTitle":"[面试题 02.07]链表相交","frequency":1.0177797904,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":66381,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5317085849094326,"acs":26595,"articleLive":2,"columnArticles":277,"formTitle":"[面试题 02.08]环路检测","frequency":2.1729577707,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":50018,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5394836942739768,"acs":10637,"articleLive":2,"columnArticles":172,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":19717,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6133676467017893,"acs":25264,"articleLive":2,"columnArticles":287,"formTitle":"[面试题 03.02]栈的最小值","frequency":2.026373181,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":41189,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3854941679066865,"acs":8031,"articleLive":2,"columnArticles":122,"formTitle":"[面试题 03.03]堆盘子","frequency":1.4003059508,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":20833,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.712688078253014,"acs":22878,"articleLive":2,"columnArticles":337,"formTitle":"[面试题 03.04]化栈为队","frequency":1.5469196787,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":32101,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5438848362564023,"acs":14017,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 03.05]栈排序","frequency":0.7449949145,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":25772,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5890434002467198,"acs":10505,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 03.06]动物收容所","frequency":1.4003059508,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":17834,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5337226003871854,"acs":17093,"articleLive":2,"columnArticles":235,"formTitle":"[面试题 04.01]节点间通路","frequency":1.6430366354,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":32026,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7897475204979908,"acs":34001,"articleLive":2,"columnArticles":415,"formTitle":"[面试题 04.02]最小高度树","frequency":2.2104421414,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":43053,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.805480483048818,"acs":23545,"articleLive":2,"columnArticles":514,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":1.3687326889,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":29231,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5839852160183723,"acs":32549,"articleLive":2,"columnArticles":380,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.8052541061,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":55736,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35127086949772074,"acs":24890,"articleLive":2,"columnArticles":313,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":1.6430366354,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":70857,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5904088050314465,"acs":19526,"articleLive":2,"columnArticles":234,"formTitle":"[面试题 04.06]后继者","frequency":0.8372261388,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":33072,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7165789590058815,"acs":16204,"articleLive":2,"columnArticles":170,"formTitle":"[面试题 04.08]首个共同祖先","frequency":1.6775085444,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":22613,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47786181070563183,"acs":6508,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.8052541061,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":13619,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7170683094763544,"acs":15830,"articleLive":2,"columnArticles":247,"formTitle":"[面试题 04.10]检查子树","frequency":0.2566981044,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":22076,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.4872973970308553,"acs":17167,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 04.12]求和路径","frequency":1.4003059508,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":35229,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5050727834142038,"acs":9160,"articleLive":2,"columnArticles":175,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":18136,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6888419893558451,"acs":7507,"articleLive":2,"columnArticles":119,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.8052541061,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":10898,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.38854964657118535,"acs":10499,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 05.03]翻转数位","frequency":1.8164805182,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":27021,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.39002198802031995,"acs":5144,"articleLive":2,"columnArticles":133,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":13189,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5276022304832714,"acs":11354,"articleLive":2,"columnArticles":221,"formTitle":"[面试题 05.06]整数转换","frequency":0.7449949145,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":21520,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7035518263831935,"acs":11152,"articleLive":2,"columnArticles":199,"formTitle":"[面试题 05.07]配对交换","frequency":0.2032094194,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":15851,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5528730082085949,"acs":3435,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 05.08]绘制直线","frequency":1.2002681668,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6213,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.3637442811590184,"acs":41979,"articleLive":2,"columnArticles":462,"formTitle":"[面试题 08.01]三步问题","frequency":1.8979920144,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":115408,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3612207713331309,"acs":11895,"articleLive":2,"columnArticles":186,"formTitle":"[面试题 08.02]迷路的机器人","frequency":1.5469196787,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":32930,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6763281219233647,"acs":51522,"articleLive":2,"columnArticles":428,"formTitle":"[面试题 08.03]魔术索引","frequency":0.229388925,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":76179,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.822055037013196,"acs":20433,"articleLive":2,"columnArticles":321,"formTitle":"[面试题 08.04]幂集","frequency":1.5778244868,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":24856,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6806242124648638,"acs":21066,"articleLive":2,"columnArticles":465,"formTitle":"[面试题 08.05]递归乘法","frequency":0.229388925,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":30951,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6567037685744957,"acs":23246,"articleLive":2,"columnArticles":262,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":2.4870824604,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":35398,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8126780078515896,"acs":21115,"articleLive":2,"columnArticles":310,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":1.4003059508,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":25982,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7190053285968029,"acs":16192,"articleLive":2,"columnArticles":231,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":2.026373181,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":22520,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.812829959360401,"acs":21401,"articleLive":2,"columnArticles":340,"formTitle":"[面试题 08.09]括号","frequency":2.8702227621,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":26329,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5589415600702282,"acs":13371,"articleLive":2,"columnArticles":210,"formTitle":"[面试题 08.10]颜色填充","frequency":0.7449949145,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":23922,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49464539474648034,"acs":33764,"articleLive":2,"columnArticles":323,"formTitle":"[面试题 08.11]硬币","frequency":2.1401320664,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":68259,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7604879638683243,"acs":16333,"articleLive":2,"columnArticles":292,"formTitle":"[面试题 08.12]八皇后","frequency":2.1084169347,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":21477,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5010875271881797,"acs":6681,"articleLive":2,"columnArticles":87,"formTitle":"[面试题 08.13]堆箱子","frequency":0.229388925,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":13333,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5348076419785397,"acs":4087,"articleLive":2,"columnArticles":74,"formTitle":"[面试题 08.14]布尔运算","frequency":1.1669539601,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7642,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5548120644123662,"acs":55884,"articleLive":2,"columnArticles":2365,"formTitle":"[面试题 10.01]合并排序的数组","frequency":3.4492762695,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":100726,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7394497777205077,"acs":34431,"articleLive":2,"columnArticles":426,"formTitle":"[面试题 10.02]变位词组","frequency":2.8702227621,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46563,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39502120940025387,"acs":12758,"articleLive":2,"columnArticles":205,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":2.7690478983,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":32297,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5531455891784736,"acs":18974,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":1.1349067827,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":34302,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.45580545806174344,"acs":12727,"articleLive":2,"columnArticles":166,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":1.9642413999,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":27922,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6280444882444037,"acs":4461,"articleLive":2,"columnArticles":81,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7103,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6665776353276354,"acs":7487,"articleLive":2,"columnArticles":92,"formTitle":"[面试题 10.11]峰与谷","frequency":2.0590691871,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":11232,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8326786070976763,"acs":25012,"articleLive":2,"columnArticles":397,"formTitle":"[面试题 16.01]交换数字","frequency":0.7449949145,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":30038,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7658298391805106,"acs":14429,"articleLive":2,"columnArticles":186,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":18841,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.4431407105092292,"acs":9555,"articleLive":2,"columnArticles":231,"formTitle":"[面试题 16.03]交点","frequency":0.2852225711,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21562,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4601781418633379,"acs":7078,"articleLive":2,"columnArticles":155,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":15381,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46401191571384764,"acs":10592,"articleLive":2,"columnArticles":125,"formTitle":"[面试题 16.05]阶乘尾数","frequency":1.4003059508,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":22827,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4243703199455412,"acs":12468,"articleLive":2,"columnArticles":183,"formTitle":"[面试题 16.06]最小差","frequency":1.7829802886,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":29380,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7332371478472169,"acs":19312,"articleLive":2,"columnArticles":281,"formTitle":"[面试题 16.07]最大数值","frequency":1.9305227639,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":26338,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.37573123850910917,"acs":2248,"articleLive":2,"columnArticles":62,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":5983,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5513317817429532,"acs":2132,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.4135624901,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3867,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6828000540029702,"acs":10115,"articleLive":2,"columnArticles":188,"formTitle":"[面试题 16.10]生存人数","frequency":0.7745391608,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":14814,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4409501564496937,"acs":50028,"articleLive":2,"columnArticles":577,"formTitle":"[面试题 16.11]跳水板","frequency":1.1040401347,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":113455,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4329943502824859,"acs":1916,"articleLive":2,"columnArticles":50,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4425,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5498184114953418,"acs":3482,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6333,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.503927076764318,"acs":8790,"articleLive":2,"columnArticles":220,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.2566981044,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":17443,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.45274494027356565,"acs":14630,"articleLive":2,"columnArticles":207,"formTitle":"[面试题 16.16]部分排序","frequency":1.7506672996,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":32314,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6009011228835932,"acs":34142,"articleLive":2,"columnArticles":370,"formTitle":"[面试题 16.17]连续数列","frequency":1.7829802886,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":56818,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.34437070990399304,"acs":15101,"articleLive":2,"columnArticles":308,"formTitle":"[面试题 16.18]模式匹配","frequency":1.4003059508,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":43851,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6106909643128322,"acs":20107,"articleLive":2,"columnArticles":354,"formTitle":"[面试题 16.19]水域大小","frequency":2.0929535061,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":32925,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7208062635348992,"acs":8654,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 16.20]T9键盘","frequency":1.1349067827,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12006,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4645931823836775,"acs":9336,"articleLive":2,"columnArticles":172,"formTitle":"[面试题 16.21]交换和","frequency":0.1780824693,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":20095,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5827165868524162,"acs":2677,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.3791000859,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4594,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47214806905143264,"acs":10612,"articleLive":2,"columnArticles":158,"formTitle":"[面试题 16.24]数对和","frequency":0.7745391608,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":22476,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5451340781143128,"acs":31083,"articleLive":2,"columnArticles":252,"formTitle":"[面试题 16.25]LRU 缓存","frequency":4.1013840121,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":57019,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3880158773313034,"acs":14272,"articleLive":2,"columnArticles":196,"formTitle":"[面试题 16.26]计算器","frequency":2.6736376134,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":36782,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5970726866782436,"acs":12034,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 17.01]不用加号的加法","frequency":1.1349067827,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":20155,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6454059930050099,"acs":27311,"articleLive":2,"columnArticles":442,"formTitle":"[面试题 17.04]消失的数字","frequency":1.5778244868,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":42316,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38699175227897553,"acs":5349,"articleLive":2,"columnArticles":91,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.7745391608,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":13822,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.44972094389503575,"acs":4593,"articleLive":2,"columnArticles":106,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.2566981044,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10213,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.41191957874581137,"acs":8605,"articleLive":2,"columnArticles":214,"formTitle":"[面试题 17.07]婴儿名字","frequency":1.6430366354,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":20890,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.2721832507729645,"acs":8187,"articleLive":2,"columnArticles":118,"formTitle":"[面试题 17.08]马戏团人塔","frequency":1.7829802886,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":30079,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5497530274059911,"acs":13801,"articleLive":2,"columnArticles":141,"formTitle":"[面试题 17.09]第 k 个数","frequency":2.4528051415,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":25104,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5710409959218716,"acs":66512,"articleLive":2,"columnArticles":923,"formTitle":"[面试题 17.10]主要元素","frequency":2.7345706405,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":116475,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6865247543825852,"acs":14255,"articleLive":2,"columnArticles":256,"formTitle":"[面试题 17.11]单词距离","frequency":1.5778244868,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":20764,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6314178850731044,"acs":20427,"articleLive":2,"columnArticles":285,"formTitle":"[面试题 17.12]BiNode","frequency":0.2032094194,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":32351,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5529164500892676,"acs":24466,"articleLive":2,"columnArticles":268,"formTitle":"[面试题 17.13]恢复空格","frequency":1.7829802886,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":44249,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5978061868686869,"acs":75754,"articleLive":2,"columnArticles":756,"formTitle":"[面试题 17.14]最小K个数","frequency":2.2350971806,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":126720,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.4024682651622003,"acs":5707,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.15]最长单词","frequency":1.5024876702,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":14180,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5185963888507483,"acs":60431,"articleLive":2,"columnArticles":1133,"formTitle":"[面试题 17.16]按摩师","frequency":2.3349203919,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":116528,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.44396847155586017,"acs":7773,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 17.17]多次搜索","frequency":0.7449949145,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":17508,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4453935712477854,"acs":7039,"articleLive":2,"columnArticles":117,"formTitle":"[面试题 17.18]最短超串","frequency":1.1349067827,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":15804,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5804644808743169,"acs":8498,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 17.19]消失的两个数字","frequency":1.6775085444,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":14640,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5703055473153367,"acs":3845,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 17.20]连续中值","frequency":0.8705514485,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6742,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6359102963219186,"acs":44122,"articleLive":2,"columnArticles":534,"formTitle":"[面试题 17.21]直方图的水量","frequency":4.1681670225,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":69384,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.373781382106807,"acs":8665,"articleLive":2,"columnArticles":150,"formTitle":"[面试题 17.22]单词转换","frequency":1.8979920144,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":23182,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3793044224989266,"acs":4417,"articleLive":2,"columnArticles":98,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.7745391608,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":11645,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5210975794633382,"acs":10312,"articleLive":2,"columnArticles":117,"formTitle":"[面试题 17.24]最大子矩阵","frequency":3.6336668954,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":19789,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5066137566137566,"acs":1532,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 17.25]单词矩阵","frequency":1.3896539541,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3024,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.34140166092768887,"acs":3371,"articleLive":2,"columnArticles":50,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.2566981044,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":9874,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file diff --git a/src/main/java/leetcode/editor/cn/doc/content/LengthOfLastWord.md b/src/main/java/leetcode/editor/cn/doc/content/LengthOfLastWord.md new file mode 100644 index 0000000..e09e7e8 --- /dev/null +++ b/src/main/java/leetcode/editor/cn/doc/content/LengthOfLastWord.md @@ -0,0 +1,37 @@ +

给你一个字符串 s，由若干单词组成，单词前后用一些空格字符隔开。返回字符串中最后一个单词的长度。

+ +

单词 是指仅由字母组成、不包含任何空格字符的最大子字符串。

+ +

 

+ +

示例 1：

+ +
+输入：s = "Hello World"
+输出：5
+
+ +

示例 2：

+ +
+输入：s = "   fly me   to   the moon  "
+输出：4
+
+ +

示例 3：

+ +
+输入：s = "luffy is still joyboy"
+输出：6
+
+ +

 

+ +

提示：

+ + +
Related Topics
  • 字符串

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