diff --git a/src/main/java/leetcode/editor/cn/DayOfTheWeek.java b/src/main/java/leetcode/editor/cn/DayOfTheWeek.java
new file mode 100644
index 0000000..28f1237
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/DayOfTheWeek.java
@@ -0,0 +1,58 @@
+//给你一个日期，请你设计一个算法来判断它是对应一周中的哪一天。 
+//
+// 输入为三个整数：day、month 和 year，分别表示日、月、年。 
+//
+// 您返回的结果必须是这几个值中的一个 {"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", 
+//"Friday", "Saturday"}。 
+//
+// 
+//
+// 示例 1： 
+//
+// 输入：day = 31, month = 8, year = 2019
+//输出："Saturday"
+// 
+//
+// 示例 2： 
+//
+// 输入：day = 18, month = 7, year = 1999
+//输出："Sunday"
+// 
+//
+// 示例 3： 
+//
+// 输入：day = 15, month = 8, year = 1993
+//输出："Sunday"
+// 
+//
+// 
+//
+// 提示： 
+//
+// 
+// 给出的日期一定是在 1971 到 2100 年之间的有效日期。 
+// 
+// Related Topics 数学 👍 102 👎 0
+
+package leetcode.editor.cn;
+
+import java.text.SimpleDateFormat;
+import java.util.Date;
+
+//1185:一周中的第几天
+class DayOfTheWeek {
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new DayOfTheWeek().new Solution();
+    }
+
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+    class Solution {
+        public String dayOfTheWeek(int day, int month, int year) {
+            return new SimpleDateFormat("EEEE").format(new Date(year - 1900, month - 1, day));
+        }
+    }
+//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 20258a5..f5a8d36 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.6724232959764835,"acs":25620,"articleLive":2,"columnArticles":323,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":38101,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.5223500698448368,"acs":2819104,"articleLive":2,"columnArticles":15405,"formTitle":"[1]两数之和","frequency":4.7937305492,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":5396963,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4117216041458309,"acs":1114812,"articleLive":2,"columnArticles":7911,"formTitle":"[2]两数相加","frequency":4.7166739094,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2707684,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.3831735390901172,"acs":1401863,"articleLive":2,"columnArticles":8376,"formTitle":"[3]无重复字符的最长子串","frequency":4.6010889497,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3658559,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.41071641579096846,"acs":578453,"articleLive":2,"columnArticles":4312,"formTitle":"[4]寻找两个正序数组的中位数","frequency":4.5625606298,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1408400,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3593908189445947,"acs":829244,"articleLive":2,"columnArticles":4506,"formTitle":"[5]最长回文子串","frequency":4.5240323099,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2307360,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5096113113624681,"acs":338042,"articleLive":2,"columnArticles":2745,"formTitle":"[6]Z 字形变换","frequency":3.7608843537,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":663333,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3509003531799554,"acs":919427,"articleLive":2,"columnArticles":5720,"formTitle":"[7]整数反转","frequency":4.6781455895,"frontendQuestionId":"7","leaf":true,"level":2,"nodeType":"def","questionId":"7","status":"ac","submitted":2620194,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21742207304345462,"acs":383733,"articleLive":2,"columnArticles":2939,"formTitle":"[8]字符串转换整数 (atoi)","frequency":3.85210526,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1764922,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5805932248295202,"acs":854646,"articleLive":2,"columnArticles":5414,"formTitle":"[9]回文数","frequency":3.88956984,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1472022,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.31611211707039216,"acs":226427,"articleLive":2,"columnArticles":1360,"formTitle":"[10]正则表达式匹配","frequency":4.2816166844,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":716287,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6221402951040687,"acs":598056,"articleLive":2,"columnArticles":3393,"formTitle":"[11]盛最多水的容器","frequency":4.2184890737,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":961288,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6640494487136652,"acs":250425,"articleLive":2,"columnArticles":1956,"formTitle":"[12]整数转罗马数字","frequency":3.4807898118,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":377118,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6296198627515078,"acs":518106,"articleLive":2,"columnArticles":4246,"formTitle":"[13]罗马数字转整数","frequency":4.2089670059,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":822887,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4147865635831083,"acs":693755,"articleLive":2,"columnArticles":4329,"formTitle":"[14]最长公共前缀","frequency":4.4902239979,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"ac","submitted":1672559,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.341628523752916,"acs":748916,"articleLive":2,"columnArticles":3509,"formTitle":"[15]三数之和","frequency":4.3370345455,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":2192194,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.45829780030092987,"acs":289663,"articleLive":2,"columnArticles":1587,"formTitle":"[16]最接近的三数之和","frequency":4.1504279831,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":632041,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5750993056096436,"acs":383957,"articleLive":2,"columnArticles":3459,"formTitle":"[17]电话号码的字母组合","frequency":3.6119237368,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":667636,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.3946184360879853,"acs":248992,"articleLive":2,"columnArticles":1711,"formTitle":"[18]四数之和","frequency":3.4807898118,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"ac","submitted":630969,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.43293366959026575,"acs":603584,"articleLive":2,"columnArticles":4478,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":3.6318699541,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1394172,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4455060695118511,"acs":879670,"articleLive":2,"columnArticles":6206,"formTitle":"[20]有效的括号","frequency":4.3638609459,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1974541,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6669130331722348,"acs":810294,"articleLive":2,"columnArticles":3922,"formTitle":"[21]合并两个有序链表","frequency":4.0824861961,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1214992,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.772948051418395,"acs":398001,"articleLive":2,"columnArticles":2966,"formTitle":"[22]括号生成","frequency":4.389081229,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":514913,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5621855408544096,"acs":366943,"articleLive":2,"columnArticles":2358,"formTitle":"[23]合并K个升序链表","frequency":3.9297969861,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":652708,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7045900951204251,"acs":355849,"articleLive":2,"columnArticles":2804,"formTitle":"[24]两两交换链表中的节点","frequency":3.0255448413,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":505044,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6587037589308701,"acs":258422,"articleLive":2,"columnArticles":2440,"formTitle":"[25]K 个一组翻转链表","frequency":4.1352416624,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":392319,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5364300074314088,"acs":916017,"articleLive":2,"columnArticles":5032,"formTitle":"[26]删除有序数组中的重复项","frequency":3.6991945059,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1707617,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5958010320490972,"acs":548896,"articleLive":2,"columnArticles":4568,"formTitle":"[27]移除元素","frequency":3.4556015153,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":921274,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4032177027099257,"acs":528066,"articleLive":2,"columnArticles":3584,"formTitle":"[28]实现 strStr()","frequency":3.2083183383,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1309630,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.22041244309178257,"acs":140207,"articleLive":2,"columnArticles":1106,"formTitle":"[29]两数相除","frequency":3.4095424208,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"ac","submitted":636112,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.3623136206804815,"acs":88523,"articleLive":2,"columnArticles":680,"formTitle":"[30]串联所有单词的子串","frequency":2.7528724314,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":244327,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3726519396320388,"acs":243019,"articleLive":2,"columnArticles":1960,"formTitle":"[31]下一个排列","frequency":3.7266939473,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":652134,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3577707386339767,"acs":212904,"articleLive":2,"columnArticles":1436,"formTitle":"[32]最长有效括号","frequency":3.661311188,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":595085,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4304078862066862,"acs":416272,"articleLive":2,"columnArticles":2754,"formTitle":"[33]搜索旋转排序数组","frequency":3.5456105141,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":967157,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4227932070627492,"acs":401150,"articleLive":2,"columnArticles":3781,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":3.6269435445,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":948809,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4589788113507158,"acs":605830,"articleLive":2,"columnArticles":4503,"formTitle":"[35]搜索插入位置","frequency":3.4419397164,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1319952,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6377596059385939,"acs":230464,"articleLive":2,"columnArticles":1638,"formTitle":"[36]有效的数独","frequency":3.3389414794,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":361365,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6701786694526588,"acs":113541,"articleLive":2,"columnArticles":959,"formTitle":"[37]解数独","frequency":3.0304113269,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":169419,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5971768696328431,"acs":254936,"articleLive":2,"columnArticles":2685,"formTitle":"[38]外观数列","frequency":2.4035306476,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"ac","submitted":426902,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7275234522642879,"acs":383813,"articleLive":2,"columnArticles":2237,"formTitle":"[39]组合总和","frequency":3.7396694762,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":527561,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6153787648311531,"acs":226548,"articleLive":2,"columnArticles":1544,"formTitle":"[40]组合总和 II","frequency":3.2227117357,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":368144,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4201408587123466,"acs":182184,"articleLive":2,"columnArticles":1545,"formTitle":"[41]缺失的第一个正数","frequency":4.1773787826,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":433626,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5909813683145385,"acs":372034,"articleLive":2,"columnArticles":2721,"formTitle":"[42]接雨水","frequency":4.3942429304,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":629519,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4495738976396802,"acs":187805,"articleLive":2,"columnArticles":1268,"formTitle":"[43]字符串相乘","frequency":3.9267891032,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":417740,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32863931010116304,"acs":91156,"articleLive":2,"columnArticles":594,"formTitle":"[44]通配符匹配","frequency":2.9192737382,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":277374,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.435886094839459,"acs":242432,"articleLive":2,"columnArticles":1904,"formTitle":"[45]跳跃游戏 II","frequency":3.6835838237,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":556182,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7842996909812612,"acs":479942,"articleLive":2,"columnArticles":3084,"formTitle":"[46]全排列","frequency":3.9536601085,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":611937,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6414581023801761,"acs":245919,"articleLive":2,"columnArticles":1678,"formTitle":"[47]全排列 II","frequency":3.282514327,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":383375,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7364140243831437,"acs":252970,"articleLive":2,"columnArticles":2110,"formTitle":"[48]旋转图像","frequency":3.3218461232,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":343516,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6675955424199388,"acs":260893,"articleLive":2,"columnArticles":1491,"formTitle":"[49]字母异位词分组","frequency":2.7902553041,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":390795,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3774141244573979,"acs":243708,"articleLive":2,"columnArticles":1441,"formTitle":"[50]Pow(x, n)","frequency":3.5147928156,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":645731,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7379478449276484,"acs":171657,"articleLive":2,"columnArticles":1699,"formTitle":"[51]N 皇后","frequency":3.6421626853,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":232614,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.82202893788316,"acs":80050,"articleLive":2,"columnArticles":655,"formTitle":"[52]N皇后 II","frequency":0.4181180555,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":97381,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.552634369146395,"acs":797463,"articleLive":2,"columnArticles":4239,"formTitle":"[53]最大子数组和","frequency":4.0691357356,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1443021,"title":"最大子数组和","titleSlug":"maximum-subarray"},{"acceptance":0.48296126798583877,"acs":210220,"articleLive":2,"columnArticles":2220,"formTitle":"[54]螺旋矩阵","frequency":3.8160132878,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":435273,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43428219281958,"acs":379134,"articleLive":2,"columnArticles":2883,"formTitle":"[55]跳跃游戏","frequency":3.3502697349,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":873013,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4745034585867742,"acs":343401,"articleLive":2,"columnArticles":2620,"formTitle":"[56]合并区间","frequency":4.2430883645,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":723706,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4131631379589692,"acs":94352,"articleLive":2,"columnArticles":995,"formTitle":"[57]插入区间","frequency":1.712728134,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":228365,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.38590271343574467,"acs":273644,"articleLive":2,"columnArticles":2926,"formTitle":"[58]最后一个单词的长度","frequency":2.7414836515,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":709101,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.781434127110969,"acs":146683,"articleLive":2,"columnArticles":1781,"formTitle":"[59]螺旋矩阵 II","frequency":3.5669015036,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":187710,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5265009123084702,"acs":95800,"articleLive":2,"columnArticles":1029,"formTitle":"[60]排列序列","frequency":1.9650996448,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":181956,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.41757132969912825,"acs":214787,"articleLive":2,"columnArticles":2191,"formTitle":"[61]旋转链表","frequency":2.4589269464,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":514372,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6655445920303605,"acs":350742,"articleLive":2,"columnArticles":2674,"formTitle":"[62]不同路径","frequency":3.1113431873,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":527000,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3957360220977328,"acs":204013,"articleLive":2,"columnArticles":1919,"formTitle":"[63]不同路径 II","frequency":2.6111759602,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":515528,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6895397722268831,"acs":297524,"articleLive":2,"columnArticles":2292,"formTitle":"[64]最小路径和","frequency":3.6570119553,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":431482,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.27118475394337466,"acs":49050,"articleLive":2,"columnArticles":683,"formTitle":"[65]有效数字","frequency":2.062116643,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":180873,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.46257512675480067,"acs":418309,"articleLive":2,"columnArticles":3800,"formTitle":"[66]加一","frequency":2.7682715654,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":904305,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5408174138062257,"acs":213174,"articleLive":2,"columnArticles":1935,"formTitle":"[67]二进制求和","frequency":2.9728719126,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":394170,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.522117182494541,"acs":39931,"articleLive":2,"columnArticles":611,"formTitle":"[68]文本左右对齐","frequency":3.4143996287,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":76479,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3906438169165124,"acs":432397,"articleLive":2,"columnArticles":2188,"formTitle":"[69]Sqrt(x)","frequency":3.5926230862,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1106883,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5327241101159977,"acs":654483,"articleLive":2,"columnArticles":3963,"formTitle":"[70]爬楼梯","frequency":4.2985062256,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1228559,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42219291014014837,"acs":102424,"articleLive":2,"columnArticles":925,"formTitle":"[71]简化路径","frequency":3.252153768,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":242600,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6154460181388992,"acs":198149,"articleLive":2,"columnArticles":1376,"formTitle":"[72]编辑距离","frequency":4.0577672767,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":321960,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6093553995022608,"acs":151072,"articleLive":2,"columnArticles":1120,"formTitle":"[73]矩阵置零","frequency":2.6524329771,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":247921,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.46588395730942844,"acs":190629,"articleLive":2,"columnArticles":1907,"formTitle":"[74]搜索二维矩阵","frequency":2.5852033653,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":409177,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5997993389990557,"acs":304890,"articleLive":2,"columnArticles":2100,"formTitle":"[75]颜色分类","frequency":2.5267601636,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":508320,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.43072912273090624,"acs":214454,"articleLive":2,"columnArticles":1477,"formTitle":"[76]最小覆盖子串","frequency":3.2667261873,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":497886,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7687522759427626,"acs":257552,"articleLive":2,"columnArticles":1524,"formTitle":"[77]组合","frequency":3.1028208926,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":335026,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8023288864438638,"acs":350024,"articleLive":2,"columnArticles":2296,"formTitle":"[78]子集","frequency":3.2547193193,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":436260,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4599042117578239,"acs":251586,"articleLive":2,"columnArticles":1584,"formTitle":"[79]单词搜索","frequency":2.6872837569,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":547040,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6181280228923345,"acs":158985,"articleLive":2,"columnArticles":1415,"formTitle":"[80]删除有序数组中的重复项 II","frequency":2.6477779086,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":257204,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.41426162696060514,"acs":134884,"articleLive":2,"columnArticles":1066,"formTitle":"[81]搜索旋转排序数组 II","frequency":2.2648969003,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":325601,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5316644373243745,"acs":205097,"articleLive":2,"columnArticles":1874,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":3.3331495102,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":385764,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5374864746574594,"acs":353679,"articleLive":2,"columnArticles":2203,"formTitle":"[83]删除排序链表中的重复元素","frequency":2.7734601829,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":658024,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4347674411092711,"acs":201896,"articleLive":2,"columnArticles":1282,"formTitle":"[84]柱状图中最大的矩形","frequency":3.5333413071,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":464377,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5186192922787467,"acs":107502,"articleLive":2,"columnArticles":757,"formTitle":"[85]最大矩形","frequency":2.4878976863,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":207285,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6329333631528281,"acs":130183,"articleLive":2,"columnArticles":1217,"formTitle":"[86]分隔链表","frequency":2.2369794545,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":205682,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.4848598833928907,"acs":43826,"articleLive":2,"columnArticles":331,"formTitle":"[87]扰乱字符串","frequency":0.4442975611,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":90389,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.519340740857033,"acs":529283,"articleLive":2,"columnArticles":3673,"formTitle":"[88]合并两个有序数组","frequency":4.2870979898,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":1019144,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7127996731340481,"acs":64549,"articleLive":2,"columnArticles":535,"formTitle":"[89]格雷编码","frequency":2.4185938956,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":90557,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6339051586815341,"acs":155199,"articleLive":2,"columnArticles":1351,"formTitle":"[90]子集 II","frequency":2.4589269464,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":244830,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3140523714500701,"acs":179887,"articleLive":2,"columnArticles":1644,"formTitle":"[91]解码方法","frequency":3.1393861277,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":572793,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5498570926909132,"acs":236438,"articleLive":2,"columnArticles":2214,"formTitle":"[92]反转链表 II","frequency":3.8160132878,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":429999,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5477229544716933,"acs":173827,"articleLive":2,"columnArticles":1503,"formTitle":"[93]复原 IP 地址","frequency":3.8591699309,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":317363,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7556384494923724,"acs":644178,"articleLive":2,"columnArticles":2633,"formTitle":"[94]二叉树的中序遍历","frequency":3.0487043805,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":852495,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7077590787174252,"acs":110564,"articleLive":2,"columnArticles":685,"formTitle":"[95]不同的二叉搜索树 II","frequency":2.9927661381,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":156217,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.699704092080244,"acs":186567,"articleLive":2,"columnArticles":1464,"formTitle":"[96]不同的二叉搜索树","frequency":3.3766276186,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":266637,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.454411052990977,"acs":68542,"articleLive":2,"columnArticles":590,"formTitle":"[97]交错字符串","frequency":2.0524191271,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":150837,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.35288747389523567,"acs":396588,"articleLive":2,"columnArticles":2187,"formTitle":"[98]验证二叉搜索树","frequency":3.2422404279,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1123837,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6081885763383018,"acs":81403,"articleLive":2,"columnArticles":667,"formTitle":"[99]恢复二叉搜索树","frequency":1.9963034245,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":133845,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.5992667148094895,"acs":279658,"articleLive":2,"columnArticles":2073,"formTitle":"[100]相同的树","frequency":2.5549469226,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":466667,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5674204227826525,"acs":466705,"articleLive":2,"columnArticles":2544,"formTitle":"[101]对称二叉树","frequency":3.2213637904,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"ac","submitted":822503,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6423711954306691,"acs":450766,"articleLive":2,"columnArticles":2822,"formTitle":"[102]二叉树的层序遍历","frequency":4.2004988378,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":701722,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5717957535619208,"acs":192877,"articleLive":2,"columnArticles":1728,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":3.3996473789,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":337318,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7671760081324766,"acs":578084,"articleLive":2,"columnArticles":2841,"formTitle":"[104]二叉树的最大深度","frequency":3.4547602318,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"ac","submitted":753522,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7064386171077431,"acs":280738,"articleLive":2,"columnArticles":1604,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":3.2468929515,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":397399,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7216470678288825,"acs":150843,"articleLive":2,"columnArticles":1003,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":3.4143996287,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":209026,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.7019695280564846,"acs":177566,"articleLive":2,"columnArticles":1437,"formTitle":"[107]二叉树的层序遍历 II","frequency":2.5152591743,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":252954,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7622311856794467,"acs":213161,"articleLive":2,"columnArticles":1310,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":2.6271074744,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":279654,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7621784407123317,"acs":102247,"articleLive":2,"columnArticles":796,"formTitle":"[109]有序链表转换二叉搜索树","frequency":2.5724789284,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":134151,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5647051639641343,"acs":286685,"articleLive":2,"columnArticles":1622,"formTitle":"[110]平衡二叉树","frequency":2.7804223832,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":507672,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.49138143511509025,"acs":307022,"articleLive":2,"columnArticles":2019,"formTitle":"[111]二叉树的最小深度","frequency":2.326125304,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":624814,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5273570644991319,"acs":305258,"articleLive":2,"columnArticles":1914,"formTitle":"[112]路径总和","frequency":3.1305542286,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"ac","submitted":578845,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6283038566419945,"acs":201607,"articleLive":2,"columnArticles":1417,"formTitle":"[113]路径总和 II","frequency":2.5852033653,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":320875,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.726825381947699,"acs":201617,"articleLive":2,"columnArticles":1514,"formTitle":"[114]二叉树展开为链表","frequency":2.1330348198,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":277394,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5206617206859706,"acs":68706,"articleLive":2,"columnArticles":739,"formTitle":"[115]不同的子序列","frequency":2.8242067375,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":131959,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7076013259002562,"acs":187854,"articleLive":2,"columnArticles":1428,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":2.5948599891,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":265480,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6223090803364286,"acs":103808,"articleLive":2,"columnArticles":882,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":1.2634159152,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":166811,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7375890555180026,"acs":246607,"articleLive":2,"columnArticles":1983,"formTitle":"[118]杨辉三角","frequency":3.1986876661,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":334342,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6741897034066658,"acs":164596,"articleLive":2,"columnArticles":1361,"formTitle":"[119]杨辉三角 II","frequency":2.157944776,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":244139,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6831249697648222,"acs":197695,"articleLive":2,"columnArticles":1736,"formTitle":"[120]三角形最小路径和","frequency":2.1516538645,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":289398,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5737853982160487,"acs":632918,"articleLive":2,"columnArticles":3813,"formTitle":"[121]买卖股票的最佳时机","frequency":4.1809382653,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":1103057,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.692328215252858,"acs":518990,"articleLive":2,"columnArticles":2931,"formTitle":"[122]买卖股票的最佳时机 II","frequency":2.8641960721,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":749630,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5420203974836327,"acs":143972,"articleLive":2,"columnArticles":899,"formTitle":"[123]买卖股票的最佳时机 III","frequency":3.1966984074,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":265621,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4463559353658992,"acs":179415,"articleLive":2,"columnArticles":1218,"formTitle":"[124]二叉树中的最大路径和","frequency":4.0192389568,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":401955,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.471476038397552,"acs":306921,"articleLive":2,"columnArticles":2021,"formTitle":"[125]验证回文串","frequency":2.8306281299,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":650979,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.39850325551850085,"acs":40150,"articleLive":2,"columnArticles":360,"formTitle":"[126]单词接龙 II","frequency":1.6786996721,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":100752,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.47144827978552434,"acs":132592,"articleLive":2,"columnArticles":713,"formTitle":"[127]单词接龙","frequency":1.6143688138,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":281244,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5452776016589929,"acs":196945,"articleLive":2,"columnArticles":1307,"formTitle":"[128]最长连续序列","frequency":3.9206017304,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":361183,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6865115943745527,"acs":133313,"articleLive":2,"columnArticles":1240,"formTitle":"[129]求根节点到叶节点数字之和","frequency":2.8836066195,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":194189,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44925266726648383,"acs":144304,"articleLive":2,"columnArticles":1306,"formTitle":"[130]被围绕的区域","frequency":2.3385896309,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":321209,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7235506722567587,"acs":150144,"articleLive":2,"columnArticles":996,"formTitle":"[131]分割回文串","frequency":2.8242067375,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":207510,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4930638872225555,"acs":52604,"articleLive":2,"columnArticles":470,"formTitle":"[132]分割回文串 II","frequency":2.1436281392,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":106688,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6782674889023838,"acs":79301,"articleLive":2,"columnArticles":563,"formTitle":"[133]克隆图","frequency":1.5544706722,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":116917,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5655966066467993,"acs":139876,"articleLive":2,"columnArticles":1059,"formTitle":"[134]加油站","frequency":3.4588439815,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":247307,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4866383719664817,"acs":111793,"articleLive":2,"columnArticles":900,"formTitle":"[135]分发糖果","frequency":4.1937760712,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":229725,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7192495310524814,"acs":564421,"articleLive":2,"columnArticles":2568,"formTitle":"[136]只出现一次的数字","frequency":3.9625469912,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":784736,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.720369164529375,"acs":108417,"articleLive":2,"columnArticles":813,"formTitle":"[137]只出现一次的数字 II","frequency":2.1436281392,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":150502,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6635437511369838,"acs":124015,"articleLive":2,"columnArticles":934,"formTitle":"[138]复制带随机指针的链表","frequency":3.1663746771,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":186898,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5198345838065273,"acs":223375,"articleLive":2,"columnArticles":1400,"formTitle":"[139]单词拆分","frequency":3.489742423,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":429704,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.5041420937029799,"acs":58300,"articleLive":2,"columnArticles":620,"formTitle":"[140]单词拆分 II","frequency":1.2911800528,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":115642,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5131638947920879,"acs":596435,"articleLive":2,"columnArticles":3062,"formTitle":"[141]环形链表","frequency":3.262974823,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1162270,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5547758552440025,"acs":339160,"articleLive":2,"columnArticles":1964,"formTitle":"[142]环形链表 II","frequency":3.0626548509,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":611346,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6261815798098984,"acs":143286,"articleLive":2,"columnArticles":1205,"formTitle":"[143]重排链表","frequency":3.9690608235,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":228825,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7050275259067358,"acs":470259,"articleLive":2,"columnArticles":2085,"formTitle":"[144]二叉树的前序遍历","frequency":1.9963034245,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":667008,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7525294842149247,"acs":343988,"articleLive":2,"columnArticles":1758,"formTitle":"[145]二叉树的后序遍历","frequency":3.2386604718,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":457109,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5243144453090812,"acs":264794,"articleLive":2,"columnArticles":1551,"formTitle":"[146]LRU 缓存","frequency":4.129338806,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":505029,"title":"LRU 缓存","titleSlug":"lru-cache"},{"acceptance":0.6839175520071251,"acs":107505,"articleLive":2,"columnArticles":832,"formTitle":"[147]对链表进行插入排序","frequency":2.3233778986,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":157190,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6663564740808404,"acs":233438,"articleLive":2,"columnArticles":1383,"formTitle":"[148]排序链表","frequency":3.353065438,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":350320,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3514190545097129,"acs":51485,"articleLive":2,"columnArticles":553,"formTitle":"[149]直线上最多的点数","frequency":2.5486512584,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":146506,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5346868363256815,"acs":147534,"articleLive":2,"columnArticles":1162,"formTitle":"[150]逆波兰表达式求值","frequency":2.5486512584,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":275926,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.49066985157510057,"acs":192268,"articleLive":2,"columnArticles":1582,"formTitle":"[151]翻转字符串里的单词","frequency":2.4878976863,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":391848,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.423022698004846,"acs":207933,"articleLive":2,"columnArticles":1379,"formTitle":"[152]乘积最大子数组","frequency":3.7435319389,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":491541,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5682058009177687,"acs":234769,"articleLive":2,"columnArticles":1648,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":1.3727187537,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":413176,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5308769273606906,"acs":122021,"articleLive":2,"columnArticles":963,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":1.7058163011,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":229848,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5754695570867036,"acs":316960,"articleLive":2,"columnArticles":1748,"formTitle":"[155]最小栈","frequency":3.3075031335,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":550785,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7224898824436308,"acs":7498,"articleLive":2,"columnArticles":140,"formTitle":"[156]上下翻转二叉树","frequency":0.4442975611,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"","submitted":10378,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5354816294623469,"acs":6165,"articleLive":2,"columnArticles":88,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"","submitted":11513,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5969445492267069,"acs":3165,"articleLive":2,"columnArticles":74,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.4716067405,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"","submitted":5302,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5500212856534695,"acs":18088,"articleLive":2,"columnArticles":215,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":1.3496762595,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"ac","submitted":32886,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.618697532392777,"acs":377270,"articleLive":2,"columnArticles":2187,"formTitle":"[160]相交链表","frequency":2.6850678369,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":609781,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33772493573264784,"acs":8408,"articleLive":2,"columnArticles":116,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.4442975611,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"","submitted":24896,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49636695289006766,"acs":180414,"articleLive":2,"columnArticles":1212,"formTitle":"[162]寻找峰值","frequency":3.3148796115,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":363469,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.33343966314714985,"acs":10453,"articleLive":2,"columnArticles":158,"formTitle":"[163]缺失的区间","frequency":1.4125900849,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"","submitted":31349,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.608886313145948,"acs":63038,"articleLive":2,"columnArticles":531,"formTitle":"[164]最大间距","frequency":2.4560782663,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":103530,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5211543630173804,"acs":93074,"articleLive":2,"columnArticles":966,"formTitle":"[165]比较版本号","frequency":3.8083805369,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":178592,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.33130841818100504,"acs":44449,"articleLive":2,"columnArticles":397,"formTitle":"[166]分数到小数","frequency":2.8492153347,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":134162,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5872700846123233,"acs":339401,"articleLive":2,"columnArticles":2227,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":3.2754908398,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":577930,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43398250928185506,"acs":91408,"articleLive":2,"columnArticles":812,"formTitle":"[168]Excel表列名称","frequency":2.0286164134,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":210626,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.665323010840473,"acs":430293,"articleLive":2,"columnArticles":2399,"formTitle":"[169]多数元素","frequency":3.1663746771,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":646743,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.42327701104948623,"acs":9845,"articleLive":2,"columnArticles":100,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":1.0182071603,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"ac","submitted":23259,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7174792048146088,"acs":114806,"articleLive":2,"columnArticles":980,"formTitle":"[171]Excel 表列序号","frequency":2.6333759084,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":160013,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4458439559934771,"acs":97058,"articleLive":2,"columnArticles":634,"formTitle":"[172]阶乘后的零","frequency":2.602439228,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":217695,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8058384114414513,"acs":80799,"articleLive":2,"columnArticles":679,"formTitle":"[173]二叉搜索树迭代器","frequency":1.6786996721,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":100267,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4805299782104449,"acs":41019,"articleLive":2,"columnArticles":435,"formTitle":"[174]地下城游戏","frequency":3.1663746771,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":85362,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7361993377277946,"acs":332154,"articleLive":2,"columnArticles":1570,"formTitle":"[175]组合两个表","frequency":4.4327712503,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":451174,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3542934679282334,"acs":272074,"articleLive":2,"columnArticles":1103,"formTitle":"[176]第二高的薪水","frequency":4.0677553741,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":767934,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46311229744632515,"acs":139840,"articleLive":2,"columnArticles":547,"formTitle":"[177]第N高的薪水","frequency":3.536439203,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":301957,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6037543339658269,"acs":130775,"articleLive":2,"columnArticles":710,"formTitle":"[178]分数排名","frequency":2.680481935,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":216603,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4097391598385678,"acs":130867,"articleLive":2,"columnArticles":1038,"formTitle":"[179]最大数","frequency":3.3808956575,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":319391,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.4848317453882019,"acs":95667,"articleLive":2,"columnArticles":553,"formTitle":"[180]连续出现的数字","frequency":3.5030228307,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":197320,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.6965049887313817,"acs":180174,"articleLive":2,"columnArticles":728,"formTitle":"[181]超过经理收入的员工","frequency":3.3541635428,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":258683,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7943453735057154,"acs":197286,"articleLive":2,"columnArticles":643,"formTitle":"[182]查找重复的电子邮箱","frequency":3.1369694417,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":248363,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.674038083377032,"acs":164530,"articleLive":2,"columnArticles":597,"formTitle":"[183]从不订购的客户","frequency":2.8492153347,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":244096,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.4824939986172127,"acs":112355,"articleLive":2,"columnArticles":730,"formTitle":"[184]部门工资最高的员工","frequency":3.0304113269,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":232863,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.5016139112058913,"acs":77857,"articleLive":2,"columnArticles":686,"formTitle":"[185]部门工资前三高的所有员工","frequency":3.6308210213,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":155213,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7583468687962461,"acs":8404,"articleLive":2,"columnArticles":129,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.988662914,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"","submitted":11082,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5232926736489742,"acs":82540,"articleLive":2,"columnArticles":602,"formTitle":"[187]重复的DNA序列","frequency":3.3228098672,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":157732,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3987077890487735,"acs":99167,"articleLive":2,"columnArticles":775,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":2.9430771731,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":248721,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4463288006022791,"acs":399583,"articleLive":2,"columnArticles":1998,"formTitle":"[189]轮转数组","frequency":3.6735213519,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":895266,"title":"轮转数组","titleSlug":"rotate-array"},{"acceptance":0.7021446746637586,"acs":144870,"articleLive":2,"columnArticles":909,"formTitle":"[190]颠倒二进制位","frequency":1.8500579241,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":206325,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7510446146913023,"acs":208321,"articleLive":2,"columnArticles":1314,"formTitle":"[191]位1的个数","frequency":1.3199121576,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":277375,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.35720257632996844,"acs":23071,"articleLive":2,"columnArticles":181,"formTitle":"[192]统计词频","frequency":2.112207242,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":64588,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.32695570216776626,"acs":27752,"articleLive":2,"columnArticles":148,"formTitle":"[193]有效电话号码","frequency":1.6459420757,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":84880,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34706436420722137,"acs":11054,"articleLive":2,"columnArticles":75,"formTitle":"[194]转置文件","frequency":1.3805429075,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":31850,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.43780774009479545,"acs":38056,"articleLive":2,"columnArticles":152,"formTitle":"[195]第十行","frequency":1.9349344781,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":86924,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6646875,"acs":110604,"articleLive":2,"columnArticles":433,"formTitle":"[196]删除重复的电子邮箱","frequency":2.9469188989,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":166400,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5331850988201426,"acs":103351,"articleLive":2,"columnArticles":563,"formTitle":"[197]上升的温度","frequency":3.0397836424,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":193837,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5211231030827351,"acs":439485,"articleLive":2,"columnArticles":3012,"formTitle":"[198]打家劫舍","frequency":3.6943232198,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":843342,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.652747772351891,"acs":160136,"articleLive":2,"columnArticles":1770,"formTitle":"[199]二叉树的右视图","frequency":2.9339190408,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":245326,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5641056591019852,"acs":373874,"articleLive":2,"columnArticles":2349,"formTitle":"[200]岛屿数量","frequency":4.1970507543,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":662773,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5285652370914679,"acs":53661,"articleLive":2,"columnArticles":351,"formTitle":"[201]数字范围按位与","frequency":1.3805429075,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":101522,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6215372128885642,"acs":191449,"articleLive":2,"columnArticles":1546,"formTitle":"[202]快乐数","frequency":2.8836066195,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":308025,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5230195587243472,"acs":271421,"articleLive":2,"columnArticles":1884,"formTitle":"[203]移除链表元素","frequency":1.5779349115,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":518950,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37740419908970785,"acs":179935,"articleLive":2,"columnArticles":771,"formTitle":"[204]计数质数","frequency":2.6504607454,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":476770,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.49932893525745775,"acs":123146,"articleLive":2,"columnArticles":955,"formTitle":"[205]同构字符串","frequency":2.3540530595,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":246623,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7246879817370847,"acs":811394,"articleLive":2,"columnArticles":7801,"formTitle":"[206]反转链表","frequency":3.9735865373,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":1119646,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.540691761625858,"acs":161091,"articleLive":2,"columnArticles":1047,"formTitle":"[207]课程表","frequency":3.1205581437,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":297935,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.718775095501555,"acs":162004,"articleLive":2,"columnArticles":1087,"formTitle":"[208]实现 Trie (前缀树)","frequency":2.749284855,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":225389,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.47757891338190805,"acs":232228,"articleLive":2,"columnArticles":1621,"formTitle":"[209]长度最小的子数组","frequency":3.0431800387,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":486261,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5468695130713834,"acs":101225,"articleLive":2,"columnArticles":762,"formTitle":"[210]课程表 II","frequency":2.1330348198,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":185099,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.5110496692011455,"acs":51754,"articleLive":2,"columnArticles":565,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":1.4459042916,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"ac","submitted":101270,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4639988346443584,"acs":66891,"articleLive":2,"columnArticles":601,"formTitle":"[212]单词搜索 II","frequency":1.712728134,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":144162,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4343716614232346,"acs":191501,"articleLive":2,"columnArticles":1734,"formTitle":"[213]打家劫舍 II","frequency":3.0785219033,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":440869,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37490099345991085,"acs":33133,"articleLive":2,"columnArticles":335,"formTitle":"[214]最短回文串","frequency":2.5903413307,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":88378,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6464904965925755,"acs":494626,"articleLive":2,"columnArticles":2560,"formTitle":"[215]数组中的第K个最大元素","frequency":4.1461125163,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":765094,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7352563691201951,"acs":114575,"articleLive":2,"columnArticles":1162,"formTitle":"[216]组合总和 III","frequency":2.9870044259,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":155830,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5557775431293158,"acs":438972,"articleLive":2,"columnArticles":2034,"formTitle":"[217]存在重复元素","frequency":4.4712995702,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":789834,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5417259402522258,"acs":33892,"articleLive":2,"columnArticles":299,"formTitle":"[218]天际线问题","frequency":3.7475715323,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":62563,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.42216018822098694,"acs":122193,"articleLive":2,"columnArticles":1007,"formTitle":"[219]存在重复元素 II","frequency":2.2720093059,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":289447,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.2869642462434158,"acs":68808,"articleLive":2,"columnArticles":454,"formTitle":"[220]存在重复元素 III","frequency":2.0968906614,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":239779,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4796106909590925,"acs":156261,"articleLive":2,"columnArticles":1109,"formTitle":"[221]最大正方形","frequency":3.4043649251,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":325808,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7853217545683367,"acs":134473,"articleLive":2,"columnArticles":991,"formTitle":"[222]完全二叉树的节点个数","frequency":2.0818255979,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":171233,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5253448380628304,"acs":43228,"articleLive":2,"columnArticles":534,"formTitle":"[223]矩形面积","frequency":3.2937934901,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":82285,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4175705401515357,"acs":76881,"articleLive":2,"columnArticles":698,"formTitle":"[224]基本计算器","frequency":3.1100851989,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":184115,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6746684520668815,"acs":152160,"articleLive":2,"columnArticles":4844,"formTitle":"[225]用队列实现栈","frequency":1.9963034245,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":225533,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7883059882748956,"acs":349877,"articleLive":2,"columnArticles":2098,"formTitle":"[226]翻转二叉树","frequency":3.585070608,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":443834,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4371889685991007,"acs":94703,"articleLive":2,"columnArticles":758,"formTitle":"[227]基本计算器 II","frequency":2.9992086292,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":216618,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5764071333747992,"acs":62090,"articleLive":2,"columnArticles":705,"formTitle":"[228]汇总区间","frequency":0.4442975611,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":107719,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.5343599241258793,"acs":71554,"articleLive":2,"columnArticles":672,"formTitle":"[229]求众数 II","frequency":2.9168543627,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"ac","submitted":133906,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7523092037805302,"acs":175355,"articleLive":2,"columnArticles":1198,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.8089232152,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":233089,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.504759947034577,"acs":189075,"articleLive":2,"columnArticles":1348,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":374584,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6895754742043462,"acs":181699,"articleLive":2,"columnArticles":1420,"formTitle":"[232]用栈实现队列","frequency":2.4633264256,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":263494,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4772718379485307,"acs":36591,"articleLive":2,"columnArticles":446,"formTitle":"[233]数字 1 的个数","frequency":3.1997834966,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":76667,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.5024462689332531,"acs":347114,"articleLive":2,"columnArticles":2187,"formTitle":"[234]回文链表","frequency":3.3075031335,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":690848,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6681574239713775,"acs":191232,"articleLive":2,"columnArticles":1105,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":2.602439228,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"ac","submitted":286208,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6834866665422584,"acs":293008,"articleLive":2,"columnArticles":1583,"formTitle":"[236]二叉树的最近公共祖先","frequency":3.4626404932,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":428696,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8568763441038368,"acs":258589,"articleLive":2,"columnArticles":1358,"formTitle":"[237]删除链表中的节点","frequency":2.3954958944,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":301781,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7254589249254335,"acs":154205,"articleLive":2,"columnArticles":974,"formTitle":"[238]除自身以外数组的乘积","frequency":2.6524329771,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":212562,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.49692653909812073,"acs":220374,"articleLive":2,"columnArticles":1502,"formTitle":"[239]滑动窗口最大值","frequency":3.4468173783,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":443474,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4983489385392091,"acs":222000,"articleLive":2,"columnArticles":1126,"formTitle":"[240]搜索二维矩阵 II","frequency":3.2343818413,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"ac","submitted":445471,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7357732044659223,"acs":35323,"articleLive":2,"columnArticles":324,"formTitle":"[241]为运算表达式设计优先级","frequency":2.6135727209,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":48008,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6477329259799015,"acs":332013,"articleLive":2,"columnArticles":1920,"formTitle":"[242]有效的字母异位词","frequency":2.2342333317,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":512577,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.657249966528317,"acs":9818,"articleLive":2,"columnArticles":119,"formTitle":"[243]最短单词距离","frequency":0.4442975611,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"","submitted":14938,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5604267701260912,"acs":5778,"articleLive":2,"columnArticles":69,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"","submitted":10310,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.5951261751608115,"acs":4811,"articleLive":2,"columnArticles":67,"formTitle":"[245]最短单词距离 III","frequency":1.0489221055,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"","submitted":8084,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4765809692671395,"acs":6451,"articleLive":2,"columnArticles":118,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"","submitted":13536,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5270616200402267,"acs":5765,"articleLive":2,"columnArticles":100,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"","submitted":10938,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4679092382495948,"acs":2887,"articleLive":2,"columnArticles":55,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"","submitted":6170,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6406448461162677,"acs":6557,"articleLive":2,"columnArticles":114,"formTitle":"[249]移位字符串分组","frequency":1.0182071603,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"ac","submitted":10235,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6373569867592236,"acs":4958,"articleLive":2,"columnArticles":85,"formTitle":"[250]统计同值子树","frequency":0.4442975611,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"","submitted":7779,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5503206386598612,"acs":4205,"articleLive":2,"columnArticles":76,"formTitle":"[251]展开二维向量","frequency":0.4716067405,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"","submitted":7641,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.56442124451073,"acs":13624,"articleLive":2,"columnArticles":170,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"","submitted":24138,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5058040593826528,"acs":36558,"articleLive":2,"columnArticles":388,"formTitle":"[253]会议室 II","frequency":2.9430771731,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"","submitted":72277,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5686910096291353,"acs":5965,"articleLive":2,"columnArticles":85,"formTitle":"[254]因子的组合","frequency":1.0182071603,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"","submitted":10489,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47821749251745926,"acs":5752,"articleLive":2,"columnArticles":71,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"","submitted":12028,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6467345833948521,"acs":13141,"articleLive":2,"columnArticles":210,"formTitle":"[256]粉刷房子","frequency":0.4716067405,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"","submitted":20319,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.687004244736955,"acs":160230,"articleLive":2,"columnArticles":1169,"formTitle":"[257]二叉树的所有路径","frequency":2.6378787979,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":233230,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6917009321298101,"acs":84447,"articleLive":2,"columnArticles":710,"formTitle":"[258]各位相加","frequency":2.4878976863,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":122086,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5611449624486325,"acs":7920,"articleLive":2,"columnArticles":95,"formTitle":"[259]较小的三数之和","frequency":0.5299663557,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"","submitted":14114,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7405273347469347,"acs":80325,"articleLive":2,"columnArticles":716,"formTitle":"[260]只出现一次的数字 III","frequency":3.1522000953,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":108470,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49851647227337836,"acs":9745,"articleLive":2,"columnArticles":134,"formTitle":"[261]以图判树","frequency":1.4125900849,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"","submitted":19548,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43069954187471043,"acs":41836,"articleLive":2,"columnArticles":397,"formTitle":"[262]行程和用户","frequency":2.9512914463,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":97135,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5140552932507301,"acs":113013,"articleLive":2,"columnArticles":876,"formTitle":"[263]丑数","frequency":1.9963034245,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":219846,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.581063679093426,"acs":108294,"articleLive":2,"columnArticles":669,"formTitle":"[264]丑数 II","frequency":2.7227988531,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":186372,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5992672315090452,"acs":7851,"articleLive":2,"columnArticles":174,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"","submitted":13101,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6804480466259903,"acs":7472,"articleLive":2,"columnArticles":114,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"","submitted":10981,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44911320080942746,"acs":3773,"articleLive":2,"columnArticles":81,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"","submitted":8401,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6517340570231099,"acs":200287,"articleLive":2,"columnArticles":1549,"formTitle":"[268]丢失的数字","frequency":2.3233778986,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":307314,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3448161955547166,"acs":7307,"articleLive":2,"columnArticles":117,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"","submitted":21191,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5641089978421238,"acs":11241,"articleLive":2,"columnArticles":149,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.3456225535,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"","submitted":19927,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.557161629434954,"acs":2968,"articleLive":2,"columnArticles":50,"formTitle":"[271]字符串的编码与解码","frequency":0.5001312072,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"","submitted":5327,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6477215402724062,"acs":3852,"articleLive":2,"columnArticles":87,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"","submitted":5947,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.36654703321369986,"acs":29720,"articleLive":2,"columnArticles":360,"formTitle":"[273]整数转换英文表示","frequency":2.5805565168,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":81081,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4403810766113065,"acs":56718,"articleLive":2,"columnArticles":597,"formTitle":"[274]H 指数","frequency":2.8836066195,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":128793,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4608394033992369,"acs":53144,"articleLive":2,"columnArticles":440,"formTitle":"[275]H 指数 II","frequency":2.062116643,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":115320,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4998364195511352,"acs":7639,"articleLive":2,"columnArticles":144,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"","submitted":15283,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.572458397897999,"acs":8497,"articleLive":2,"columnArticles":98,"formTitle":"[277]搜寻名人","frequency":0.4181180555,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"","submitted":14843,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4524607668098721,"acs":233910,"articleLive":2,"columnArticles":1321,"formTitle":"[278]第一个错误的版本","frequency":3.9531672913,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":516973,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6369177113930908,"acs":225723,"articleLive":2,"columnArticles":1318,"formTitle":"[279]完全平方数","frequency":3.2144608638,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":354399,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6836745987825125,"acs":6177,"articleLive":2,"columnArticles":78,"formTitle":"[280]摆动排序","frequency":1.0182071603,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"ac","submitted":9035,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7571172095409079,"acs":2952,"articleLive":2,"columnArticles":74,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"","submitted":3899,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.4842491710090005,"acs":20445,"articleLive":2,"columnArticles":172,"formTitle":"[282]给表达式添加运算符","frequency":1.4459042916,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"ac","submitted":42220,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6404260875723721,"acs":578730,"articleLive":2,"columnArticles":3769,"formTitle":"[283]移动零","frequency":3.9161784123,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":903664,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7702610803938381,"acs":26051,"articleLive":2,"columnArticles":219,"formTitle":"[284]窥探迭代器","frequency":1.8234606116,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":33821,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6364903477594257,"acs":9133,"articleLive":2,"columnArticles":115,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"","submitted":14349,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.518610521254858,"acs":12944,"articleLive":2,"columnArticles":166,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"ac","submitted":24959,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6548332621348855,"acs":196209,"articleLive":2,"columnArticles":1331,"formTitle":"[287]寻找重复数","frequency":2.6111759602,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":299632,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4470087385166928,"acs":3990,"articleLive":2,"columnArticles":64,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"ac","submitted":8926,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7543218174485818,"acs":56114,"articleLive":2,"columnArticles":857,"formTitle":"[289]生命游戏","frequency":1.6143688138,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":74390,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45529069413744855,"acs":89807,"articleLive":2,"columnArticles":1193,"formTitle":"[290]单词规律","frequency":2.2098775248,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":197252,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5262565641410353,"acs":2806,"articleLive":2,"columnArticles":62,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"","submitted":5332,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7076318775983018,"acs":120342,"articleLive":2,"columnArticles":800,"formTitle":"[292]Nim 游戏","frequency":2.1436281392,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":170063,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.713321867971954,"acs":5392,"articleLive":2,"columnArticles":89,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"","submitted":7559,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5835640390499781,"acs":4005,"articleLive":2,"columnArticles":59,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"","submitted":6863,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.522864531946064,"acs":69953,"articleLive":2,"columnArticles":548,"formTitle":"[295]数据流的中位数","frequency":3.1821404143,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":133788,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.621504887474426,"acs":2734,"articleLive":2,"columnArticles":52,"formTitle":"[296]最佳的碰头地点","frequency":1.1490055641,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"","submitted":4399,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.564019610165076,"acs":119073,"articleLive":2,"columnArticles":832,"formTitle":"[297]二叉树的序列化与反序列化","frequency":2.9430771731,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":211115,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5834026622296173,"acs":5610,"articleLive":2,"columnArticles":88,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"","submitted":9616,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5643208058071743,"acs":63981,"articleLive":2,"columnArticles":729,"formTitle":"[299]猜数字游戏","frequency":2.4878976863,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"ac","submitted":113377,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5222399512930684,"acs":404866,"articleLive":2,"columnArticles":2225,"formTitle":"[300]最长递增子序列","frequency":3.5669015036,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":775249,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5478384264414596,"acs":55593,"articleLive":2,"columnArticles":400,"formTitle":"[301]删除无效的括号","frequency":2.9147423849,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"ac","submitted":101477,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6590776415645068,"acs":2258,"articleLive":2,"columnArticles":42,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"","submitted":3426,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7320063120882845,"acs":138235,"articleLive":2,"columnArticles":844,"formTitle":"[303]区域和检索 - 数组不可变","frequency":1.6143688138,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":188844,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5590776729758815,"acs":70654,"articleLive":2,"columnArticles":628,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":1.5260111533,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":126376,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3955253379713811,"acs":5003,"articleLive":2,"columnArticles":74,"formTitle":"[305]岛屿数量 II","frequency":0.4181180555,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"","submitted":12649,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3386005347100581,"acs":18364,"articleLive":2,"columnArticles":275,"formTitle":"[306]累加数","frequency":2.2448705983,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":54235,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5301015621813435,"acs":25993,"articleLive":2,"columnArticles":250,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.4181180555,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":49034,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6187282662692499,"acs":2491,"articleLive":2,"columnArticles":52,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"","submitted":4026,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6165501755419253,"acs":133993,"articleLive":2,"columnArticles":1063,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":3.4016459805,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":217327,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3824830756242085,"acs":24464,"articleLive":2,"columnArticles":230,"formTitle":"[310]最小高度树","frequency":1.6143688138,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":63961,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7629767441860466,"acs":4101,"articleLive":2,"columnArticles":50,"formTitle":"[311]稀疏矩阵的乘法","frequency":1.0808941382,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"ac","submitted":5375,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6851280675875017,"acs":61308,"articleLive":2,"columnArticles":418,"formTitle":"[312]戳气球","frequency":2.7114796006,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":89484,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.615178888967921,"acs":43244,"articleLive":2,"columnArticles":375,"formTitle":"[313]超级丑数","frequency":2.5805565168,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":70295,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5508958062256031,"acs":5504,"articleLive":2,"columnArticles":100,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"","submitted":9991,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41758741560345974,"acs":53252,"articleLive":2,"columnArticles":500,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":2.6135727209,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":127523,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4769683705903809,"acs":73228,"articleLive":2,"columnArticles":588,"formTitle":"[316]去除重复字母","frequency":3.1305542286,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":153528,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4739027843322322,"acs":5021,"articleLive":2,"columnArticles":70,"formTitle":"[317]离建筑物最近的距离","frequency":0.4442975611,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"","submitted":10595,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.7365758641742013,"acs":50672,"articleLive":2,"columnArticles":493,"formTitle":"[318]最大单词长度乘积","frequency":2.4560782663,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":68794,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5707605073946338,"acs":48820,"articleLive":2,"columnArticles":443,"formTitle":"[319]灯泡开关","frequency":2.8160133283,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":85535,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6821526171957116,"acs":3245,"articleLive":2,"columnArticles":57,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"","submitted":4757,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.4232052409693367,"acs":27907,"articleLive":2,"columnArticles":240,"formTitle":"[321]拼接最大数","frequency":1.5167303442,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":65942,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4483594313113059,"acs":343368,"articleLive":2,"columnArticles":1998,"formTitle":"[322]零钱兑换","frequency":3.443057622,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":765832,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.631447883315546,"acs":12425,"articleLive":2,"columnArticles":166,"formTitle":"[323]无向图中连通分量的数目","frequency":1.4125900849,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"","submitted":19677,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.38025738241809015,"acs":27982,"articleLive":2,"columnArticles":184,"formTitle":"[324]摆动排序 II","frequency":1.6143688138,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":73587,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5356534310941292,"acs":10374,"articleLive":2,"columnArticles":125,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.4181180555,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"","submitted":19367,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5046868712099135,"acs":145477,"articleLive":2,"columnArticles":617,"formTitle":"[326]3 的幂","frequency":2.5177863427,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":288252,"title":"3 的幂","titleSlug":"power-of-three"},{"acceptance":0.41814840488127286,"acs":25939,"articleLive":2,"columnArticles":217,"formTitle":"[327]区间和的个数","frequency":1.748123795,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":62033,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6548735101521647,"acs":139010,"articleLive":2,"columnArticles":1153,"formTitle":"[328]奇偶链表","frequency":3.0064602926,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":212270,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.49094784232961347,"acs":61503,"articleLive":2,"columnArticles":538,"formTitle":"[329]矩阵中的最长递增路径","frequency":2.4878976863,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":125274,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5319305714753562,"acs":19491,"articleLive":2,"columnArticles":157,"formTitle":"[330]按要求补齐数组","frequency":1.4805818301,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":36642,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4793957998739556,"acs":47162,"articleLive":2,"columnArticles":523,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.9602114928,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":98378,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4512472818282526,"acs":43993,"articleLive":2,"columnArticles":361,"formTitle":"[332]重新安排行程","frequency":1.1853732082,"frontendQuestionId":"332","leaf":true,"level":3,"nodeType":"def","questionId":"332","status":"","submitted":97492,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46887072140867847,"acs":5219,"articleLive":2,"columnArticles":90,"formTitle":"[333]最大 BST 子树","frequency":0.5299663557,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"","submitted":11131,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41169997877875675,"acs":52381,"articleLive":2,"columnArticles":342,"formTitle":"[334]递增的三元子序列","frequency":2.3385896309,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":127231,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.4303840253763553,"acs":16553,"articleLive":2,"columnArticles":151,"formTitle":"[335]路径交叉","frequency":1.9589856614,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"ac","submitted":38461,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.40058062721646615,"acs":23043,"articleLive":2,"columnArticles":200,"formTitle":"[336]回文对","frequency":0.4716067405,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":57524,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6074231186037587,"acs":144051,"articleLive":2,"columnArticles":1007,"formTitle":"[337]打家劫舍 III","frequency":3.262974823,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":237151,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7867807957583519,"acs":175102,"articleLive":2,"columnArticles":1489,"formTitle":"[338]比特位计数","frequency":2.301685074,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":222555,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8203337213814513,"acs":4228,"articleLive":2,"columnArticles":66,"formTitle":"[339]嵌套列表权重和","frequency":0.5299663557,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"","submitted":5154,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.496780727772553,"acs":13734,"articleLive":2,"columnArticles":202,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":1.4125900849,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"","submitted":27646,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7262193082223858,"acs":54274,"articleLive":2,"columnArticles":508,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":1.5260111533,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":74735,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.518003355704698,"acs":92619,"articleLive":2,"columnArticles":808,"formTitle":"[342]4的幂","frequency":1.3496762595,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":178800,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.610286076938098,"acs":125011,"articleLive":2,"columnArticles":1162,"formTitle":"[343]整数拆分","frequency":3.3389414794,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":204840,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.775133669704044,"acs":422013,"articleLive":2,"columnArticles":2220,"formTitle":"[344]反转字符串","frequency":3.0785219033,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":544439,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5399801638596805,"acs":114877,"articleLive":2,"columnArticles":1088,"formTitle":"[345]反转字符串中的元音字母","frequency":2.7227988531,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":212743,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7097563515201999,"acs":13633,"articleLive":2,"columnArticles":148,"formTitle":"[346]数据流中的移动平均值","frequency":0.4716067405,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"ac","submitted":19208,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6239114245121505,"acs":227037,"articleLive":2,"columnArticles":1693,"formTitle":"[347]前 K 个高频元素","frequency":3.2996791837,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":363893,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6011350251632938,"acs":5614,"articleLive":2,"columnArticles":88,"formTitle":"[348]设计井字棋","frequency":0.4716067405,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"","submitted":9339,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.738776052694211,"acs":239014,"articleLive":2,"columnArticles":1669,"formTitle":"[349]两个数组的交集","frequency":3.3522343624,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":323527,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.552788454452723,"acs":285052,"articleLive":2,"columnArticles":1605,"formTitle":"[350]两个数组的交集 II","frequency":3.2650496847,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":515662,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5926434837754995,"acs":5607,"articleLive":2,"columnArticles":103,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"","submitted":9461,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6780366318842407,"acs":21508,"articleLive":2,"columnArticles":354,"formTitle":"[352]将数据流变为多个不相交区间","frequency":1.8234606116,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":31721,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4311050477489768,"acs":2528,"articleLive":2,"columnArticles":52,"formTitle":"[353]贪吃蛇","frequency":0.4181180555,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"","submitted":5864,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.45875679364383026,"acs":75293,"articleLive":2,"columnArticles":588,"formTitle":"[354]俄罗斯套娃信封问题","frequency":2.3857681912,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":164124,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4088764829030007,"acs":29296,"articleLive":2,"columnArticles":489,"formTitle":"[355]设计推特","frequency":1.712728134,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":71650,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35431947840260797,"acs":1739,"articleLive":2,"columnArticles":44,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"","submitted":4908,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5206126254810935,"acs":26242,"articleLive":2,"columnArticles":420,"formTitle":"[357]计算各个位数不同的数字个数","frequency":1.8554735886,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":50406,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35292369418233155,"acs":4750,"articleLive":2,"columnArticles":63,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.6284711262,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"","submitted":13459,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7286863270777479,"acs":5436,"articleLive":2,"columnArticles":64,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"","submitted":7460,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6028152938938558,"acs":3169,"articleLive":2,"columnArticles":65,"formTitle":"[360]有序转化数组","frequency":0.5001312072,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"","submitted":5257,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5652701882210079,"acs":3724,"articleLive":2,"columnArticles":71,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"","submitted":6588,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6890471950133571,"acs":3869,"articleLive":2,"columnArticles":72,"formTitle":"[362]敲击计数器","frequency":0.4716067405,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"","submitted":5615,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.48789432967536744,"acs":34056,"articleLive":2,"columnArticles":224,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.4181180555,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":69802,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7318534178999295,"acs":2077,"articleLive":2,"columnArticles":52,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"","submitted":2838,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3693659163187718,"acs":35656,"articleLive":2,"columnArticles":499,"formTitle":"[365]水壶问题","frequency":2.4878976863,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":96533,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7682234143262859,"acs":4869,"articleLive":2,"columnArticles":128,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.4181180555,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"","submitted":6338,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4477505038871293,"acs":124403,"articleLive":2,"columnArticles":992,"formTitle":"[367]有效的完全平方数","frequency":2.2404235771,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":277840,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4595011678345012,"acs":44068,"articleLive":2,"columnArticles":467,"formTitle":"[368]最大整除子集","frequency":2.3047053119,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":95904,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6192792118718045,"acs":4966,"articleLive":2,"columnArticles":143,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"","submitted":8019,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7421889274620866,"acs":4062,"articleLive":2,"columnArticles":61,"formTitle":"[370]区间加法","frequency":0.4181180555,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"","submitted":5473,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6128296238164789,"acs":84337,"articleLive":2,"columnArticles":528,"formTitle":"[371]两整数之和","frequency":2.8514701779,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":137619,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5749628035075501,"acs":36325,"articleLive":2,"columnArticles":374,"formTitle":"[372]超级次方","frequency":1.0808941382,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":63178,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4070153627564159,"acs":22917,"articleLive":2,"columnArticles":245,"formTitle":"[373]查找和最小的K对数字","frequency":1.9231446693,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":56305,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5181483489825622,"acs":90777,"articleLive":2,"columnArticles":619,"formTitle":"[374]猜数字大小","frequency":1.0182071603,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":175195,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.6014491503493488,"acs":34863,"articleLive":2,"columnArticles":275,"formTitle":"[375]猜数字大小 II","frequency":2.6653530534,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"ac","submitted":57965,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.46774953046433965,"acs":86420,"articleLive":2,"columnArticles":911,"formTitle":"[376]摆动序列","frequency":1.7626885733,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":184757,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5134794317550334,"acs":72073,"articleLive":2,"columnArticles":606,"formTitle":"[377]组合总和 Ⅳ","frequency":1.8554735886,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":140362,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6290275783029406,"acs":86719,"articleLive":2,"columnArticles":612,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":2.3047053119,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":137862,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6296423070340579,"acs":3679,"articleLive":2,"columnArticles":79,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"","submitted":5843,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5059084384292013,"acs":39473,"articleLive":2,"columnArticles":255,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":2.1803070674,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":78024,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.4390278338039532,"acs":21767,"articleLive":2,"columnArticles":183,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.5299663557,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":49580,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6386099270283939,"acs":17678,"articleLive":2,"columnArticles":141,"formTitle":"[382]链表随机节点","frequency":1.3496762595,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":27682,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6426025389304472,"acs":118805,"articleLive":2,"columnArticles":1277,"formTitle":"[383]赎金信","frequency":1.2841506411,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":184881,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.606920508249144,"acs":85787,"articleLive":2,"columnArticles":406,"formTitle":"[384]打乱数组","frequency":2.5486512584,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":141348,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4208694721062212,"acs":7861,"articleLive":2,"columnArticles":95,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":18678,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7499695752707801,"acs":24650,"articleLive":2,"columnArticles":262,"formTitle":"[386]字典序排数","frequency":2.4560782663,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":32868,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5390707873786094,"acs":249517,"articleLive":2,"columnArticles":1378,"formTitle":"[387]字符串中的第一个唯一字符","frequency":3.1084294323,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":462865,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5354946473312581,"acs":7053,"articleLive":2,"columnArticles":135,"formTitle":"[388]文件的最长绝对路径","frequency":1.0489221055,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":13171,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6901183059953134,"acs":108675,"articleLive":2,"columnArticles":1085,"formTitle":"[389]找不同","frequency":0.3688470065,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":157473,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46906223666787045,"acs":7793,"articleLive":2,"columnArticles":105,"formTitle":"[390]消除游戏","frequency":1.3496762595,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":16614,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.4673865997229917,"acs":21597,"articleLive":2,"columnArticles":197,"formTitle":"[391]完美矩形","frequency":2.1761588888,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":46208,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5167199236685216,"acs":161383,"articleLive":2,"columnArticles":1730,"formTitle":"[392]判断子序列","frequency":2.3233778986,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":312322,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3929903303521336,"acs":11908,"articleLive":2,"columnArticles":143,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":30301,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5547833856616324,"acs":134115,"articleLive":2,"columnArticles":1419,"formTitle":"[394]字符串解码","frequency":3.79371582,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":241743,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5202723614979883,"acs":55473,"articleLive":2,"columnArticles":453,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":2.6984412663,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":106623,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.43871765357888903,"acs":10291,"articleLive":2,"columnArticles":172,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":23457,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.4317463670530661,"acs":49052,"articleLive":2,"columnArticles":569,"formTitle":"[397]整数替换","frequency":3.0064602926,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":113613,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6650713755260335,"acs":16120,"articleLive":2,"columnArticles":138,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":24238,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5911626579486781,"acs":45568,"articleLive":2,"columnArticles":560,"formTitle":"[399]除法求值","frequency":0.5299663557,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":77082,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.45442801473335825,"acs":42564,"articleLive":2,"columnArticles":485,"formTitle":"[400]第 N 位数字","frequency":3.4876835382,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":93665,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6155977614626856,"acs":56430,"articleLive":2,"columnArticles":690,"formTitle":"[401]二进制手表","frequency":1.0182071603,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":91667,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3268306188803209,"acs":87353,"articleLive":2,"columnArticles":644,"formTitle":"[402]移掉 K 位数字","frequency":2.9642955307,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":267273,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4553803268672674,"acs":47702,"articleLive":2,"columnArticles":473,"formTitle":"[403]青蛙过河","frequency":2.0286164134,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":104752,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.590015362566889,"acs":114450,"articleLive":2,"columnArticles":1253,"formTitle":"[404]左叶子之和","frequency":3.0304113269,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":193978,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5593286991521993,"acs":48359,"articleLive":2,"columnArticles":487,"formTitle":"[405]数字转换为十六进制数","frequency":2.6135727209,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":86459,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7400380360780077,"acs":131524,"articleLive":2,"columnArticles":864,"formTitle":"[406]根据身高重建队列","frequency":2.6653530534,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":177726,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.579993609640314,"acs":25413,"articleLive":2,"columnArticles":253,"formTitle":"[407]接雨水 II","frequency":3.1492421696,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"ac","submitted":43816,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.33330622204148025,"acs":4098,"articleLive":2,"columnArticles":85,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"","submitted":12295,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5558556634995195,"acs":104134,"articleLive":2,"columnArticles":1432,"formTitle":"[409]最长回文串","frequency":2.7682715654,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":187340,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5697518981927067,"acs":42622,"articleLive":2,"columnArticles":354,"formTitle":"[410]分割数组的最大值","frequency":2.9802067653,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":74808,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.4975124378109453,"acs":1000,"articleLive":2,"columnArticles":28,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"","submitted":2010,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.7101201816899273,"acs":107716,"articleLive":2,"columnArticles":616,"formTitle":"[412]Fizz Buzz","frequency":2.3954958944,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":151687,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6899391212508909,"acs":80351,"articleLive":2,"columnArticles":1045,"formTitle":"[413]等差数列划分","frequency":2.6504607454,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":116461,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.39399713156446475,"acs":94501,"articleLive":2,"columnArticles":1214,"formTitle":"[414]第三大的数","frequency":2.7227988531,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":239852,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5413715843056583,"acs":165271,"articleLive":2,"columnArticles":1182,"formTitle":"[415]字符串相加","frequency":3.85210526,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":305282,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.510244320617231,"acs":196416,"articleLive":2,"columnArticles":1127,"formTitle":"[416]分割等和子集","frequency":3.274044007,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":384945,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4870335922967502,"acs":31157,"articleLive":2,"columnArticles":366,"formTitle":"[417]太平洋大西洋水流问题","frequency":2.3385896309,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":63973,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3685312593478911,"acs":2464,"articleLive":2,"columnArticles":36,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"","submitted":6686,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7903571344492314,"acs":33572,"articleLive":2,"columnArticles":440,"formTitle":"[419]甲板上的战舰","frequency":0.0385283199,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":42477,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.21281628557092683,"acs":2969,"articleLive":2,"columnArticles":58,"formTitle":"[420]强密码检验器","frequency":2.1330348198,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13951,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6211607142857143,"acs":34785,"articleLive":2,"columnArticles":318,"formTitle":"[421]数组中两个数的最大异或值","frequency":0.988662914,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":56000,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4335922330097087,"acs":2233,"articleLive":2,"columnArticles":56,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"","submitted":5150,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.6119195242313046,"acs":33852,"articleLive":2,"columnArticles":394,"formTitle":"[423]从英文中重建数字","frequency":3.1305542286,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":55321,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5328878457539667,"acs":54945,"articleLive":2,"columnArticles":476,"formTitle":"[424]替换后的最长重复字符","frequency":2.4526082093,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":103108,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6203327171903882,"acs":1678,"articleLive":2,"columnArticles":37,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"","submitted":2705,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6761712507359744,"acs":8039,"articleLive":2,"columnArticles":127,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":1.0182071603,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"","submitted":11889,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6182572614107884,"acs":4470,"articleLive":2,"columnArticles":76,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":7230,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6621923937360179,"acs":2960,"articleLive":2,"columnArticles":58,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"","submitted":4470,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.705694075472906,"acs":66144,"articleLive":2,"columnArticles":534,"formTitle":"[429]N 叉树的层序遍历","frequency":1.5544706722,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":93729,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.588923398080497,"acs":46267,"articleLive":2,"columnArticles":702,"formTitle":"[430]扁平化多级双向链表","frequency":2.1761588888,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":78562,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7289512555391433,"acs":987,"articleLive":2,"columnArticles":33,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"","submitted":1354,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.38258589318206143,"acs":7149,"articleLive":2,"columnArticles":99,"formTitle":"[432]全 O(1) 的数据结构","frequency":2.0286164134,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":18686,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.533073568976714,"acs":17238,"articleLive":2,"columnArticles":245,"formTitle":"[433]最小基因变化","frequency":1.3805429075,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":32337,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3981958148624815,"acs":66830,"articleLive":2,"columnArticles":911,"formTitle":"[434]字符串中的单词数","frequency":3.1492421696,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":167832,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5067469967636357,"acs":110858,"articleLive":2,"columnArticles":973,"formTitle":"[435]无重叠区间","frequency":2.705198962,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":218764,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4908163770483687,"acs":9914,"articleLive":2,"columnArticles":169,"formTitle":"[436]寻找右区间","frequency":0.4442975611,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":20199,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5743795341733486,"acs":135387,"articleLive":2,"columnArticles":1092,"formTitle":"[437]路径总和 III","frequency":2.912882715,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":235710,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5368044741045586,"acs":134090,"articleLive":2,"columnArticles":1154,"formTitle":"[438]找到字符串中所有字母异位词","frequency":2.8007778403,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":249793,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5923839129590053,"acs":3049,"articleLive":2,"columnArticles":72,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"","submitted":5147,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.3826233855102215,"acs":17893,"articleLive":2,"columnArticles":134,"formTitle":"[440]字典序的第K小数字","frequency":3.2422404279,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":46764,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4587479844983169,"acs":81086,"articleLive":2,"columnArticles":778,"formTitle":"[441]排列硬币","frequency":2.6135727209,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":176755,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6978631600575304,"acs":47551,"articleLive":2,"columnArticles":482,"formTitle":"[442]数组中重复的数据","frequency":3.0835870647,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":68138,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.47758684494215703,"acs":59365,"articleLive":2,"columnArticles":724,"formTitle":"[443]压缩字符串","frequency":2.8836066195,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":124302,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2563927719058984,"acs":3760,"articleLive":2,"columnArticles":58,"formTitle":"[444]序列重建","frequency":0.5001312072,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"","submitted":14665,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5906969903600604,"acs":88360,"articleLive":2,"columnArticles":996,"formTitle":"[445]两数相加 II","frequency":1.7626885733,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":149586,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5502201545235523,"acs":19869,"articleLive":2,"columnArticles":176,"formTitle":"[446]等差数列划分 II - 子序列","frequency":2.3385896309,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":36111,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6637311981241424,"acs":49819,"articleLive":2,"columnArticles":388,"formTitle":"[447]回旋镖的数量","frequency":2.2720093059,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":75059,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6513544693214836,"acs":152443,"articleLive":2,"columnArticles":1194,"formTitle":"[448]找到所有数组中消失的数字","frequency":2.3512224417,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":234040,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5625246807950507,"acs":17094,"articleLive":2,"columnArticles":153,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.4716067405,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"ac","submitted":30388,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.49099964756654674,"acs":73838,"articleLive":2,"columnArticles":723,"formTitle":"[450]删除二叉搜索树中的节点","frequency":2.2648969003,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":150383,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7123891657497896,"acs":88057,"articleLive":2,"columnArticles":1012,"formTitle":"[451]根据字符出现频率排序","frequency":2.680481935,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":123608,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5077070794594974,"acs":108398,"articleLive":2,"columnArticles":948,"formTitle":"[452]用最少数量的箭引爆气球","frequency":2.5152591743,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":213505,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.6115096495683088,"acs":57795,"articleLive":2,"columnArticles":695,"formTitle":"[453]最小操作次数使数组元素相等","frequency":2.8160133283,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"ac","submitted":94512,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6097387546919548,"acs":89181,"articleLive":2,"columnArticles":562,"formTitle":"[454]四数相加 II","frequency":2.9469188989,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":146261,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5757120479695474,"acs":170903,"articleLive":2,"columnArticles":1396,"formTitle":"[455]分发饼干","frequency":3.1508608692,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":296855,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.36281679523887683,"acs":59683,"articleLive":2,"columnArticles":474,"formTitle":"[456]132 模式","frequency":1.9963034245,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":164499,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43529171290077673,"acs":29814,"articleLive":2,"columnArticles":339,"formTitle":"[457]环形数组是否存在循环","frequency":2.2812344635,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":68492,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.698241718674988,"acs":23271,"articleLive":2,"columnArticles":212,"formTitle":"[458]可怜的小猪","frequency":2.7766672155,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":33328,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5093087877735325,"acs":87978,"articleLive":2,"columnArticles":702,"formTitle":"[459]重复的子字符串","frequency":2.0968906614,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":172740,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4346216530849825,"acs":37334,"articleLive":2,"columnArticles":430,"formTitle":"[460]LFU 缓存","frequency":2.3540530595,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":85900,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8131313131313131,"acs":181608,"articleLive":2,"columnArticles":1448,"formTitle":"[461]汉明距离","frequency":1.7058163011,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":223344,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6097789580567055,"acs":15614,"articleLive":2,"columnArticles":151,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":0.988662914,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":25606,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7049870656095907,"acs":84210,"articleLive":2,"columnArticles":1016,"formTitle":"[463]岛屿的周长","frequency":2.3954958944,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":119449,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3544511196067723,"acs":12331,"articleLive":2,"columnArticles":119,"formTitle":"[464]我能赢吗","frequency":1.114219448,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":34789,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.536178107606679,"acs":1734,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.8807415775,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"","submitted":3234,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37308599276843263,"acs":11866,"articleLive":2,"columnArticles":184,"formTitle":"[466]统计重复个数","frequency":1.4805818301,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31805,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44271242888200196,"acs":9571,"articleLive":2,"columnArticles":123,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.4442975611,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":21619,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.2534027074316235,"acs":27517,"articleLive":2,"columnArticles":322,"formTitle":"[468]验证IP地址","frequency":2.2720093059,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":108590,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.43267407206719044,"acs":1597,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.743540456,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"","submitted":3691,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.547924877535064,"acs":68678,"articleLive":2,"columnArticles":354,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":3.0960098051,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":125342,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6029699101211411,"acs":1543,"articleLive":2,"columnArticles":27,"formTitle":"[471]编码最短长度的字符串","frequency":1.7725331103,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"","submitted":2559,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.49814958866652526,"acs":21133,"articleLive":2,"columnArticles":218,"formTitle":"[472]连接词","frequency":1.0918471502,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":42423,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4213826308792354,"acs":23455,"articleLive":2,"columnArticles":203,"formTitle":"[473]火柴拼正方形","frequency":2.1761588888,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":55662,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.616019021840722,"acs":82387,"articleLive":2,"columnArticles":657,"formTitle":"[474]一和零","frequency":2.0239294907,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":133741,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.4018808878305431,"acs":49955,"articleLive":2,"columnArticles":562,"formTitle":"[475]供暖器","frequency":2.4964527902,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":124303,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7123839910318734,"acs":66090,"articleLive":2,"columnArticles":890,"formTitle":"[476]数字的补数","frequency":2.112207242,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"ac","submitted":92773,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6040034418731036,"acs":40011,"articleLive":2,"columnArticles":340,"formTitle":"[477]汉明距离总和","frequency":0.4181180555,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":66243,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4449650066516282,"acs":7693,"articleLive":2,"columnArticles":55,"formTitle":"[478]在圆内随机生成点","frequency":0.5299663557,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":17289,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.431205493387589,"acs":3391,"articleLive":2,"columnArticles":34,"formTitle":"[479]最大回文数乘积","frequency":0.5299663557,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"ac","submitted":7864,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4474735878395071,"acs":30792,"articleLive":2,"columnArticles":418,"formTitle":"[480]滑动窗口中位数","frequency":2.1761588888,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":68813,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.55,"acs":6325,"articleLive":2,"columnArticles":108,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":11500,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.47260085288316384,"acs":42889,"articleLive":2,"columnArticles":455,"formTitle":"[482]密钥格式化","frequency":1.3199121576,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":90751,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5899309488144386,"acs":16147,"articleLive":2,"columnArticles":121,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"ac","submitted":27371,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6320939334637965,"acs":1615,"articleLive":2,"columnArticles":36,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"","submitted":2555,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6089109592498932,"acs":132675,"articleLive":2,"columnArticles":1073,"formTitle":"[485]最大连续 1 的个数","frequency":2.8160133283,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":217889,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5874483857725835,"acs":48656,"articleLive":2,"columnArticles":418,"formTitle":"[486]预测赢家","frequency":2.3047053119,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":82826,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5790718538455265,"acs":7100,"articleLive":2,"columnArticles":132,"formTitle":"[487]最大连续1的个数 II","frequency":1.3496762595,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"","submitted":12261,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.5255210173083716,"acs":17853,"articleLive":2,"columnArticles":174,"formTitle":"[488]祖玛游戏","frequency":2.9621398929,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"ac","submitted":33972,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7348108521207489,"acs":1923,"articleLive":2,"columnArticles":27,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"","submitted":2617,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4860045886594559,"acs":7414,"articleLive":2,"columnArticles":90,"formTitle":"[490]迷宫","frequency":0.4181180555,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"","submitted":15255,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.539913338470314,"acs":53953,"articleLive":2,"columnArticles":459,"formTitle":"[491]递增子序列","frequency":2.0818255979,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":99929,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.6052030674603699,"acs":45852,"articleLive":2,"columnArticles":441,"formTitle":"[492]构造矩形","frequency":2.1436281392,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":75763,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3470110367515036,"acs":27637,"articleLive":2,"columnArticles":278,"formTitle":"[493]翻转对","frequency":1.0808941382,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":79643,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.49154949663697034,"acs":168891,"articleLive":2,"columnArticles":1137,"formTitle":"[494]目标和","frequency":2.7227988531,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":343589,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.6062744740916128,"acs":66575,"articleLive":2,"columnArticles":954,"formTitle":"[495]提莫攻击","frequency":2.680481935,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"ac","submitted":109810,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.7051679857935288,"acs":147720,"articleLive":2,"columnArticles":1503,"formTitle":"[496]下一个更大元素 I","frequency":2.6653530534,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":209482,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4060004839099927,"acs":3356,"articleLive":2,"columnArticles":41,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.5001312072,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":8266,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.479187466020857,"acs":48477,"articleLive":2,"columnArticles":505,"formTitle":"[498]对角线遍历","frequency":2.5805565168,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":101165,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3780290791599354,"acs":2808,"articleLive":2,"columnArticles":51,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"","submitted":7428,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7442732078426986,"acs":53220,"articleLive":2,"columnArticles":776,"formTitle":"[500]键盘行","frequency":2.1761588888,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"ac","submitted":71506,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5177459439836921,"acs":74164,"articleLive":2,"columnArticles":606,"formTitle":"[501]二叉搜索树中的众数","frequency":2.112207242,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":143244,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.441235994603156,"acs":30087,"articleLive":2,"columnArticles":364,"formTitle":"[502]IPO","frequency":2.3047053119,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":68188,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.640732716170967,"acs":113855,"articleLive":2,"columnArticles":1069,"formTitle":"[503]下一个更大元素 II","frequency":2.4354472802,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":177695,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5037304524292706,"acs":33758,"articleLive":2,"columnArticles":361,"formTitle":"[504]七进制数","frequency":0.3688470065,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":67016,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.49189359357783724,"acs":6250,"articleLive":2,"columnArticles":72,"formTitle":"[505]迷宫 II","frequency":0.5612188992,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"","submitted":12706,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.65356987623819,"acs":57139,"articleLive":2,"columnArticles":737,"formTitle":"[506]相对名次","frequency":2.4308208552,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":87426,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.48621668352200437,"acs":59616,"articleLive":2,"columnArticles":445,"formTitle":"[507]完美数","frequency":0.22231568,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":122612,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6801945973626936,"acs":15939,"articleLive":2,"columnArticles":235,"formTitle":"[508]出现次数最多的子树元素和","frequency":1.3496762595,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":23433,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6705400036954915,"acs":290317,"articleLive":2,"columnArticles":1710,"formTitle":"[509]斐波那契数","frequency":3.0626548509,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"ac","submitted":432960,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6096861289233885,"acs":3613,"articleLive":2,"columnArticles":59,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"","submitted":5926,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7302485350575874,"acs":21684,"articleLive":2,"columnArticles":118,"formTitle":"[511]游戏玩法分析 I","frequency":1.3496762595,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"","submitted":29694,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5387287801026451,"acs":20469,"articleLive":2,"columnArticles":161,"formTitle":"[512]游戏玩法分析 II","frequency":0.4716067405,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"","submitted":37995,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7313820825109517,"acs":60772,"articleLive":2,"columnArticles":681,"formTitle":"[513]找树左下角的值","frequency":0.9327824556,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":83092,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.4987408005085699,"acs":20398,"articleLive":2,"columnArticles":253,"formTitle":"[514]自由之路","frequency":0.4442975611,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":40899,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6494234695344624,"acs":45170,"articleLive":2,"columnArticles":487,"formTitle":"[515]在每个树行中找最大值","frequency":0.9327824556,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":69554,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6582326232184255,"acs":95969,"articleLive":2,"columnArticles":692,"formTitle":"[516]最长回文子序列","frequency":3.1393861277,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":145798,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5089611256611719,"acs":19822,"articleLive":2,"columnArticles":171,"formTitle":"[517]超级洗衣机","frequency":2.8836066195,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":38946,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.664321591507282,"acs":121151,"articleLive":2,"columnArticles":753,"formTitle":"[518]零钱兑换 II","frequency":3.0835870647,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":182368,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.47013062549984247,"acs":19399,"articleLive":2,"columnArticles":190,"formTitle":"[519]随机翻转矩阵","frequency":2.4526082093,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":41263,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5760395707578806,"acs":68710,"articleLive":2,"columnArticles":1052,"formTitle":"[520]检测大写字母","frequency":2.1436281392,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"ac","submitted":119280,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7126738180373461,"acs":26907,"articleLive":2,"columnArticles":273,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.4181180555,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":37755,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3623417721518987,"acs":7328,"articleLive":2,"columnArticles":115,"formTitle":"[522]最长特殊序列 II","frequency":1.4125900849,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":20224,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2763481652459416,"acs":72553,"articleLive":2,"columnArticles":625,"formTitle":"[523]连续的子数组和","frequency":1.114219448,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":262542,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.49666990559906304,"acs":77183,"articleLive":2,"columnArticles":795,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":2.6504607454,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":155401,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5372526775883354,"acs":48306,"articleLive":2,"columnArticles":545,"formTitle":"[525]连续数组","frequency":2.6135727209,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":89913,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7344701583434835,"acs":34974,"articleLive":2,"columnArticles":400,"formTitle":"[526]优美的排列","frequency":3.0742964259,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":47618,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5770089285714286,"acs":2068,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"","submitted":3584,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.47935339990624865,"acs":33746,"articleLive":2,"columnArticles":268,"formTitle":"[528]按权重随机选择","frequency":2.5208278926,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":70399,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6433490338727479,"acs":41386,"articleLive":2,"columnArticles":482,"formTitle":"[529]扫雷游戏","frequency":1.5839018723,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":64329,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6213119977342727,"acs":87751,"articleLive":2,"columnArticles":702,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.3232602621,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":141235,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6624859302138607,"acs":4120,"articleLive":2,"columnArticles":80,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"","submitted":6219,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.3794208116574766,"acs":26767,"articleLive":2,"columnArticles":298,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.3929911054,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":70547,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5263628239499554,"acs":1767,"articleLive":2,"columnArticles":35,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"","submitted":3357,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6754169627555072,"acs":16158,"articleLive":2,"columnArticles":150,"formTitle":"[534]游戏玩法分析 III","frequency":0.5299663557,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"","submitted":23923,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.844643576318969,"acs":16778,"articleLive":2,"columnArticles":109,"formTitle":"[535]TinyURL 的加密与解密","frequency":1.0182071603,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":19864,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5365927725478288,"acs":3534,"articleLive":2,"columnArticles":58,"formTitle":"[536]从字符串生成二叉树","frequency":1.0808941382,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"","submitted":6586,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7132205334098078,"acs":12435,"articleLive":2,"columnArticles":192,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":17435,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7121987236960076,"acs":121536,"articleLive":2,"columnArticles":935,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":1.4984649962,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":170649,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.6011422951811786,"acs":15893,"articleLive":2,"columnArticles":221,"formTitle":"[539]最小时间差","frequency":2.0286164134,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":26438,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5839090945679443,"acs":43524,"articleLive":2,"columnArticles":447,"formTitle":"[540]有序数组中的单一元素","frequency":2.112207242,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":74539,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6020918533531179,"acs":83182,"articleLive":2,"columnArticles":876,"formTitle":"[541]反转字符串 II","frequency":2.6271074744,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":138155,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4574603575280538,"acs":79739,"articleLive":2,"columnArticles":725,"formTitle":"[542]01 矩阵","frequency":2.7327185853,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":174308,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5571248288268936,"acs":165992,"articleLive":2,"columnArticles":1331,"formTitle":"[543]二叉树的直径","frequency":3.406128283,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":297944,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7119788608338227,"acs":2425,"articleLive":2,"columnArticles":57,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"","submitted":3406,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.42399726526891524,"acs":3721,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"","submitted":8776,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6258061899160345,"acs":15428,"articleLive":2,"columnArticles":124,"formTitle":"[546]移除盒子","frequency":0.5299663557,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":24653,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6190224607406275,"acs":178094,"articleLive":2,"columnArticles":1246,"formTitle":"[547]省份数量","frequency":1.9963034245,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":287702,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3557672395941189,"acs":1718,"articleLive":2,"columnArticles":42,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.988662914,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"","submitted":4829,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48991474318985234,"acs":2356,"articleLive":2,"columnArticles":53,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"","submitted":4809,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.43841835639130033,"acs":14292,"articleLive":2,"columnArticles":197,"formTitle":"[550]游戏玩法分析 IV","frequency":1.4805818301,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"","submitted":32599,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5675978377577845,"acs":61321,"articleLive":2,"columnArticles":776,"formTitle":"[551]学生出勤记录 I","frequency":2.3857681912,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":108036,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5770267419785783,"acs":24620,"articleLive":2,"columnArticles":289,"formTitle":"[552]学生出勤记录 II","frequency":2.3540530595,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":42667,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6061614528858039,"acs":6375,"articleLive":2,"columnArticles":99,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":10517,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5043019558212003,"acs":47418,"articleLive":2,"columnArticles":496,"formTitle":"[554]砖墙","frequency":2.1761588888,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":94027,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3444541995902839,"acs":1177,"articleLive":2,"columnArticles":24,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"","submitted":3417,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.3298271824275216,"acs":16337,"articleLive":2,"columnArticles":247,"formTitle":"[556]下一个更大元素 III","frequency":2.2098775248,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":49532,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.743721339130848,"acs":187806,"articleLive":2,"columnArticles":1568,"formTitle":"[557]反转字符串中的单词 III","frequency":3.3522343624,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":252522,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5056234718826406,"acs":3102,"articleLive":2,"columnArticles":42,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":6135,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7401149611398964,"acs":91419,"articleLive":2,"columnArticles":811,"formTitle":"[559]N 叉树的最大深度","frequency":1.9349344781,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":123520,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.446436289596059,"acs":171461,"articleLive":2,"columnArticles":1042,"formTitle":"[560]和为 K 的子数组","frequency":3.85210526,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":384066,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7766707975927231,"acs":95887,"articleLive":2,"columnArticles":795,"formTitle":"[561]数组拆分 I","frequency":1.3496762595,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":123459,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4723646088700691,"acs":4239,"articleLive":2,"columnArticles":70,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.5001312072,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"","submitted":8974,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6542062157617834,"acs":60308,"articleLive":2,"columnArticles":606,"formTitle":"[563]二叉树的坡度","frequency":2.3385896309,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":92185,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.1821954124562954,"acs":4742,"articleLive":2,"columnArticles":84,"formTitle":"[564]寻找最近的回文数","frequency":1.114219448,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":26027,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6068580855493145,"acs":15450,"articleLive":2,"columnArticles":151,"formTitle":"[565]数组嵌套","frequency":1.3805429075,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":25459,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6780312225337966,"acs":81001,"articleLive":2,"columnArticles":760,"formTitle":"[566]重塑矩阵","frequency":2.5549469226,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":119465,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.43376406347796864,"acs":140684,"articleLive":2,"columnArticles":1270,"formTitle":"[567]字符串的排列","frequency":3.0349522484,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":324333,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5069527214938419,"acs":1276,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"","submitted":2517,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5642229936695936,"acs":11052,"articleLive":2,"columnArticles":168,"formTitle":"[569]员工薪水中位数","frequency":1.9589856614,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"","submitted":19588,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.657036638896354,"acs":14669,"articleLive":2,"columnArticles":120,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.4716067405,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"","submitted":22326,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.476887031408308,"acs":7531,"articleLive":2,"columnArticles":101,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.5299663557,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"","submitted":15792,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47398450352124927,"acs":95369,"articleLive":2,"columnArticles":823,"formTitle":"[572]另一棵树的子树","frequency":2.680481935,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":201207,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6570915619389587,"acs":1098,"articleLive":2,"columnArticles":35,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"","submitted":1671,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6501213425523147,"acs":14198,"articleLive":2,"columnArticles":121,"formTitle":"[574]当选者","frequency":0.4716067405,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"","submitted":21839,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.7118836812606611,"acs":87640,"articleLive":2,"columnArticles":844,"formTitle":"[575]分糖果","frequency":3.0397836424,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"ac","submitted":123110,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.46861627483931323,"acs":27049,"articleLive":2,"columnArticles":293,"formTitle":"[576]出界的路径数","frequency":2.062116643,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":57721,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.6991912445177645,"acs":17377,"articleLive":2,"columnArticles":94,"formTitle":"[577]员工奖金","frequency":1.6143688138,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"","submitted":24853,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.485225981292071,"acs":11101,"articleLive":2,"columnArticles":125,"formTitle":"[578]查询回答率最高的问题","frequency":1.114219448,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"","submitted":22878,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.4099313762866946,"acs":8602,"articleLive":2,"columnArticles":139,"formTitle":"[579]查询员工的累计薪水","frequency":0.5299663557,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"","submitted":20984,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5230733944954128,"acs":11403,"articleLive":2,"columnArticles":87,"formTitle":"[580]统计各专业学生人数","frequency":1.4805818301,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"","submitted":21800,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40615734334848785,"acs":106847,"articleLive":2,"columnArticles":914,"formTitle":"[581]最短无序连续子数组","frequency":3.0626548509,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":263068,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.4179432052315686,"acs":9331,"articleLive":2,"columnArticles":144,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"","submitted":22326,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6268599436397329,"acs":57169,"articleLive":2,"columnArticles":538,"formTitle":"[583]两个字符串的删除操作","frequency":3.2227117357,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":91199,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7741243388883345,"acs":15515,"articleLive":2,"columnArticles":66,"formTitle":"[584]寻找用户推荐人","frequency":0.4716067405,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"","submitted":20042,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5728351272015656,"acs":9367,"articleLive":2,"columnArticles":115,"formTitle":"[585]2016年的投资","frequency":0.4716067405,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"","submitted":16352,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7424139952207043,"acs":16466,"articleLive":2,"columnArticles":93,"formTitle":"[586]订单最多的客户","frequency":1.4125900849,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"","submitted":22179,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3881545926049858,"acs":2320,"articleLive":2,"columnArticles":40,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5977,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.4240928165884967,"acs":1718,"articleLive":2,"columnArticles":31,"formTitle":"[588]设计内存文件系统","frequency":1.724369709,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"","submitted":4051,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7466759917017666,"acs":95019,"articleLive":2,"columnArticles":610,"formTitle":"[589]N 叉树的前序遍历","frequency":1.4984649962,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":127256,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7636095010796682,"acs":67190,"articleLive":2,"columnArticles":503,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":87990,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.34218859957776215,"acs":1945,"articleLive":2,"columnArticles":44,"formTitle":"[591]标签验证器","frequency":1.4459042916,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5684,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5276720669783626,"acs":4853,"articleLive":2,"columnArticles":117,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":9197,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44249768822699176,"acs":9092,"articleLive":2,"columnArticles":147,"formTitle":"[593]有效的正方形","frequency":1.6143688138,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":20547,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5659813225595852,"acs":59818,"articleLive":2,"columnArticles":545,"formTitle":"[594]最长和谐子序列","frequency":2.3857681912,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":105689,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7893958642865858,"acs":109981,"articleLive":2,"columnArticles":253,"formTitle":"[595]大的国家","frequency":1.8234606116,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":139323,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.43277722297284066,"acs":88406,"articleLive":2,"columnArticles":316,"formTitle":"[596]超过5名学生的课","frequency":2.2720093059,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":204276,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.441936964504284,"acs":11554,"articleLive":2,"columnArticles":88,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.4716067405,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"","submitted":26144,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5711132177681474,"acs":42171,"articleLive":2,"columnArticles":494,"formTitle":"[598]范围求和 II","frequency":2.3857681912,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":73840,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5221096533718658,"acs":31797,"articleLive":2,"columnArticles":306,"formTitle":"[599]两个列表的最小索引总和","frequency":0.5001312072,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":60901,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.4820644216691069,"acs":19755,"articleLive":2,"columnArticles":239,"formTitle":"[600]不含连续1的非负整数","frequency":2.4185938956,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40980,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5047977561263655,"acs":34195,"articleLive":2,"columnArticles":408,"formTitle":"[601]体育馆的人流量","frequency":1.8886727603,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":67740,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6193846991560032,"acs":9100,"articleLive":2,"columnArticles":98,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":1.1853732082,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"","submitted":14692,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6685231597512299,"acs":14404,"articleLive":2,"columnArticles":126,"formTitle":"[603]连续空余座位","frequency":1.0808941382,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"","submitted":21546,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.3751587861679605,"acs":2658,"articleLive":2,"columnArticles":62,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"","submitted":7085,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33229896393026365,"acs":117259,"articleLive":2,"columnArticles":1353,"formTitle":"[605]种花问题","frequency":2.5805565168,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":352872,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.573591962452332,"acs":31286,"articleLive":2,"columnArticles":341,"formTitle":"[606]根据二叉树创建字符串","frequency":0.4442975611,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":54544,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6620361468948279,"acs":13773,"articleLive":2,"columnArticles":96,"formTitle":"[607]销售员","frequency":1.4805818301,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"","submitted":20804,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6225830258302583,"acs":8436,"articleLive":2,"columnArticles":109,"formTitle":"[608]树节点","frequency":1.0808941382,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"","submitted":13550,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4887948379934781,"acs":7045,"articleLive":2,"columnArticles":110,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":14413,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6642820643842616,"acs":11700,"articleLive":2,"columnArticles":81,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"","submitted":17613,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.532530825088942,"acs":54635,"articleLive":2,"columnArticles":425,"formTitle":"[611]有效三角形的个数","frequency":4.0170257219,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":102595,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6635184888746598,"acs":8290,"articleLive":2,"columnArticles":71,"formTitle":"[612]平面上的最近距离","frequency":1.0489221055,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"","submitted":12494,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8147116541115401,"acs":12870,"articleLive":2,"columnArticles":89,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"","submitted":15797,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.35203050524308865,"acs":9232,"articleLive":2,"columnArticles":75,"formTitle":"[614]二级关注者","frequency":1.4125900849,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"","submitted":26225,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42354707269997854,"acs":5925,"articleLive":2,"columnArticles":95,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"","submitted":13989,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46788763766860536,"acs":3781,"articleLive":2,"columnArticles":64,"formTitle":"[616]给字符串添加加粗标签","frequency":1.3805429075,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"","submitted":8081,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7866607028941406,"acs":214568,"articleLive":2,"columnArticles":1410,"formTitle":"[617]合并二叉树","frequency":3.1663746771,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":272758,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6207231254549866,"acs":5116,"articleLive":2,"columnArticles":51,"formTitle":"[618]学生地理信息报告","frequency":0.4442975611,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"","submitted":8242,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4638541059988352,"acs":12743,"articleLive":2,"columnArticles":87,"formTitle":"[619]只出现一次的最大数字","frequency":1.0182071603,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"","submitted":27472,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7727770656100688,"acs":99468,"articleLive":2,"columnArticles":337,"formTitle":"[620]有趣的电影","frequency":1.8234606116,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":128715,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5745969397530999,"acs":83967,"articleLive":2,"columnArticles":544,"formTitle":"[621]任务调度器","frequency":3.1305542286,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":146132,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4405542193744224,"acs":71987,"articleLive":2,"columnArticles":474,"formTitle":"[622]设计循环队列","frequency":2.112207242,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":163401,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5469042723326479,"acs":11969,"articleLive":2,"columnArticles":202,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":21885,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4231820667031165,"acs":2322,"articleLive":2,"columnArticles":54,"formTitle":"[624]数组列表中的最大距离","frequency":0.9327824556,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"","submitted":5487,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.34442836468885674,"acs":2618,"articleLive":2,"columnArticles":55,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"","submitted":7601,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6841927731163301,"acs":48681,"articleLive":2,"columnArticles":386,"formTitle":"[626]换座位","frequency":0.9602114928,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":71151,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8094116597528882,"acs":90731,"articleLive":2,"columnArticles":371,"formTitle":"[627]变更性别","frequency":0.988662914,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":112095,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5243716914856775,"acs":84793,"articleLive":2,"columnArticles":810,"formTitle":"[628]三个数的最大乘积","frequency":1.6143688138,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":161704,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.5217654837998678,"acs":18938,"articleLive":2,"columnArticles":172,"formTitle":"[629]K个逆序对数组","frequency":2.8436012848,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"ac","submitted":36296,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.46375751039901403,"acs":24082,"articleLive":2,"columnArticles":227,"formTitle":"[630]课程表 III","frequency":1.2332659077,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":51928,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2950025497195308,"acs":1157,"articleLive":2,"columnArticles":36,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"","submitted":3922,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5990697389761008,"acs":19577,"articleLive":2,"columnArticles":249,"formTitle":"[632]最小区间","frequency":0.4442975611,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":32679,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39510063548744,"acs":98917,"articleLive":2,"columnArticles":806,"formTitle":"[633]平方数之和","frequency":1.2911800528,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":250359,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.44018126888217524,"acs":1457,"articleLive":2,"columnArticles":22,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"","submitted":3310,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5532303199902665,"acs":4547,"articleLive":2,"columnArticles":74,"formTitle":"[635]设计日志存储系统","frequency":0.5001312072,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"","submitted":8219,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5583722481654436,"acs":10881,"articleLive":2,"columnArticles":126,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":19487,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6912331568009653,"acs":82489,"articleLive":2,"columnArticles":705,"formTitle":"[637]二叉树的层平均值","frequency":1.3199121576,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":119336,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.6456318305244496,"acs":28770,"articleLive":2,"columnArticles":277,"formTitle":"[638]大礼包","frequency":2.3737488157,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"ac","submitted":44561,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.37614493658106796,"acs":20492,"articleLive":2,"columnArticles":275,"formTitle":"[639]解码方法 II","frequency":2.3737488157,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":54479,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42668968364168575,"acs":11370,"articleLive":2,"columnArticles":227,"formTitle":"[640]求解方程","frequency":0.4181180555,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":26647,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5315345775854297,"acs":23581,"articleLive":2,"columnArticles":269,"formTitle":"[641]设计循环双端队列","frequency":0.9327824556,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":44364,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.49886024899175874,"acs":2845,"articleLive":2,"columnArticles":60,"formTitle":"[642]设计搜索自动补全系统","frequency":0.5299663557,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"","submitted":5703,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.44814508615146387,"acs":68300,"articleLive":2,"columnArticles":617,"formTitle":"[643]子数组最大平均数 I","frequency":1.3199121576,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":152406,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4050469103849887,"acs":1252,"articleLive":2,"columnArticles":26,"formTitle":"[644]子数组最大平均数 II","frequency":1.4984649962,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"","submitted":3091,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4289068983173544,"acs":72876,"articleLive":2,"columnArticles":739,"formTitle":"[645]错误的集合","frequency":0.9327824556,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":169911,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5804304256537507,"acs":24327,"articleLive":2,"columnArticles":222,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":41912,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6590356110637609,"acs":138410,"articleLive":2,"columnArticles":1010,"formTitle":"[647]回文子串","frequency":2.9097587375,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":210019,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5899922128161973,"acs":23487,"articleLive":2,"columnArticles":309,"formTitle":"[648]单词替换","frequency":1.0489221055,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":39809,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.48008362324853976,"acs":30083,"articleLive":2,"columnArticles":318,"formTitle":"[649]Dota2 参议院","frequency":1.3805429075,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":62662,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5677970768671594,"acs":51552,"articleLive":2,"columnArticles":677,"formTitle":"[650]只有两个键的键盘","frequency":2.3385896309,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":90793,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5822748267898383,"acs":4034,"articleLive":2,"columnArticles":67,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"","submitted":6928,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.571478615815767,"acs":37521,"articleLive":2,"columnArticles":265,"formTitle":"[652]寻找重复的子树","frequency":2.8836066195,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":65656,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.6018905030768255,"acs":47438,"articleLive":2,"columnArticles":484,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"ac","submitted":78815,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.809472674099799,"acs":70858,"articleLive":2,"columnArticles":705,"formTitle":"[654]最大二叉树","frequency":2.2648969003,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":87536,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.600153946355616,"acs":10136,"articleLive":2,"columnArticles":155,"formTitle":"[655]输出二叉树","frequency":1.6786996721,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":16889,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.31002017484868866,"acs":922,"articleLive":2,"columnArticles":27,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"","submitted":2974,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7832531012775412,"acs":84607,"articleLive":2,"columnArticles":651,"formTitle":"[657]机器人能否返回原点","frequency":0.4442975611,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":108020,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45410795121290964,"acs":30195,"articleLive":2,"columnArticles":268,"formTitle":"[658]找到 K 个最接近的元素","frequency":1.5839018723,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":66493,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5420282346846264,"acs":29295,"articleLive":2,"columnArticles":270,"formTitle":"[659]分割数组为连续子序列","frequency":0.3688470065,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":54047,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6377887788778878,"acs":773,"articleLive":2,"columnArticles":26,"formTitle":"[660]移除 9","frequency":0.7864655007,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"","submitted":1212,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.563638085019093,"acs":17860,"articleLive":2,"columnArticles":229,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":31687,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4095190505933791,"acs":32782,"articleLive":2,"columnArticles":316,"formTitle":"[662]二叉树最大宽度","frequency":2.2720093059,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":80050,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4589928057553957,"acs":1914,"articleLive":2,"columnArticles":38,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"","submitted":4170,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6537939008527244,"acs":22618,"articleLive":2,"columnArticles":195,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":34595,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2716287221501622,"acs":78112,"articleLive":2,"columnArticles":981,"formTitle":"[665]非递减数列","frequency":1.9589856614,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":287569,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6162381596752368,"acs":2277,"articleLive":2,"columnArticles":83,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"","submitted":3695,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6235216337324616,"acs":8488,"articleLive":2,"columnArticles":127,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":13613,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5134550371872887,"acs":7594,"articleLive":2,"columnArticles":83,"formTitle":"[668]乘法表中第k小的数","frequency":0.5001312072,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":14790,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6655128961766067,"acs":41723,"articleLive":2,"columnArticles":348,"formTitle":"[669]修剪二叉搜索树","frequency":0.3688470065,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":62693,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4561183713143968,"acs":21116,"articleLive":2,"columnArticles":316,"formTitle":"[670]最大交换","frequency":2.5805565168,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":46295,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48511419956330365,"acs":55988,"articleLive":2,"columnArticles":701,"formTitle":"[671]二叉树中第二小的节点","frequency":2.5486512584,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":115412,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5463421158218537,"acs":4085,"articleLive":2,"columnArticles":47,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.4716067405,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":7477,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.43643713176218535,"acs":52149,"articleLive":2,"columnArticles":438,"formTitle":"[673]最长递增子序列的个数","frequency":3.3797200857,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":119488,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.5043274865517345,"acs":100691,"articleLive":2,"columnArticles":838,"formTitle":"[674]最长连续递增序列","frequency":2.112207242,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":199654,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.4042741527567021,"acs":3197,"articleLive":2,"columnArticles":52,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.5299663557,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7908,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5942162200381814,"acs":8404,"articleLive":2,"columnArticles":143,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":14143,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6667142296579032,"acs":37380,"articleLive":2,"columnArticles":560,"formTitle":"[677]键值映射","frequency":1.6143688138,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":56066,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.38639676513460763,"acs":46919,"articleLive":2,"columnArticles":500,"formTitle":"[678]有效的括号字符串","frequency":3.1997834966,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":121427,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5400811470889466,"acs":27421,"articleLive":2,"columnArticles":270,"formTitle":"[679]24 点游戏","frequency":3.3797200857,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":50772,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4003327264470842,"acs":94330,"articleLive":2,"columnArticles":882,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":1.5544706722,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":235629,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5027797081306463,"acs":2894,"articleLive":2,"columnArticles":68,"formTitle":"[681]最近时刻","frequency":0.6284711262,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"","submitted":5756,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6942545723258822,"acs":48854,"articleLive":2,"columnArticles":547,"formTitle":"[682]棒球比赛","frequency":1.0182071603,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":70369,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.43561454921565246,"acs":2527,"articleLive":2,"columnArticles":54,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"","submitted":5801,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6669077458749626,"acs":64548,"articleLive":2,"columnArticles":648,"formTitle":"[684]冗余连接","frequency":0.988662914,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":96787,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4283841900471022,"acs":20918,"articleLive":2,"columnArticles":264,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":48830,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.4015499046648166,"acs":42541,"articleLive":2,"columnArticles":568,"formTitle":"[686]重复叠加字符串匹配","frequency":0.7109642855,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":105942,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.44374197372320456,"acs":40428,"articleLive":2,"columnArticles":286,"formTitle":"[687]最长同值路径","frequency":1.7925558035,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":91107,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5135616357053832,"acs":8653,"articleLive":2,"columnArticles":113,"formTitle":"[688]“马”在棋盘上的概率","frequency":1.6786996721,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":16849,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.5623852951972217,"acs":19918,"articleLive":2,"columnArticles":266,"formTitle":"[689]三个无重叠子数组的最大和","frequency":1.9650996448,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":35417,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6492363448097334,"acs":57684,"articleLive":2,"columnArticles":587,"formTitle":"[690]员工的重要性","frequency":1.0182071603,"frontendQuestionId":"690","leaf":true,"level":2,"nodeType":"def","questionId":"690","status":"ac","submitted":88849,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.48758278145695366,"acs":4123,"articleLive":2,"columnArticles":53,"formTitle":"[691]贴纸拼词","frequency":1.0808941382,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":8456,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5743486878238652,"acs":72156,"articleLive":2,"columnArticles":788,"formTitle":"[692]前K个高频单词","frequency":1.8886727603,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":125631,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6089247381773238,"acs":28083,"articleLive":2,"columnArticles":319,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":46119,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5386018930322728,"acs":4723,"articleLive":2,"columnArticles":89,"formTitle":"[694]不同岛屿的数量","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"","submitted":8769,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6682086787793262,"acs":151523,"articleLive":2,"columnArticles":1500,"formTitle":"[695]岛屿的最大面积","frequency":3.2913655089,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":226760,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6336814591212426,"acs":54790,"articleLive":2,"columnArticles":494,"formTitle":"[696]计数二进制子串","frequency":1.6143688138,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":86463,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6040071376598177,"acs":69729,"articleLive":2,"columnArticles":885,"formTitle":"[697]数组的度","frequency":0.4442975611,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":115444,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.45005408828263105,"acs":34115,"articleLive":2,"columnArticles":242,"formTitle":"[698]划分为k个相等的子集","frequency":2.7584434765,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":75802,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.4830413116862241,"acs":3005,"articleLive":2,"columnArticles":45,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":6221,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7743274781967817,"acs":126076,"articleLive":2,"columnArticles":823,"formTitle":"[700]二叉搜索树中的搜索","frequency":2.0239294907,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"ac","submitted":162820,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7215801178514033,"acs":88903,"articleLive":2,"columnArticles":656,"formTitle":"[701]二叉搜索树中的插入操作","frequency":1.2105634571,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"ac","submitted":123206,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7437916414294367,"acs":4912,"articleLive":2,"columnArticles":86,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"","submitted":6604,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5139416426109694,"acs":64272,"articleLive":2,"columnArticles":593,"formTitle":"[703]数据流中的第 K 大元素","frequency":1.6459420757,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":125057,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5483033231027911,"acs":380880,"articleLive":2,"columnArticles":1821,"formTitle":"[704]二分查找","frequency":4.7552022293,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":694652,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6425786074743268,"acs":72835,"articleLive":2,"columnArticles":457,"formTitle":"[705]设计哈希集合","frequency":2.6333759084,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":113348,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6415086824916362,"acs":64428,"articleLive":2,"columnArticles":420,"formTitle":"[706]设计哈希映射","frequency":1.3199121576,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":100432,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3259290380858349,"acs":77576,"articleLive":2,"columnArticles":521,"formTitle":"[707]设计链表","frequency":2.602439228,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":238015,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.34913071474565355,"acs":2711,"articleLive":2,"columnArticles":56,"formTitle":"[708]循环有序列表的插入","frequency":0.594008722,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"","submitted":7765,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7729545348348208,"acs":99252,"articleLive":2,"columnArticles":720,"formTitle":"[709]转换成小写字母","frequency":0.7646828925,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":128406,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.36272592592592595,"acs":6121,"articleLive":2,"columnArticles":70,"formTitle":"[710]黑名单中的随机数","frequency":0.4716067405,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":16875,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5549335199440167,"acs":793,"articleLive":2,"columnArticles":27,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"","submitted":1429,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6759731651468285,"acs":16827,"articleLive":2,"columnArticles":194,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.9602114928,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":24893,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4270061462461945,"acs":29735,"articleLive":2,"columnArticles":258,"formTitle":"[713]乘积小于K的子数组","frequency":2.3585185488,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":69636,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7276460090010863,"acs":112529,"articleLive":2,"columnArticles":766,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":2.0204300471,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":154648,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.41004705231109884,"acs":2963,"articleLive":2,"columnArticles":51,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":7226,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.46643073811931246,"acs":4613,"articleLive":2,"columnArticles":84,"formTitle":"[716]最大栈","frequency":0.5001312072,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"ac","submitted":9890,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5116326054860517,"acs":32921,"articleLive":2,"columnArticles":404,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":64345,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5647651816974526,"acs":93559,"articleLive":2,"columnArticles":633,"formTitle":"[718]最长重复子数组","frequency":2.7414836515,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":165660,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.37666679329863617,"acs":9915,"articleLive":2,"columnArticles":93,"formTitle":"[719]找出第 k 小的距离对","frequency":2.2812344635,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":26323,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4844333487181639,"acs":23091,"articleLive":2,"columnArticles":312,"formTitle":"[720]词典中最长的单词","frequency":1.2911800528,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":47666,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4714629041010931,"acs":30407,"articleLive":2,"columnArticles":347,"formTitle":"[721]账户合并","frequency":0.988662914,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":64495,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3220522702637601,"acs":5348,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":1.9963034245,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":16606,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7230392156862745,"acs":1475,"articleLive":2,"columnArticles":42,"formTitle":"[723]粉碎糖果","frequency":0.743540456,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"","submitted":2040,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.47064060286133436,"acs":150140,"articleLive":2,"columnArticles":931,"formTitle":"[724]寻找数组的中心下标","frequency":1.9349344781,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"ac","submitted":319012,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6082434607162588,"acs":50646,"articleLive":2,"columnArticles":652,"formTitle":"[725]分隔链表","frequency":2.5486512584,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":83266,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5523969059466917,"acs":22424,"articleLive":2,"columnArticles":408,"formTitle":"[726]原子的数量","frequency":2.9469188989,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":40594,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.40780803182891956,"acs":3280,"articleLive":2,"columnArticles":55,"formTitle":"[727]最小窗口子序列","frequency":2.0352188407,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"","submitted":8043,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7579426394327442,"acs":35809,"articleLive":2,"columnArticles":327,"formTitle":"[728]自除数","frequency":0.4442975611,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":47245,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5196328133290884,"acs":9793,"articleLive":2,"columnArticles":121,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":18846,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4960322160369537,"acs":4188,"articleLive":2,"columnArticles":52,"formTitle":"[730]统计不同回文子序列","frequency":1.5167303442,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8443,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5035694673256452,"acs":4585,"articleLive":2,"columnArticles":50,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":9105,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6175852594149022,"acs":3821,"articleLive":2,"columnArticles":59,"formTitle":"[732]我的日程安排表 III","frequency":1.4805818301,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":6187,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5794421059518876,"acs":79704,"articleLive":2,"columnArticles":668,"formTitle":"[733]图像渲染","frequency":2.8242067375,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":137553,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4764804703905922,"acs":2269,"articleLive":2,"columnArticles":41,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"","submitted":4762,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4105423647514304,"acs":23965,"articleLive":2,"columnArticles":300,"formTitle":"[735]行星碰撞","frequency":2.8110058066,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":58374,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.4703196347031963,"acs":1648,"articleLive":2,"columnArticles":48,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3504,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4684594953519256,"acs":4233,"articleLive":2,"columnArticles":75,"formTitle":"[737]句子相似性 II","frequency":0.5299663557,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"","submitted":9036,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5014552321706287,"acs":45141,"articleLive":2,"columnArticles":620,"formTitle":"[738]单调递增的数字","frequency":1.712728134,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":90020,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6833593322545721,"acs":234805,"articleLive":2,"columnArticles":1655,"formTitle":"[739]每日温度","frequency":3.5382051299,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":343604,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6280413344416054,"acs":61202,"articleLive":2,"columnArticles":675,"formTitle":"[740]删除并获得点数","frequency":2.8007778403,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":97449,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3706678306416412,"acs":4246,"articleLive":2,"columnArticles":49,"formTitle":"[741]摘樱桃","frequency":1.9498913827,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":11455,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.490837327318861,"acs":1741,"articleLive":2,"columnArticles":49,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"","submitted":3547,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5262468931234465,"acs":63518,"articleLive":2,"columnArticles":564,"formTitle":"[743]网络延迟时间","frequency":2.6653530534,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":120700,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4592627667349481,"acs":44616,"articleLive":2,"columnArticles":400,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.3456225535,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":97147,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.4021792966815255,"acs":3248,"articleLive":2,"columnArticles":59,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":8076,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5989223584178468,"acs":158506,"articleLive":2,"columnArticles":1482,"formTitle":"[746]使用最小花费爬楼梯","frequency":2.4209830975,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":264652,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4202245393210486,"acs":47274,"articleLive":2,"columnArticles":431,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":112497,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6820830361957108,"acs":39215,"articleLive":2,"columnArticles":496,"formTitle":"[748]最短补全词","frequency":0.845669951,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":57493,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5048169556840078,"acs":1572,"articleLive":2,"columnArticles":37,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":3114,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7185929648241206,"acs":2145,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.8320938533,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"","submitted":2985,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.49425675675675673,"acs":1463,"articleLive":2,"columnArticles":28,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"","submitted":2960,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5303628725018,"acs":75870,"articleLive":2,"columnArticles":636,"formTitle":"[752]打开转盘锁","frequency":1.2634159152,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":143053,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.598127771391033,"acs":3642,"articleLive":2,"columnArticles":48,"formTitle":"[753]破解保险箱","frequency":1.0489221055,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":6089,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4330532212885154,"acs":8503,"articleLive":2,"columnArticles":100,"formTitle":"[754]到达终点数字","frequency":0.5299663557,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":19635,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.49821683309557774,"acs":1397,"articleLive":2,"columnArticles":32,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"","submitted":2804,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5559456398640996,"acs":4909,"articleLive":2,"columnArticles":72,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8830,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4238709677419355,"acs":2628,"articleLive":2,"columnArticles":40,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":6200,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4645061728395062,"acs":3612,"articleLive":2,"columnArticles":71,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"","submitted":7776,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6727660872217139,"acs":2206,"articleLive":2,"columnArticles":51,"formTitle":"[759]员工空闲时间","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"","submitted":3279,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.83492252681764,"acs":4203,"articleLive":2,"columnArticles":96,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"","submitted":5034,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.594760759155306,"acs":2225,"articleLive":2,"columnArticles":36,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3741,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.7026022304832714,"acs":18900,"articleLive":2,"columnArticles":166,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":26900,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7633739673584525,"acs":90927,"articleLive":2,"columnArticles":1065,"formTitle":"[763]划分字母区间","frequency":2.761054444,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":119112,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.498820887142055,"acs":4442,"articleLive":2,"columnArticles":60,"formTitle":"[764]最大加号标志","frequency":0.5299663557,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8905,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6640468485128679,"acs":30163,"articleLive":2,"columnArticles":454,"formTitle":"[765]情侣牵手","frequency":1.6459420757,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":45423,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7064411319725191,"acs":56966,"articleLive":2,"columnArticles":652,"formTitle":"[766]托普利茨矩阵","frequency":0.4181180555,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":80638,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47784726605083483,"acs":41642,"articleLive":2,"columnArticles":504,"formTitle":"[767]重构字符串","frequency":2.5903413307,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":87145,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5134071340713408,"acs":6261,"articleLive":2,"columnArticles":91,"formTitle":"[768]最多能完成排序的块 II","frequency":0.4181180555,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":12195,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5847203728362184,"acs":14052,"articleLive":2,"columnArticles":170,"formTitle":"[769]最多能完成排序的块","frequency":0.4442975611,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":24032,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5640468953538862,"acs":1299,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2303,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8513803182851575,"acs":157284,"articleLive":2,"columnArticles":1170,"formTitle":"[771]宝石与石头","frequency":1.0182071603,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":184740,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4972843797523354,"acs":6867,"articleLive":2,"columnArticles":131,"formTitle":"[772]基本计算器 III","frequency":1.0489221055,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"","submitted":13809,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.709597416080286,"acs":24606,"articleLive":2,"columnArticles":349,"formTitle":"[773]滑动谜题","frequency":1.0182071603,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":34676,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5936739659367397,"acs":1220,"articleLive":2,"columnArticles":23,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.7030490946,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"","submitted":2055,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4570452604611443,"acs":5352,"articleLive":2,"columnArticles":85,"formTitle":"[775]全局倒置与局部倒置","frequency":0.5299663557,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11710,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5694110576923077,"acs":1895,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"","submitted":3328,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.32445850837470674,"acs":5947,"articleLive":2,"columnArticles":65,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":1.1853732082,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":18329,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5929056093497211,"acs":24554,"articleLive":2,"columnArticles":356,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":41413,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.43677340176280266,"acs":19574,"articleLive":2,"columnArticles":243,"formTitle":"[779]第K个语法符号","frequency":1.6459420757,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":44815,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2877797745466427,"acs":3523,"articleLive":2,"columnArticles":54,"formTitle":"[780]到达终点","frequency":0.5612188992,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":12242,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6131864206520395,"acs":44632,"articleLive":2,"columnArticles":682,"formTitle":"[781]森林中的兔子","frequency":2.0286164134,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":72787,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4162826420890937,"acs":1626,"articleLive":2,"columnArticles":34,"formTitle":"[782]变为棋盘","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3906,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5966141562722589,"acs":72034,"articleLive":2,"columnArticles":697,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.3929911054,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":120738,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6906332995646579,"acs":50448,"articleLive":2,"columnArticles":583,"formTitle":"[784]字母大小写全排列","frequency":1.9963034245,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":73046,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5167146671641617,"acs":44315,"articleLive":2,"columnArticles":440,"formTitle":"[785]判断二分图","frequency":1.8554735886,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":85763,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.6747752794003894,"acs":25298,"articleLive":2,"columnArticles":258,"formTitle":"[786]第 K 个最小的素数分数","frequency":2.1761588888,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":37491,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3889288343348227,"acs":45437,"articleLive":2,"columnArticles":429,"formTitle":"[787]K 站中转内最便宜的航班","frequency":2.8051965652,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":116826,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6090458089040655,"acs":18906,"articleLive":2,"columnArticles":197,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":31042,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6902901604798184,"acs":21292,"articleLive":2,"columnArticles":301,"formTitle":"[789]逃脱阻碍者","frequency":2.3737488157,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30845,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4534524949462709,"acs":4262,"articleLive":2,"columnArticles":74,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.5001312072,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":9399,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6967944759445349,"acs":12412,"articleLive":2,"columnArticles":218,"formTitle":"[791]自定义字符串排序","frequency":1.0182071603,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":17813,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4652545171486531,"acs":9862,"articleLive":2,"columnArticles":107,"formTitle":"[792]匹配子序列的单词数","frequency":1.4805818301,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":21197,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3953423316315826,"acs":5653,"articleLive":2,"columnArticles":72,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":14299,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3895283663704716,"acs":28494,"articleLive":2,"columnArticles":462,"formTitle":"[794]有效的井字游戏","frequency":0.0760722799,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":73150,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.53014131536581,"acs":8891,"articleLive":2,"columnArticles":101,"formTitle":"[795]区间子数组个数","frequency":1.8886727603,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":16771,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5398478256386993,"acs":26181,"articleLive":2,"columnArticles":330,"formTitle":"[796]旋转字符串","frequency":2.2404235771,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":48497,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.789692186266772,"acs":50027,"articleLive":2,"columnArticles":605,"formTitle":"[797]所有可能的路径","frequency":2.2098775248,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":63350,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4714503816793893,"acs":1544,"articleLive":2,"columnArticles":38,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":3275,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4142163859548958,"acs":5804,"articleLive":2,"columnArticles":75,"formTitle":"[799]香槟塔","frequency":1.3805429075,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":14012,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7030625832223701,"acs":1584,"articleLive":2,"columnArticles":39,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"","submitted":2253,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4207280467172406,"acs":7709,"articleLive":2,"columnArticles":92,"formTitle":"[801]使序列递增的最小交换次数","frequency":1.6786996721,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":18323,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5776658715434225,"acs":32693,"articleLive":2,"columnArticles":344,"formTitle":"[802]找到最终的安全状态","frequency":2.5208278926,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":56595,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4800612323000383,"acs":12544,"articleLive":2,"columnArticles":128,"formTitle":"[803]打砖块","frequency":0.6284711262,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":26130,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7739040645827466,"acs":41222,"articleLive":2,"columnArticles":424,"formTitle":"[804]唯一摩尔斯密码词","frequency":0.988662914,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":53265,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2982525814138205,"acs":3004,"articleLive":2,"columnArticles":45,"formTitle":"[805]数组的均值分割","frequency":0.5299663557,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":10072,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6547139950260005,"acs":14479,"articleLive":2,"columnArticles":170,"formTitle":"[806]写字符串需要的行数","frequency":0.4442975611,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":22115,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8891336863807252,"acs":43989,"articleLive":2,"columnArticles":619,"formTitle":"[807]保持城市天际线","frequency":1.2341633724,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":49474,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.48382458662832495,"acs":4711,"articleLive":2,"columnArticles":43,"formTitle":"[808]分汤","frequency":0.594008722,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9737,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.42083701502128684,"acs":5239,"articleLive":2,"columnArticles":100,"formTitle":"[809]情感丰富的文字","frequency":0.4181180555,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":12449,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7304927686845067,"acs":16870,"articleLive":2,"columnArticles":135,"formTitle":"[810]黑板异或游戏","frequency":0.5001312072,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":23094,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7061007728509132,"acs":16354,"articleLive":2,"columnArticles":209,"formTitle":"[811]子域名访问计数","frequency":0.9602114928,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":23161,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6330939137009235,"acs":11723,"articleLive":2,"columnArticles":110,"formTitle":"[812]最大三角形面积","frequency":0.4716067405,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":18517,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5544604681498659,"acs":7651,"articleLive":2,"columnArticles":91,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":13799,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6999575611826284,"acs":24740,"articleLive":2,"columnArticles":383,"formTitle":"[814]二叉树剪枝","frequency":1.3805429075,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":35345,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.43275506565586097,"acs":27914,"articleLive":2,"columnArticles":325,"formTitle":"[815]公交路线","frequency":2.7682715654,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":64503,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5127931769722814,"acs":3848,"articleLive":2,"columnArticles":70,"formTitle":"[816]模糊坐标","frequency":0.5299663557,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":7504,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5924394319131161,"acs":14183,"articleLive":2,"columnArticles":177,"formTitle":"[817]链表组件","frequency":0.5001312072,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":23940,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.4344049633389735,"acs":3851,"articleLive":2,"columnArticles":48,"formTitle":"[818]赛车","frequency":0.5612188992,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8865,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42221427933160577,"acs":23625,"articleLive":2,"columnArticles":267,"formTitle":"[819]最常见的单词","frequency":0.3929911054,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":55955,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5096800597886045,"acs":57286,"articleLive":2,"columnArticles":629,"formTitle":"[820]单词的压缩编码","frequency":0.4181180555,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":112396,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6943971541100241,"acs":27328,"articleLive":2,"columnArticles":372,"formTitle":"[821]字符的最短距离","frequency":1.3199121576,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":39355,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5086527575610545,"acs":3145,"articleLive":2,"columnArticles":42,"formTitle":"[822]翻转卡片游戏","frequency":0.6284711262,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":6183,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4273914201971756,"acs":3208,"articleLive":2,"columnArticles":56,"formTitle":"[823]带因子的二叉树","frequency":0.5299663557,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":7506,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6173376108178964,"acs":17896,"articleLive":2,"columnArticles":249,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":28989,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.45424179764882805,"acs":31414,"articleLive":2,"columnArticles":310,"formTitle":"[825]适龄的朋友","frequency":1.2716470919,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"ac","submitted":69157,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.381356302741463,"acs":8722,"articleLive":2,"columnArticles":128,"formTitle":"[826]安排工作以达到最大收益","frequency":1.6459420757,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":22871,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.39210291493158833,"acs":10546,"articleLive":2,"columnArticles":204,"formTitle":"[827]最大人工岛","frequency":1.0808941382,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":26896,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.502324926025081,"acs":3565,"articleLive":2,"columnArticles":57,"formTitle":"[828]统计子串中的唯一字符","frequency":0.4716067405,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":7097,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.367866927592955,"acs":9399,"articleLive":2,"columnArticles":111,"formTitle":"[829]连续整数求和","frequency":1.0182071603,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":25550,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.542944156190398,"acs":52949,"articleLive":2,"columnArticles":596,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":97522,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.4074550128534704,"acs":7925,"articleLive":2,"columnArticles":79,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":19450,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7955357385114907,"acs":87960,"articleLive":2,"columnArticles":963,"formTitle":"[832]翻转图像","frequency":0.4442975611,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":110567,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4381367135858154,"acs":5634,"articleLive":2,"columnArticles":84,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":12859,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5268891446106636,"acs":13736,"articleLive":2,"columnArticles":134,"formTitle":"[834]树中距离之和","frequency":1.1853732082,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":26070,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5763677811550152,"acs":4551,"articleLive":2,"columnArticles":52,"formTitle":"[835]图像重叠","frequency":0.5001312072,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7896,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4810378267605118,"acs":39435,"articleLive":2,"columnArticles":675,"formTitle":"[836]矩形重叠","frequency":1.8554735886,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":81979,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.3958425297965408,"acs":19728,"articleLive":2,"columnArticles":247,"formTitle":"[837]新 21 点","frequency":1.1853732082,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":49838,"title":"新 21 点","titleSlug":"new-21-game"},{"acceptance":0.5013143553247419,"acs":7819,"articleLive":2,"columnArticles":139,"formTitle":"[838]推多米诺","frequency":2.4526082093,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":15597,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5751376868607396,"acs":19737,"articleLive":2,"columnArticles":277,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":34317,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3606080583239617,"acs":9299,"articleLive":2,"columnArticles":118,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25787,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6594280076684194,"acs":58819,"articleLive":2,"columnArticles":582,"formTitle":"[841]钥匙和房间","frequency":1.3496762595,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":89197,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48743802760284066,"acs":29102,"articleLive":2,"columnArticles":325,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":1.8554735886,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":59704,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.38585047666833916,"acs":3076,"articleLive":2,"columnArticles":37,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7972,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.507216901964656,"acs":102752,"articleLive":2,"columnArticles":1094,"formTitle":"[844]比较含退格的字符串","frequency":1.1609460044,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":202580,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.42202210397052803,"acs":39178,"articleLive":2,"columnArticles":575,"formTitle":"[845]数组中的最长山脉","frequency":1.8886727603,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":92834,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5730153042944157,"acs":33585,"articleLive":2,"columnArticles":477,"formTitle":"[846]一手顺子","frequency":0.8013600268,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":58611,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6790401463706415,"acs":19299,"articleLive":2,"columnArticles":161,"formTitle":"[847]访问所有节点的最短路径","frequency":2.9563130497,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":28421,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44817017383348584,"acs":9797,"articleLive":2,"columnArticles":107,"formTitle":"[848]字母移位","frequency":1.6786996721,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":21860,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42814624759461195,"acs":16687,"articleLive":2,"columnArticles":201,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":38975,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.44846843797596886,"acs":2650,"articleLive":2,"columnArticles":45,"formTitle":"[850]矩形面积 II","frequency":2.1706568116,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5909,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.6286212045793927,"acs":25258,"articleLive":2,"columnArticles":272,"formTitle":"[851]喧闹和富有","frequency":0.9546460287,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":40180,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7138801387615136,"acs":89517,"articleLive":2,"columnArticles":770,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":125395,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3894641740218222,"acs":11208,"articleLive":2,"columnArticles":141,"formTitle":"[853]车队","frequency":1.6459420757,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":28778,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.36363636363636365,"acs":4584,"articleLive":2,"columnArticles":75,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12606,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4129687842678558,"acs":5649,"articleLive":2,"columnArticles":65,"formTitle":"[855]考场就座","frequency":0.4442975611,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":13679,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6295742274435404,"acs":17256,"articleLive":2,"columnArticles":235,"formTitle":"[856]括号的分数","frequency":2.6984412663,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":27409,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.47176841501863,"acs":3292,"articleLive":2,"columnArticles":52,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.4181180555,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6978,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.555256064690027,"acs":3090,"articleLive":2,"columnArticles":52,"formTitle":"[858]镜面反射","frequency":1.8636589498,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5565,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3458199665806925,"acs":59397,"articleLive":2,"columnArticles":752,"formTitle":"[859]亲密字符串","frequency":2.4185938956,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":171757,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5855984027449832,"acs":97963,"articleLive":2,"columnArticles":845,"formTitle":"[860]柠檬水找零","frequency":1.2365614551,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":167287,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8093294019807968,"acs":32115,"articleLive":2,"columnArticles":454,"formTitle":"[861]翻转矩阵后的得分","frequency":1.114219448,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":39681,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.19670595581921785,"acs":17640,"articleLive":2,"columnArticles":139,"formTitle":"[862]和至少为 K 的最短子数组","frequency":2.3385896309,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":89677,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6062170333204683,"acs":37697,"articleLive":2,"columnArticles":583,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":2.5724789284,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":62184,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.462975875052294,"acs":3320,"articleLive":2,"columnArticles":47,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.594008722,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":7171,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.664483357839861,"acs":9942,"articleLive":2,"columnArticles":142,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.4181180555,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":14962,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22765527688941256,"acs":8115,"articleLive":2,"columnArticles":96,"formTitle":"[866]回文素数","frequency":0.5001312072,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":35646,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6687424981683839,"acs":85801,"articleLive":2,"columnArticles":770,"formTitle":"[867]转置矩阵","frequency":1.3805429075,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":128302,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6264426217609058,"acs":17261,"articleLive":2,"columnArticles":252,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":27554,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.6424491392801251,"acs":32842,"articleLive":2,"columnArticles":470,"formTitle":"[869]重新排序得到 2 的幂","frequency":1.8886727603,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"ac","submitted":51120,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4385413146882229,"acs":16872,"articleLive":2,"columnArticles":217,"formTitle":"[870]优势洗牌","frequency":1.6143688138,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":38473,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.34680997929198304,"acs":10551,"articleLive":2,"columnArticles":135,"formTitle":"[871]最低加油次数","frequency":2.062116643,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":30423,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.651963094452648,"acs":62254,"articleLive":2,"columnArticles":745,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":95487,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.519743534416325,"acs":16861,"articleLive":2,"columnArticles":126,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":1.9231446693,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":32441,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41956930472369214,"acs":21646,"articleLive":2,"columnArticles":243,"formTitle":"[874]模拟行走机器人","frequency":1.4125900849,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":51591,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.48224458530946984,"acs":52569,"articleLive":2,"columnArticles":414,"formTitle":"[875]爱吃香蕉的珂珂","frequency":1.8234606116,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":109009,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7058248913208458,"acs":181361,"articleLive":2,"columnArticles":1881,"formTitle":"[876]链表的中间结点","frequency":2.4354472802,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":256949,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7581929311719373,"acs":71327,"articleLive":2,"columnArticles":500,"formTitle":"[877]石子游戏","frequency":1.2911800528,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":94075,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.28574844571975133,"acs":4780,"articleLive":2,"columnArticles":67,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":16728,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5526943726386956,"acs":22236,"articleLive":2,"columnArticles":188,"formTitle":"[879]盈利计划","frequency":1.9231446693,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":40232,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2552117000646412,"acs":6317,"articleLive":2,"columnArticles":83,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":24752,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5380060500740169,"acs":50154,"articleLive":2,"columnArticles":608,"formTitle":"[881]救生艇","frequency":3.5333413071,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":93222,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.49301444470755384,"acs":2082,"articleLive":2,"columnArticles":35,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":4223,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6935144557312015,"acs":11538,"articleLive":2,"columnArticles":124,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":16637,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.662828894913092,"acs":20783,"articleLive":2,"columnArticles":270,"formTitle":"[884]两句话中的不常见单词","frequency":1.0489221055,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":31355,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6979209131675499,"acs":5136,"articleLive":2,"columnArticles":75,"formTitle":"[885]螺旋矩阵 III","frequency":1.0808941382,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":7359,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4404863481228669,"acs":10325,"articleLive":2,"columnArticles":138,"formTitle":"[886]可能的二分法","frequency":1.8886727603,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":23440,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2907366431072633,"acs":54134,"articleLive":2,"columnArticles":355,"formTitle":"[887]鸡蛋掉落","frequency":2.6984412663,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":186196,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6410431535930973,"acs":56315,"articleLive":2,"columnArticles":480,"formTitle":"[888]公平的糖果交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":87849,"title":"公平的糖果交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6746737128673232,"acs":16852,"articleLive":2,"columnArticles":167,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":1.8554735886,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":24978,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7278890115087499,"acs":9234,"articleLive":2,"columnArticles":133,"formTitle":"[890]查找和替换模式","frequency":0.5612188992,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12686,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.33152173913043476,"acs":2989,"articleLive":2,"columnArticles":40,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":9016,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6385356309729852,"acs":33942,"articleLive":2,"columnArticles":693,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":53156,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7246918436926305,"acs":11053,"articleLive":2,"columnArticles":112,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":15252,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7756449375866852,"acs":13981,"articleLive":2,"columnArticles":131,"formTitle":"[894]所有可能的满二叉树","frequency":0.4716067405,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":18025,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5585149313962873,"acs":8304,"articleLive":2,"columnArticles":93,"formTitle":"[895]最大频率栈","frequency":2.1761588888,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":14868,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5846616370752737,"acs":61842,"articleLive":2,"columnArticles":737,"formTitle":"[896]单调数列","frequency":0.3929911054,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":105774,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7429719800532067,"acs":64513,"articleLive":2,"columnArticles":741,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":86831,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3427260812581914,"acs":5753,"articleLive":2,"columnArticles":41,"formTitle":"[898]子数组按位或操作","frequency":0.4442975611,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":16786,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5417169037858693,"acs":4493,"articleLive":2,"columnArticles":53,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":8294,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4993279569892473,"acs":3715,"articleLive":2,"columnArticles":60,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":7440,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5503857721982477,"acs":21044,"articleLive":2,"columnArticles":254,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":38235,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.3398923333952107,"acs":3662,"articleLive":2,"columnArticles":83,"formTitle":"[902]最大为 N 的数字组合","frequency":1.114219448,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10774,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5372507869884575,"acs":3072,"articleLive":2,"columnArticles":45,"formTitle":"[903]DI 序列的有效排列","frequency":0.8807415775,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5718,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4480458365668808,"acs":27135,"articleLive":2,"columnArticles":387,"formTitle":"[904]水果成篮","frequency":2.3954958944,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":60563,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.6999200730760448,"acs":61299,"articleLive":2,"columnArticles":650,"formTitle":"[905]按奇偶排序数组","frequency":1.4125900849,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":87580,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2885068299576072,"acs":2450,"articleLive":2,"columnArticles":44,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":8492,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3228254524226503,"acs":12719,"articleLive":2,"columnArticles":138,"formTitle":"[907]子数组的最小值之和","frequency":1.9963034245,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":39399,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6980424041528551,"acs":22322,"articleLive":2,"columnArticles":207,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":31978,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.45934072006852533,"acs":16624,"articleLive":2,"columnArticles":199,"formTitle":"[909]蛇梯棋","frequency":0.5612188992,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":36191,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3212707182320442,"acs":6978,"articleLive":2,"columnArticles":71,"formTitle":"[910]最小差值 II","frequency":0.4442975611,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":21720,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.5426705034762335,"acs":25836,"articleLive":2,"columnArticles":320,"formTitle":"[911]在线选举","frequency":0.9969893568,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":47609,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5573849756237635,"acs":263987,"articleLive":2,"columnArticles":1196,"formTitle":"[912]排序数组","frequency":3.9153614522,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":473617,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.4040187280530628,"acs":2071,"articleLive":2,"columnArticles":35,"formTitle":"[913]猫和老鼠","frequency":0.8320938533,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":5126,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3888086949138151,"acs":50369,"articleLive":2,"columnArticles":633,"formTitle":"[914]卡牌分组","frequency":1.0182071603,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":129547,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46856190387998886,"acs":10120,"articleLive":2,"columnArticles":126,"formTitle":"[915]分割数组","frequency":0.4716067405,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":21598,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44671186886972547,"acs":6786,"articleLive":2,"columnArticles":81,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":15191,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5694469628286492,"acs":31405,"articleLive":2,"columnArticles":464,"formTitle":"[917]仅仅反转字母","frequency":1.3805429075,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":55150,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3620974133115069,"acs":27871,"articleLive":2,"columnArticles":281,"formTitle":"[918]环形子数组的最大和","frequency":2.4560782663,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":76971,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6450425822731574,"acs":6135,"articleLive":2,"columnArticles":109,"formTitle":"[919]完全二叉树插入器","frequency":0.4716067405,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":9511,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.48849042888296584,"acs":2016,"articleLive":2,"columnArticles":22,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":4127,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7442031299904184,"acs":23301,"articleLive":2,"columnArticles":343,"formTitle":"[921]使括号有效的最少添加","frequency":1.0182071603,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":31310,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7139863438473851,"acs":92332,"articleLive":2,"columnArticles":862,"formTitle":"[922]按奇偶排序数组 II","frequency":1.3496762595,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":129319,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3440530883103624,"acs":6740,"articleLive":2,"columnArticles":88,"formTitle":"[923]三数之和的多种可能","frequency":1.114219448,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":19590,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35878413189077796,"acs":6964,"articleLive":2,"columnArticles":99,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.5299663557,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":19410,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3868352619460982,"acs":51916,"articleLive":2,"columnArticles":694,"formTitle":"[925]长按键入","frequency":1.3805429075,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":134207,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5338014594520171,"acs":7754,"articleLive":2,"columnArticles":146,"formTitle":"[926]将字符串翻转到单调递增","frequency":1.0808941382,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":14526,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3417591642570656,"acs":3664,"articleLive":2,"columnArticles":77,"formTitle":"[927]三等分","frequency":1.4459042916,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10721,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.42380106571936055,"acs":2386,"articleLive":2,"columnArticles":46,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5630,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6447930157816473,"acs":26884,"articleLive":2,"columnArticles":240,"formTitle":"[929]独特的电子邮件地址","frequency":0.4181180555,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":41694,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5455882808386757,"acs":35233,"articleLive":2,"columnArticles":356,"formTitle":"[930]和相同的二元子数组","frequency":2.7766672155,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":64578,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6712394766203469,"acs":26471,"articleLive":2,"columnArticles":336,"formTitle":"[931]下降路径最小和","frequency":0.9602114928,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":39436,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6379405286343612,"acs":9268,"articleLive":2,"columnArticles":89,"formTitle":"[932]漂亮数组","frequency":1.0182071603,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":14528,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7277666362807658,"acs":39918,"articleLive":2,"columnArticles":345,"formTitle":"[933]最近的请求次数","frequency":2.0286164134,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":54850,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4711502334818314,"acs":26334,"articleLive":2,"columnArticles":293,"formTitle":"[934]最短的桥","frequency":0.4442975611,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":55893,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4804920658028825,"acs":6601,"articleLive":2,"columnArticles":88,"formTitle":"[935]骑士拨号器","frequency":0.988662914,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":13738,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.3791599724581134,"acs":1652,"articleLive":2,"columnArticles":28,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4357,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5877728865331058,"acs":13085,"articleLive":2,"columnArticles":137,"formTitle":"[937]重新排列日志文件","frequency":1.0182071603,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":22262,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8201159599174963,"acs":100994,"articleLive":2,"columnArticles":836,"formTitle":"[938]二叉搜索树的范围和","frequency":1.0182071603,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":123146,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4572898539759401,"acs":6044,"articleLive":2,"columnArticles":65,"formTitle":"[939]最小面积矩形","frequency":1.0182071603,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":13217,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.42547943025383944,"acs":5347,"articleLive":2,"columnArticles":67,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":12567,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3929710492937801,"acs":63824,"articleLive":2,"columnArticles":637,"formTitle":"[941]有效的山脉数组","frequency":1.3805429075,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":162414,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7323130498533724,"acs":23973,"articleLive":2,"columnArticles":227,"formTitle":"[942]增减字符串匹配","frequency":0.4442975611,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":32736,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4564737074679629,"acs":2066,"articleLive":2,"columnArticles":46,"formTitle":"[943]最短超级串","frequency":0.6284711262,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":4526,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6867828567884389,"acs":22146,"articleLive":2,"columnArticles":190,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":32246,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4854549562120427,"acs":36530,"articleLive":2,"columnArticles":548,"formTitle":"[945]使数组唯一的最小增量","frequency":0.4442975611,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":75249,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6280930192974618,"acs":29521,"articleLive":2,"columnArticles":338,"formTitle":"[946]验证栈序列","frequency":1.7925558035,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":47001,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6128988024499498,"acs":26818,"articleLive":2,"columnArticles":344,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":43756,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.39368305410601484,"acs":7167,"articleLive":2,"columnArticles":103,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":18205,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.3732824427480916,"acs":8802,"articleLive":2,"columnArticles":126,"formTitle":"[949]给定数字能组成的最大时间","frequency":1.6786996721,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":23580,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7772299417301658,"acs":10404,"articleLive":2,"columnArticles":161,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.988662914,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":13386,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6630194518125553,"acs":11998,"articleLive":2,"columnArticles":182,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":18096,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.36363636363636365,"acs":3436,"articleLive":2,"columnArticles":66,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":9449,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.551565921651778,"acs":15868,"articleLive":2,"columnArticles":187,"formTitle":"[953]验证外星语词典","frequency":0.4442975611,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":28769,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.30548829701372077,"acs":7570,"articleLive":2,"columnArticles":109,"formTitle":"[954]二倍数对数组","frequency":1.4459042916,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":24780,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3334292014188477,"acs":3478,"articleLive":2,"columnArticles":56,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":10431,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.44158926728586173,"acs":4279,"articleLive":2,"columnArticles":55,"formTitle":"[956]最高的广告牌","frequency":0.5299663557,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9690,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.3612661127220449,"acs":14826,"articleLive":2,"columnArticles":148,"formTitle":"[957]N 天后的牢房","frequency":2.2812344635,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":41039,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5377062358840868,"acs":28093,"articleLive":2,"columnArticles":271,"formTitle":"[958]二叉树的完全性检验","frequency":1.9231446693,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":52246,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7442409923213231,"acs":20160,"articleLive":2,"columnArticles":309,"formTitle":"[959]由斜杠划分区域","frequency":1.0182071603,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":27088,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5601365546218487,"acs":2133,"articleLive":2,"columnArticles":35,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3808,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6776085650683722,"acs":38354,"articleLive":2,"columnArticles":331,"formTitle":"[961]在长度 2N 的数组中找出重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":56602,"title":"在长度 2N 的数组中找出重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.44676857878008175,"acs":14759,"articleLive":2,"columnArticles":149,"formTitle":"[962]最大宽度坡","frequency":1.114219448,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":33035,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5137476459510358,"acs":2728,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":1.724369709,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5310,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4405594405594406,"acs":1575,"articleLive":2,"columnArticles":29,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3575,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6846059490953695,"acs":35720,"articleLive":2,"columnArticles":420,"formTitle":"[965]单值二叉树","frequency":1.3805429075,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":52176,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.41047276337014516,"acs":3308,"articleLive":2,"columnArticles":54,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":8059,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.47187661257955393,"acs":8230,"articleLive":2,"columnArticles":167,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":17441,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.5028705967581273,"acs":27766,"articleLive":2,"columnArticles":357,"formTitle":"[968]监控二叉树","frequency":1.3496762595,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"ac","submitted":55215,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6478681643281899,"acs":16669,"articleLive":2,"columnArticles":208,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":25729,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41256232736664633,"acs":11501,"articleLive":2,"columnArticles":130,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":27877,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4446738734361715,"acs":7322,"articleLive":2,"columnArticles":113,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":16466,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.40590619571511294,"acs":1402,"articleLive":2,"columnArticles":32,"formTitle":"[972]相等的有理数","frequency":0.7030490946,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3454,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.643098977092638,"acs":71420,"articleLive":2,"columnArticles":662,"formTitle":"[973]最接近原点的 K 个点","frequency":1.3496762595,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":111056,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.46660483463845875,"acs":39744,"articleLive":2,"columnArticles":401,"formTitle":"[974]和可被 K 整除的子数组","frequency":2.1761588888,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":85177,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4524130493394446,"acs":3356,"articleLive":2,"columnArticles":52,"formTitle":"[975]奇偶跳","frequency":0.5001312072,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":7418,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.597952057582314,"acs":55826,"articleLive":2,"columnArticles":522,"formTitle":"[976]三角形的最大周长","frequency":1.5839018723,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":93362,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7017069746665816,"acs":219929,"articleLive":2,"columnArticles":1639,"formTitle":"[977]有序数组的平方","frequency":3.1277449223,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":313420,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4732195283391517,"acs":44326,"articleLive":2,"columnArticles":607,"formTitle":"[978]最长湍流子数组","frequency":0.4716067405,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":93669,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7149381841089849,"acs":9079,"articleLive":2,"columnArticles":142,"formTitle":"[979]在二叉树中分配硬币","frequency":1.3805429075,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":12699,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7351019025027835,"acs":15185,"articleLive":2,"columnArticles":229,"formTitle":"[980]不同路径 III","frequency":2.2720093059,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":20657,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5306156525057845,"acs":22245,"articleLive":2,"columnArticles":322,"formTitle":"[981]基于时间的键值存储","frequency":2.5903413307,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":41923,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5508236239453596,"acs":2742,"articleLive":2,"columnArticles":32,"formTitle":"[982]按位与为零的三元组","frequency":0.5001312072,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4978,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6336388547670793,"acs":33529,"articleLive":2,"columnArticles":463,"formTitle":"[983]最低票价","frequency":1.4125900849,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":52915,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4201964395334561,"acs":9583,"articleLive":2,"columnArticles":155,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":1.6143688138,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":22806,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6018277705533882,"acs":16661,"articleLive":2,"columnArticles":192,"formTitle":"[985]查询后的偶数和","frequency":0.5001312072,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27684,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6828567072506697,"acs":31352,"articleLive":2,"columnArticles":293,"formTitle":"[986]区间列表的交集","frequency":1.7058163011,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":45913,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5329942618675013,"acs":24522,"articleLive":2,"columnArticles":426,"formTitle":"[987]二叉树的垂序遍历","frequency":2.5805565168,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":46008,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.5017119039348981,"acs":10111,"articleLive":2,"columnArticles":123,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.4442975611,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":20153,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.46950284526527414,"acs":55114,"articleLive":2,"columnArticles":623,"formTitle":"[989]数组形式的整数加法","frequency":0.988662914,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":117388,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.508169888126619,"acs":35703,"articleLive":2,"columnArticles":528,"formTitle":"[990]等式方程的可满足性","frequency":0.4442975611,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":70258,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5209063170979772,"acs":9219,"articleLive":2,"columnArticles":114,"formTitle":"[991]坏了的计算器","frequency":0.4442975611,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":17698,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45575262327049865,"acs":24540,"articleLive":2,"columnArticles":279,"formTitle":"[992]K 个不同整数的子数组","frequency":1.0182071603,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":53845,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.557333025627039,"acs":53130,"articleLive":2,"columnArticles":836,"formTitle":"[993]二叉树的堂兄弟节点","frequency":1.3496762595,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":95329,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5106569860673505,"acs":63371,"articleLive":2,"columnArticles":1509,"formTitle":"[994]腐烂的橘子","frequency":1.9650996448,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":124097,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5340551276461755,"acs":22049,"articleLive":2,"columnArticles":255,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.5299663557,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":41286,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.4943796394485684,"acs":4662,"articleLive":2,"columnArticles":95,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":9430,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5355188542572127,"acs":64688,"articleLive":2,"columnArticles":692,"formTitle":"[997]找到小镇的法官","frequency":1.1450646723,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":120795,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6184331093463653,"acs":8099,"articleLive":2,"columnArticles":121,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":13096,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6912908242612753,"acs":31115,"articleLive":2,"columnArticles":580,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":45010,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4118457300275482,"acs":3887,"articleLive":2,"columnArticles":44,"formTitle":"[1000]合并石头的最低成本","frequency":1.5544706722,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":9438,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29730083857442346,"acs":2269,"articleLive":2,"columnArticles":59,"formTitle":"[1001]网格照明","frequency":0.6284711262,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7632,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7301345673750228,"acs":59955,"articleLive":2,"columnArticles":632,"formTitle":"[1002]查找共用字符","frequency":2.1436281392,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":82115,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.579220306600555,"acs":12733,"articleLive":2,"columnArticles":193,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21983,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5956401045068582,"acs":72954,"articleLive":2,"columnArticles":762,"formTitle":"[1004]最大连续1的个数 III","frequency":2.5486512584,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":122480,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5205962234868081,"acs":64404,"articleLive":2,"columnArticles":1021,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.8253985953,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":123712,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6267648950149579,"acs":44835,"articleLive":2,"columnArticles":612,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":71534,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.4666435024322446,"acs":6715,"articleLive":2,"columnArticles":89,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":14390,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7221117822463491,"acs":18889,"articleLive":2,"columnArticles":243,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":1.2911800528,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":26158,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5888409961685823,"acs":17213,"articleLive":2,"columnArticles":246,"formTitle":"[1009]十进制整数的反码","frequency":1.0182071603,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":29232,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45587084844605646,"acs":19230,"articleLive":2,"columnArticles":257,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.4442975611,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":42183,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6254427562179425,"acs":64627,"articleLive":2,"columnArticles":616,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":1.6459420757,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":103330,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.33949719509661336,"acs":3268,"articleLive":2,"columnArticles":68,"formTitle":"[1012]至少有 1 位重复的数字","frequency":1.2634159152,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9626,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39411013386794286,"acs":48753,"articleLive":2,"columnArticles":941,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":1.6786996721,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":123704,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5571614962694602,"acs":43984,"articleLive":2,"columnArticles":505,"formTitle":"[1014]最佳观光组合","frequency":0.9327824556,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":78943,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.3597623437820119,"acs":5268,"articleLive":2,"columnArticles":44,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.6284711262,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":14643,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5845211698870235,"acs":5536,"articleLive":2,"columnArticles":90,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.5001312072,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":9471,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5622770511296076,"acs":3783,"articleLive":2,"columnArticles":58,"formTitle":"[1017]负二进制转换","frequency":0.5299663557,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6728,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5156503247313063,"acs":44859,"articleLive":2,"columnArticles":385,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":86995,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.6002934337282693,"acs":21685,"articleLive":2,"columnArticles":290,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.5001312072,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":36124,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5522648953703241,"acs":11058,"articleLive":2,"columnArticles":170,"formTitle":"[1020]飞地的数量","frequency":0.9327824556,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":20023,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7831864779586012,"acs":59819,"articleLive":2,"columnArticles":678,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":76379,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7081226716338478,"acs":21289,"articleLive":2,"columnArticles":284,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.4442975611,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":30064,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5677017712888164,"acs":7660,"articleLive":2,"columnArticles":177,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":13493,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5555679022144615,"acs":34998,"articleLive":2,"columnArticles":399,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":62995,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7089619261019839,"acs":78151,"articleLive":2,"columnArticles":666,"formTitle":"[1025]除数博弈","frequency":0.988662914,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":110233,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6766365688487584,"acs":10791,"articleLive":2,"columnArticles":187,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":15948,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.434807375206116,"acs":14503,"articleLive":2,"columnArticles":133,"formTitle":"[1027]最长等差数列","frequency":1.6459420757,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":33355,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7320901482793346,"acs":21082,"articleLive":2,"columnArticles":441,"formTitle":"[1028]从先序遍历还原二叉树","frequency":1.6786996721,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":28797,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6605263157894737,"acs":17821,"articleLive":2,"columnArticles":195,"formTitle":"[1029]两地调度","frequency":0.3929911054,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":26980,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7097017096503688,"acs":41470,"articleLive":2,"columnArticles":456,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.4716067405,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":58433,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5737179487179487,"acs":5370,"articleLive":2,"columnArticles":88,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":9360,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.41126400907930205,"acs":2899,"articleLive":2,"columnArticles":47,"formTitle":"[1032]字符流","frequency":1.0808941382,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":7049,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.39370378049623334,"acs":11393,"articleLive":2,"columnArticles":172,"formTitle":"[1033]移动石子直到连续","frequency":0.5001312072,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28938,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.5606469002695418,"acs":28496,"articleLive":2,"columnArticles":460,"formTitle":"[1034]边界着色","frequency":1.2105634571,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":50827,"title":"边界着色","titleSlug":"coloring-a-border"},{"acceptance":0.6405313408053134,"acs":38576,"articleLive":2,"columnArticles":413,"formTitle":"[1035]不相交的线","frequency":0.4442975611,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":60225,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.30213270142180093,"acs":3570,"articleLive":2,"columnArticles":60,"formTitle":"[1036]逃离大迷宫","frequency":1.1853732082,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":11816,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.4394200462281992,"acs":10456,"articleLive":2,"columnArticles":135,"formTitle":"[1037]有效的回旋镖","frequency":1.4125900849,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":23795,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.795935914705798,"acs":27771,"articleLive":2,"columnArticles":346,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.9327824556,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":34891,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5586805555555555,"acs":4827,"articleLive":2,"columnArticles":65,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8640,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5229788032264115,"acs":2788,"articleLive":2,"columnArticles":32,"formTitle":"[1040]移动石子直到连续 II","frequency":0.6284711262,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5331,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.487739291888085,"acs":7618,"articleLive":2,"columnArticles":125,"formTitle":"[1041]困于环中的机器人","frequency":1.4459042916,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":15619,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5348816979819068,"acs":12298,"articleLive":2,"columnArticles":160,"formTitle":"[1042]不邻接植花","frequency":0.4716067405,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":22992,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.692809364548495,"acs":8286,"articleLive":2,"columnArticles":104,"formTitle":"[1043]分隔数组以得到最大和","frequency":1.4459042916,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11960,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.3472677457852184,"acs":20660,"articleLive":2,"columnArticles":185,"formTitle":"[1044]最长重复子串","frequency":2.4132640318,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"ac","submitted":59493,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6411616676868667,"acs":9427,"articleLive":2,"columnArticles":117,"formTitle":"[1045]买下所有产品的客户","frequency":0.4442975611,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"","submitted":14703,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6591175172254956,"acs":68684,"articleLive":2,"columnArticles":958,"formTitle":"[1046]最后一块石头的重量","frequency":0.988662914,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":104206,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7244828818173978,"acs":117614,"articleLive":2,"columnArticles":1040,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":2.5724789284,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":162342,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.46470637373652995,"acs":11126,"articleLive":2,"columnArticles":158,"formTitle":"[1048]最长字符串链","frequency":2.6477779086,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":23942,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6519619757487375,"acs":48283,"articleLive":2,"columnArticles":445,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.9602114928,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":74058,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7607189776663084,"acs":12739,"articleLive":2,"columnArticles":60,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":1.3496762595,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"","submitted":16746,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7563148346280877,"acs":32517,"articleLive":2,"columnArticles":385,"formTitle":"[1051]高度检查器","frequency":0.9602114928,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":42994,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5801592175857794,"acs":50066,"articleLive":2,"columnArticles":775,"formTitle":"[1052]爱生气的书店老板","frequency":1.0808941382,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":86297,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4600667408231368,"acs":6204,"articleLive":2,"columnArticles":98,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":13485,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.38204414931801867,"acs":8515,"articleLive":2,"columnArticles":113,"formTitle":"[1054]距离相等的条形码","frequency":0.4442975611,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":22288,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5952618177792538,"acs":5377,"articleLive":2,"columnArticles":100,"formTitle":"[1055]形成字符串的最短路径","frequency":1.0489221055,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"","submitted":9033,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4173347275473452,"acs":3592,"articleLive":2,"columnArticles":70,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"","submitted":8607,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.47214464206967516,"acs":3212,"articleLive":2,"columnArticles":42,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"","submitted":6803,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.34585365853658534,"acs":1418,"articleLive":2,"columnArticles":37,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"","submitted":4100,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.36595114729829753,"acs":2472,"articleLive":2,"columnArticles":40,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"","submitted":6755,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.529491263635486,"acs":5485,"articleLive":2,"columnArticles":80,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"","submitted":10359,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6060293206690068,"acs":2935,"articleLive":2,"columnArticles":65,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"","submitted":4843,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5478653650007286,"acs":3760,"articleLive":2,"columnArticles":53,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"","submitted":6863,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7091167080525009,"acs":1999,"articleLive":2,"columnArticles":43,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"","submitted":2819,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6467807869187532,"acs":5063,"articleLive":2,"columnArticles":72,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"","submitted":7828,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5442697558957386,"acs":2631,"articleLive":2,"columnArticles":73,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"","submitted":4834,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.4781202845440828,"acs":2218,"articleLive":2,"columnArticles":43,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"","submitted":4639,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.41821649976156416,"acs":877,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"","submitted":2097,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8673252924419662,"acs":14310,"articleLive":2,"columnArticles":69,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"","submitted":16499,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8184021000201925,"acs":12159,"articleLive":2,"columnArticles":60,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"","submitted":14857,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.47943920075067614,"acs":8686,"articleLive":2,"columnArticles":76,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"","submitted":18117,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5876000529205531,"acs":35531,"articleLive":2,"columnArticles":683,"formTitle":"[1071]字符串的最大公因子","frequency":0.988662914,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":60468,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5895595432300164,"acs":3614,"articleLive":2,"columnArticles":61,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":6130,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.34203689269940246,"acs":2633,"articleLive":2,"columnArticles":56,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7698,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6687402799377916,"acs":18920,"articleLive":2,"columnArticles":195,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":28292,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6946084218811491,"acs":10590,"articleLive":2,"columnArticles":78,"formTitle":"[1075]项目员工 I","frequency":0.4442975611,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"","submitted":15246,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4940225188018954,"acs":11364,"articleLive":2,"columnArticles":94,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"","submitted":23003,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7230218965366833,"acs":8288,"articleLive":2,"columnArticles":91,"formTitle":"[1077]项目员工 III","frequency":0.4716067405,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"","submitted":11463,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6574875856691427,"acs":32042,"articleLive":2,"columnArticles":443,"formTitle":"[1078]Bigram 分词","frequency":0.3088049655,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":48734,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.735391866578041,"acs":12170,"articleLive":2,"columnArticles":204,"formTitle":"[1079]活字印刷","frequency":0.4442975611,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":16549,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.49634107540566336,"acs":4680,"articleLive":2,"columnArticles":102,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":9429,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5722793335696561,"acs":16144,"articleLive":2,"columnArticles":164,"formTitle":"[1081]不同字符的最小子序列","frequency":1.6143688138,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":28210,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7605693263373741,"acs":12611,"articleLive":2,"columnArticles":99,"formTitle":"[1082]销售分析 I ","frequency":1.0808941382,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"","submitted":16581,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5284545576467432,"acs":11821,"articleLive":2,"columnArticles":110,"formTitle":"[1083]销售分析 II","frequency":1.0489221055,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"","submitted":22369,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5358326233077724,"acs":11320,"articleLive":2,"columnArticles":105,"formTitle":"[1084]销售分析III","frequency":0.4716067405,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"","submitted":21126,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7721724979658259,"acs":3796,"articleLive":2,"columnArticles":76,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"","submitted":4916,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.685743484925907,"acs":5368,"articleLive":2,"columnArticles":86,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"","submitted":7828,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5388228792484112,"acs":1950,"articleLive":2,"columnArticles":56,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"","submitted":3619,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.4571778140293638,"acs":1121,"articleLive":2,"columnArticles":36,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"","submitted":2452,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5839105704792477,"acs":20737,"articleLive":2,"columnArticles":308,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":35514,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5523809523809524,"acs":4176,"articleLive":2,"columnArticles":87,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7560,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.38047282419747364,"acs":32831,"articleLive":2,"columnArticles":330,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":2.42529903,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":86290,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4951190272306902,"acs":2891,"articleLive":2,"columnArticles":57,"formTitle":"[1092]最短公共超序列","frequency":1.8234606116,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5839,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.37107095802747975,"acs":3943,"articleLive":2,"columnArticles":63,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":10626,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.5905380023431834,"acs":31755,"articleLive":2,"columnArticles":442,"formTitle":"[1094]拼车","frequency":2.2098775248,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":53773,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3723343146406261,"acs":20742,"articleLive":2,"columnArticles":398,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":55708,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5503231763619575,"acs":1788,"articleLive":2,"columnArticles":49,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3249,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5222696309604012,"acs":6977,"articleLive":2,"columnArticles":123,"formTitle":"[1097]游戏玩法分析 V","frequency":1.9963034245,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"","submitted":13359,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4749693323208131,"acs":8131,"articleLive":2,"columnArticles":108,"formTitle":"[1098]小众书籍","frequency":0.5299663557,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"","submitted":17119,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5866536033093839,"acs":5389,"articleLive":2,"columnArticles":99,"formTitle":"[1099]小于 K 的两数之和","frequency":0.4716067405,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"","submitted":9186,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6995007914282235,"acs":5745,"articleLive":2,"columnArticles":116,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":1.0489221055,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"","submitted":8213,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6745929180666839,"acs":2610,"articleLive":2,"columnArticles":64,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"","submitted":3869,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.37503222480020626,"acs":5819,"articleLive":2,"columnArticles":70,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"","submitted":15516,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6373250442815962,"acs":36701,"articleLive":2,"columnArticles":1120,"formTitle":"[1103]分糖果 II","frequency":1.3805429075,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":57586,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7605824232969319,"acs":29252,"articleLive":2,"columnArticles":687,"formTitle":"[1104]二叉树寻路","frequency":2.2404235771,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":38460,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5625129372800662,"acs":5435,"articleLive":2,"columnArticles":71,"formTitle":"[1105]填充书架","frequency":1.1853732082,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9662,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5818558302057719,"acs":4496,"articleLive":2,"columnArticles":131,"formTitle":"[1106]解析布尔表达式","frequency":0.7864655007,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7727,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4126296154057168,"acs":7521,"articleLive":2,"columnArticles":99,"formTitle":"[1107]每日新用户统计","frequency":1.0808941382,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"","submitted":18227,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8389497771889678,"acs":69658,"articleLive":2,"columnArticles":707,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":83030,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5843044060705045,"acs":63681,"articleLive":2,"columnArticles":626,"formTitle":"[1109]航班预订统计","frequency":2.4878976863,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":108986,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.630905211825663,"acs":12420,"articleLive":2,"columnArticles":225,"formTitle":"[1110]删点成林","frequency":0.988662914,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":19686,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7716278193126845,"acs":24564,"articleLive":2,"columnArticles":406,"formTitle":"[1111]有效括号的嵌套深度","frequency":1.1490055641,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31834,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.645968992248062,"acs":8333,"articleLive":2,"columnArticles":96,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"","submitted":12900,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5401967673928321,"acs":7687,"articleLive":2,"columnArticles":53,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"","submitted":14230,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.653178638022535,"acs":81970,"articleLive":2,"columnArticles":602,"formTitle":"[1114]按序打印","frequency":3.2279989767,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":125494,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5616347813314728,"acs":45885,"articleLive":2,"columnArticles":494,"formTitle":"[1115]交替打印 FooBar","frequency":0.9602114928,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":81699,"title":"交替打印 FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.521069587628866,"acs":24261,"articleLive":2,"columnArticles":383,"formTitle":"[1116]打印零与奇偶数","frequency":2.4526082093,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":46560,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5236214880259084,"acs":18432,"articleLive":2,"columnArticles":261,"formTitle":"[1117]H2O 生成","frequency":1.8554735886,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":35201,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6352295409181636,"acs":2546,"articleLive":2,"columnArticles":42,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"","submitted":4008,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8655681704008842,"acs":8615,"articleLive":2,"columnArticles":152,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"","submitted":9953,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6161703977396218,"acs":2835,"articleLive":2,"columnArticles":52,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"","submitted":4601,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5712151394422311,"acs":1147,"articleLive":2,"columnArticles":20,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"","submitted":2008,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7068963721395315,"acs":67867,"articleLive":2,"columnArticles":902,"formTitle":"[1122]数组的相对排序","frequency":1.9349344781,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":96007,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7049180327868853,"acs":8858,"articleLive":2,"columnArticles":115,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.4181180555,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":12566,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.32195451579830364,"acs":13817,"articleLive":2,"columnArticles":149,"formTitle":"[1124]表现良好的最长时间段","frequency":0.5001312072,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":42916,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.49395747284687164,"acs":3229,"articleLive":2,"columnArticles":52,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6537,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6905175053587833,"acs":6765,"articleLive":2,"columnArticles":99,"formTitle":"[1126]查询活跃业务","frequency":0.4181180555,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"","submitted":9797,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4246666036129764,"acs":4490,"articleLive":2,"columnArticles":78,"formTitle":"[1127]用户购买平台","frequency":1.0808941382,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"","submitted":10573,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5445796935414579,"acs":38028,"articleLive":2,"columnArticles":488,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":1.0182071603,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":69830,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.38467317806160783,"acs":6656,"articleLive":2,"columnArticles":124,"formTitle":"[1129]颜色交替的最短路径","frequency":0.5299663557,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":17303,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6323543953327401,"acs":6395,"articleLive":2,"columnArticles":114,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.4442975611,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":10113,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.45805369127516776,"acs":3276,"articleLive":2,"columnArticles":49,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":7152,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.39162652834383105,"acs":5285,"articleLive":2,"columnArticles":56,"formTitle":"[1132]报告的记录 II","frequency":0.5612188992,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"","submitted":13495,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6442268461852305,"acs":3158,"articleLive":2,"columnArticles":68,"formTitle":"[1133]最大唯一数","frequency":0.594008722,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"","submitted":4902,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7724121996303143,"acs":3343,"articleLive":2,"columnArticles":56,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"","submitted":4328,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5420496847223277,"acs":7135,"articleLive":2,"columnArticles":80,"formTitle":"[1135]最低成本联通所有城市","frequency":0.4716067405,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"","submitted":13163,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5748449955713021,"acs":3245,"articleLive":2,"columnArticles":56,"formTitle":"[1136]平行课程","frequency":0.5001312072,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"","submitted":5645,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6093577158172199,"acs":96401,"articleLive":2,"columnArticles":987,"formTitle":"[1137]第 N 个泰波那契数","frequency":2.2849502823,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":158201,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4356941271334498,"acs":6484,"articleLive":2,"columnArticles":144,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14882,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4816158684083212,"acs":9955,"articleLive":2,"columnArticles":158,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":1.6786996721,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":20670,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6515906824979607,"acs":7189,"articleLive":2,"columnArticles":99,"formTitle":"[1140]石子游戏 II","frequency":1.0182071603,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":11033,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.508329455560726,"acs":10924,"articleLive":2,"columnArticles":70,"formTitle":"[1141]查询近30天活跃用户数","frequency":1.0182071603,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"","submitted":21490,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3718298868513461,"acs":7624,"articleLive":2,"columnArticles":52,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"","submitted":20504,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6386243660972359,"acs":184489,"articleLive":2,"columnArticles":1220,"formTitle":"[1143]最长公共子序列","frequency":3.3228098672,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":288885,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4432216108054027,"acs":10632,"articleLive":2,"columnArticles":148,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.5299663557,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23988,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4700596794742842,"acs":7010,"articleLive":2,"columnArticles":110,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14913,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2910619744627842,"acs":4673,"articleLive":2,"columnArticles":67,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":16055,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5628325310362301,"acs":4443,"articleLive":2,"columnArticles":91,"formTitle":"[1147]段式回文","frequency":2.1330348198,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7894,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7122374124708236,"acs":8544,"articleLive":2,"columnArticles":38,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"","submitted":11996,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.44245619245619244,"acs":5959,"articleLive":2,"columnArticles":50,"formTitle":"[1149]文章浏览 II","frequency":0.4442975611,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"","submitted":13468,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6003055588200729,"acs":5108,"articleLive":2,"columnArticles":90,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.5001312072,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"","submitted":8509,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.49748592115848755,"acs":4947,"articleLive":2,"columnArticles":75,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.4442975611,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"","submitted":9944,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3921019108280255,"acs":1539,"articleLive":2,"columnArticles":37,"formTitle":"[1152]用户网站访问行为分析","frequency":0.594008722,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"","submitted":3925,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.37001259974800504,"acs":1762,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"","submitted":4762,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.6488834284888343,"acs":44893,"articleLive":2,"columnArticles":531,"formTitle":"[1154]一年中的第几天","frequency":1.3154263365,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":69185,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4806042188058634,"acs":10754,"articleLive":2,"columnArticles":136,"formTitle":"[1155]掷骰子的N种方法","frequency":1.5167303442,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":22376,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.42953235105701476,"acs":5364,"articleLive":2,"columnArticles":98,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.4442975611,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":12488,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.32275449101796405,"acs":3234,"articleLive":2,"columnArticles":49,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":10020,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5524856857220758,"acs":6079,"articleLive":2,"columnArticles":64,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"","submitted":11003,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.4943305463291719,"acs":4316,"articleLive":2,"columnArticles":89,"formTitle":"[1159]市场分析 II","frequency":1.0489221055,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"","submitted":8731,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6871321757261202,"acs":61297,"articleLive":2,"columnArticles":930,"formTitle":"[1160]拼写单词","frequency":1.6143688138,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":89207,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6325016857720837,"acs":11256,"articleLive":2,"columnArticles":185,"formTitle":"[1161]最大层内元素和","frequency":1.0182071603,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":17796,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4711126329834339,"acs":39899,"articleLive":2,"columnArticles":506,"formTitle":"[1162]地图分析","frequency":0.4181180555,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":84691,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2677900194426442,"acs":6198,"articleLive":2,"columnArticles":106,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":23145,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6105585309869931,"acs":6384,"articleLive":2,"columnArticles":92,"formTitle":"[1164]指定日期的产品价格","frequency":1.4125900849,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"","submitted":10456,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8354753053637812,"acs":7866,"articleLive":2,"columnArticles":120,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"","submitted":9415,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4764797507788162,"acs":3059,"articleLive":2,"columnArticles":55,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"","submitted":6420,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.4487467588591184,"acs":2596,"articleLive":2,"columnArticles":40,"formTitle":"[1167]连接棒材的最低费用","frequency":0.5612188992,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"","submitted":5785,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5688583578671901,"acs":1739,"articleLive":2,"columnArticles":32,"formTitle":"[1168]水资源分配优化","frequency":0.988662914,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"","submitted":3057,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3227564102564103,"acs":7049,"articleLive":2,"columnArticles":83,"formTitle":"[1169]查询无效交易","frequency":0.4442975611,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":21840,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6163563248535712,"acs":14101,"articleLive":2,"columnArticles":224,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.4716067405,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22878,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.4768291841941935,"acs":13829,"articleLive":2,"columnArticles":166,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":2.062116643,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":29002,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.26308952837729815,"acs":2633,"articleLive":2,"columnArticles":59,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":10008,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7544007411774615,"acs":8957,"articleLive":2,"columnArticles":81,"formTitle":"[1173]即时食物配送 I","frequency":0.4442975611,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"","submitted":11873,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6224290474549006,"acs":5417,"articleLive":2,"columnArticles":68,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"","submitted":8703,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.49131976852716075,"acs":7896,"articleLive":2,"columnArticles":123,"formTitle":"[1175]质数排列","frequency":1.0182071603,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":16071,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4546268656716418,"acs":4569,"articleLive":2,"columnArticles":70,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"","submitted":10050,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26959774704720274,"acs":6414,"articleLive":2,"columnArticles":98,"formTitle":"[1177]构建回文串检测","frequency":1.1490055641,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23791,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46264374862074886,"acs":18868,"articleLive":2,"columnArticles":186,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40783,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.63713792441972,"acs":33214,"articleLive":2,"columnArticles":199,"formTitle":"[1179]重新格式化部门表","frequency":2.4878976863,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":52130,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7743310442813166,"acs":3270,"articleLive":2,"columnArticles":76,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"","submitted":4223,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3731234866828087,"acs":1541,"articleLive":2,"columnArticles":30,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"","submitted":4130,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.42045821232655695,"acs":2606,"articleLive":2,"columnArticles":46,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"","submitted":6198,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5892080069625761,"acs":677,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"","submitted":1149,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5837294861725435,"acs":14121,"articleLive":2,"columnArticles":276,"formTitle":"[1184]公交站间的距离","frequency":0.4442975611,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":24191,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6005769606884412,"acs":12283,"articleLive":2,"columnArticles":221,"formTitle":"[1185]一周中的第几天","frequency":0.3929911054,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":20452,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39798121829960326,"acs":7925,"articleLive":2,"columnArticles":116,"formTitle":"[1186]删除一次得到子数组最大和","frequency":1.0489221055,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":19913,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.44441964285714286,"acs":1991,"articleLive":2,"columnArticles":35,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4480,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6981719175418125,"acs":3590,"articleLive":2,"columnArticles":68,"formTitle":"[1188]设计有限阻塞队列","frequency":1.3496762595,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"","submitted":5142,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6457430612483898,"acs":22056,"articleLive":2,"columnArticles":346,"formTitle":"[1189]“气球” 的最大数量","frequency":1.0182071603,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":34156,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6506395073424918,"acs":46699,"articleLive":2,"columnArticles":628,"formTitle":"[1190]反转每对括号间的子串","frequency":2.0968906614,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":71774,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2665011557229689,"acs":6226,"articleLive":2,"columnArticles":96,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":23362,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.5031493541155119,"acs":4713,"articleLive":2,"columnArticles":54,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":9367,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6051292090837901,"acs":6182,"articleLive":2,"columnArticles":76,"formTitle":"[1193]每月交易 I","frequency":0.5299663557,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"","submitted":10216,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5126367899947889,"acs":3935,"articleLive":2,"columnArticles":67,"formTitle":"[1194]锦标赛优胜者","frequency":0.4181180555,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"","submitted":7676,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6379872917739997,"acs":14860,"articleLive":2,"columnArticles":284,"formTitle":"[1195]交替打印字符串","frequency":1.9963034245,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":23292,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6873270614277809,"acs":3726,"articleLive":2,"columnArticles":62,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.5612188992,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"","submitted":5421,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.3751161294933181,"acs":5249,"articleLive":2,"columnArticles":63,"formTitle":"[1197]进击的骑士","frequency":0.4716067405,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"","submitted":13993,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7397830018083182,"acs":4091,"articleLive":2,"columnArticles":63,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"","submitted":5530,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43855693348365277,"acs":778,"articleLive":2,"columnArticles":20,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"","submitted":1774,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6844675884359849,"acs":19059,"articleLive":2,"columnArticles":270,"formTitle":"[1200]最小绝对差","frequency":1.3496762595,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":27845,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.249450337512054,"acs":6467,"articleLive":2,"columnArticles":90,"formTitle":"[1201]丑数 III","frequency":1.9231446693,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":25925,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5033446649851957,"acs":27540,"articleLive":2,"columnArticles":303,"formTitle":"[1202]交换字符串中的元素","frequency":0.5299663557,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":54714,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.618052423194507,"acs":12332,"articleLive":2,"columnArticles":146,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19953,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7313184198000952,"acs":6146,"articleLive":2,"columnArticles":85,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"","submitted":8404,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46814116895560526,"acs":5863,"articleLive":2,"columnArticles":88,"formTitle":"[1205]每月交易II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"","submitted":12524,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.614416917496334,"acs":7961,"articleLive":2,"columnArticles":99,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":12957,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7297435288530041,"acs":61459,"articleLive":2,"columnArticles":860,"formTitle":"[1207]独一无二的出现次数","frequency":1.6143688138,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":84220,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.497011902997975,"acs":50315,"articleLive":2,"columnArticles":633,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":101235,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5237621793597137,"acs":13170,"articleLive":2,"columnArticles":166,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.5299663557,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":25145,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.45328096874488627,"acs":2770,"articleLive":2,"columnArticles":57,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.743540456,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":6111,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6595315024232633,"acs":8165,"articleLive":2,"columnArticles":65,"formTitle":"[1211]查询结果的质量和占比","frequency":0.4442975611,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"","submitted":12380,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5146585791747083,"acs":5600,"articleLive":2,"columnArticles":106,"formTitle":"[1212]查询球队积分","frequency":0.4716067405,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"","submitted":10881,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7764082336990016,"acs":6299,"articleLive":2,"columnArticles":136,"formTitle":"[1213]三个有序数组的交集","frequency":0.5001312072,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"","submitted":8113,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.639028620988725,"acs":3684,"articleLive":2,"columnArticles":75,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.5612188992,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"","submitted":5765,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.41294642857142855,"acs":2035,"articleLive":2,"columnArticles":43,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"","submitted":4928,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5400857802705378,"acs":1637,"articleLive":2,"columnArticles":39,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"","submitted":3031,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6954229571052001,"acs":23216,"articleLive":2,"columnArticles":371,"formTitle":"[1217]玩筹码","frequency":0.988662914,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":33384,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.5147358075277897,"acs":37184,"articleLive":2,"columnArticles":359,"formTitle":"[1218]最长定差子序列","frequency":2.8160133283,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"ac","submitted":72239,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6294243485025282,"acs":12946,"articleLive":2,"columnArticles":185,"formTitle":"[1219]黄金矿工","frequency":1.3496762595,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":20568,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5307633392902732,"acs":4158,"articleLive":2,"columnArticles":79,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7834,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8438683990838453,"acs":78846,"articleLive":2,"columnArticles":1138,"formTitle":"[1221]分割平衡字符串","frequency":2.4878976863,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":93434,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6758277429127895,"acs":6246,"articleLive":2,"columnArticles":136,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.5612188992,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":9242,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.47503045066991473,"acs":3510,"articleLive":2,"columnArticles":60,"formTitle":"[1223]掷骰子模拟","frequency":0.743540456,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7389,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3261696589468064,"acs":4887,"articleLive":2,"columnArticles":71,"formTitle":"[1224]最大相等频率","frequency":1.3496762595,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14983,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5395558136159094,"acs":3717,"articleLive":2,"columnArticles":86,"formTitle":"[1225]报告系统状态的连续日期","frequency":1.0182071603,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"","submitted":6889,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5938412279875694,"acs":12612,"articleLive":2,"columnArticles":140,"formTitle":"[1226]哲学家进餐","frequency":2.1761588888,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":21238,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.664522977022977,"acs":10643,"articleLive":2,"columnArticles":167,"formTitle":"[1227]飞机座位分配概率","frequency":1.3805429075,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":16016,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5375751503006012,"acs":3219,"articleLive":2,"columnArticles":57,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"","submitted":5988,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.43491250533504056,"acs":3057,"articleLive":2,"columnArticles":57,"formTitle":"[1229]安排会议日程","frequency":0.4442975611,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"","submitted":7029,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.5027746947835738,"acs":3624,"articleLive":2,"columnArticles":71,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"","submitted":7208,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5702748874048765,"acs":3672,"articleLive":2,"columnArticles":50,"formTitle":"[1231]分享巧克力","frequency":0.5001312072,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"","submitted":6439,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4687444877135375,"acs":34546,"articleLive":2,"columnArticles":428,"formTitle":"[1232]缀点成线","frequency":0.4716067405,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":73699,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48679181654676257,"acs":8661,"articleLive":2,"columnArticles":127,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":17792,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3471051616812648,"acs":6301,"articleLive":2,"columnArticles":97,"formTitle":"[1234]替换子串得到平衡字符串","frequency":1.6786996721,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":18153,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.46773772204806685,"acs":7162,"articleLive":2,"columnArticles":124,"formTitle":"[1235]规划兼职工作","frequency":1.8636589498,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":15312,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5711050724637681,"acs":1261,"articleLive":2,"columnArticles":33,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"","submitted":2208,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7120704966186215,"acs":10424,"articleLive":2,"columnArticles":139,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14639,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6623845845042152,"acs":3300,"articleLive":2,"columnArticles":78,"formTitle":"[1238]循环码排列","frequency":0.6284711262,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4982,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49144207258441164,"acs":35776,"articleLive":2,"columnArticles":392,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":72798,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.49633699633699635,"acs":2710,"articleLive":2,"columnArticles":41,"formTitle":"[1240]铺瓷砖","frequency":1.4459042916,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5460,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5925988509631632,"acs":7014,"articleLive":2,"columnArticles":69,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"","submitted":11836,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.46941580756013745,"acs":1366,"articleLive":2,"columnArticles":21,"formTitle":"[1242]多线程网页爬虫","frequency":0.9327824556,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"","submitted":2910,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5381112650960206,"acs":2718,"articleLive":2,"columnArticles":62,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"","submitted":5051,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6257283729269386,"acs":2792,"articleLive":2,"columnArticles":46,"formTitle":"[1244]力扣排行榜","frequency":0.6284711262,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"","submitted":4462,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.512614063338701,"acs":3820,"articleLive":2,"columnArticles":69,"formTitle":"[1245]树的直径","frequency":0.5299663557,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"","submitted":7452,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4822649912517894,"acs":3032,"articleLive":2,"columnArticles":44,"formTitle":"[1246]删除回文子数组","frequency":0.8807415775,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"","submitted":6287,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6217572676313388,"acs":9539,"articleLive":2,"columnArticles":163,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":15342,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5628977368107803,"acs":36885,"articleLive":2,"columnArticles":497,"formTitle":"[1248]统计「优美子数组」","frequency":1.3805429075,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":65527,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5791580949852899,"acs":26182,"articleLive":2,"columnArticles":363,"formTitle":"[1249]移除无效的括号","frequency":1.0182071603,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":45207,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5663324334747397,"acs":2937,"articleLive":2,"columnArticles":41,"formTitle":"[1250]检查「好数组」","frequency":0.5612188992,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":5186,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7712615166548548,"acs":8706,"articleLive":2,"columnArticles":101,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"","submitted":11288,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7487666947419083,"acs":18669,"articleLive":2,"columnArticles":329,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24933,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39551652745056043,"acs":5540,"articleLive":2,"columnArticles":85,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":14007,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.6056063505563825,"acs":17089,"articleLive":2,"columnArticles":266,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.4181180555,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":28218,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6879723601813863,"acs":3186,"articleLive":2,"columnArticles":70,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4631,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6658415841584159,"acs":1614,"articleLive":2,"columnArticles":40,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"","submitted":2424,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5645067133683596,"acs":1934,"articleLive":2,"columnArticles":44,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"","submitted":3426,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5538784067085953,"acs":1321,"articleLive":2,"columnArticles":48,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"","submitted":2385,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.48310185185185184,"acs":2087,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"","submitted":4320,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6034126627750337,"acs":13438,"articleLive":2,"columnArticles":266,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":22270,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7303419545217844,"acs":8415,"articleLive":2,"columnArticles":114,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":11522,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5292918057100482,"acs":14275,"articleLive":2,"columnArticles":206,"formTitle":"[1262]可被三整除的最大和","frequency":1.4125900849,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":26970,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.425991922071751,"acs":3586,"articleLive":2,"columnArticles":66,"formTitle":"[1263]推箱子","frequency":1.2634159152,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":8418,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5670376258611552,"acs":5350,"articleLive":2,"columnArticles":91,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"","submitted":9435,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9179954441913439,"acs":3224,"articleLive":2,"columnArticles":76,"formTitle":"[1265]逆序打印不可变链表","frequency":0.594008722,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"","submitted":3512,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8246347118132312,"acs":30589,"articleLive":2,"columnArticles":462,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":37094,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6091323638156273,"acs":9885,"articleLive":2,"columnArticles":155,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":16228,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5876795906317654,"acs":8958,"articleLive":2,"columnArticles":152,"formTitle":"[1268]搜索推荐系统","frequency":1.0182071603,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":15243,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4909002982187475,"acs":30453,"articleLive":2,"columnArticles":324,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":62035,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8038437693738376,"acs":6483,"articleLive":2,"columnArticles":88,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"","submitted":8065,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5070590574666932,"acs":2550,"articleLive":2,"columnArticles":46,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"","submitted":5029,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5238819592333435,"acs":1722,"articleLive":2,"columnArticles":34,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"","submitted":3287,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5415715683077926,"acs":1661,"articleLive":2,"columnArticles":49,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"","submitted":3067,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6096413874191652,"acs":1037,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"","submitted":1701,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5456498388829216,"acs":8636,"articleLive":2,"columnArticles":176,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.3929911054,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15827,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5039016489988222,"acs":6845,"articleLive":2,"columnArticles":104,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13584,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7283126110124334,"acs":20502,"articleLive":2,"columnArticles":250,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":1.3496762595,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":28150,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.6041603401153963,"acs":3979,"articleLive":2,"columnArticles":61,"formTitle":"[1278]分割回文串 III","frequency":1.5167303442,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6586,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6252305422353375,"acs":1695,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"","submitted":2711,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5044971934807602,"acs":7460,"articleLive":2,"columnArticles":76,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"","submitted":14787,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8314897875306017,"acs":46531,"articleLive":2,"columnArticles":633,"formTitle":"[1281]整数的各位积和之差","frequency":1.0182071603,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":55961,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8105549712305884,"acs":13101,"articleLive":2,"columnArticles":246,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":16163,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.4218266253869969,"acs":7630,"articleLive":2,"columnArticles":104,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.4716067405,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":18088,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6681212121212121,"acs":2756,"articleLive":2,"columnArticles":62,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.6647595781,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":4125,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8125416944629753,"acs":4872,"articleLive":2,"columnArticles":66,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"","submitted":5996,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6508097165991903,"acs":5144,"articleLive":2,"columnArticles":104,"formTitle":"[1286]字母组合迭代器","frequency":0.594008722,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7904,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6020300120486327,"acs":16489,"articleLive":2,"columnArticles":228,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":1.3805429075,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":27389,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5645597177389085,"acs":15041,"articleLive":2,"columnArticles":181,"formTitle":"[1288]删除被覆盖区间","frequency":1.4125900849,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":26642,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6211062710610669,"acs":7557,"articleLive":2,"columnArticles":111,"formTitle":"[1289]下降路径最小和  II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":12167,"title":"下降路径最小和  II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8076475100139201,"acs":56860,"articleLive":2,"columnArticles":736,"formTitle":"[1290]二进制链表转整数","frequency":0.3929911054,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":70402,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5207857785155979,"acs":7529,"articleLive":2,"columnArticles":170,"formTitle":"[1291]顺次数","frequency":0.4716067405,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":14457,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.4769264416417584,"acs":6542,"articleLive":2,"columnArticles":101,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":13717,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.36521608493164404,"acs":14586,"articleLive":2,"columnArticles":130,"formTitle":"[1293]网格中的最短路径","frequency":2.6477779086,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":39938,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6541545811295001,"acs":7668,"articleLive":2,"columnArticles":81,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"","submitted":11722,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8079926953742805,"acs":49555,"articleLive":2,"columnArticles":663,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.4181180555,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":61331,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.47888675623800386,"acs":9481,"articleLive":2,"columnArticles":149,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.3929911054,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":19798,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.461906979838978,"acs":6942,"articleLive":2,"columnArticles":96,"formTitle":"[1297]子串的最大出现次数","frequency":1.0489221055,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":15029,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5909577887293764,"acs":2758,"articleLive":2,"columnArticles":96,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4667,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7875383043922369,"acs":31611,"articleLive":2,"columnArticles":449,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":40139,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4648792460607423,"acs":24812,"articleLive":2,"columnArticles":376,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.4442975611,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":53373,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3613470274540786,"acs":3659,"articleLive":2,"columnArticles":88,"formTitle":"[1301]最大得分的路径数目","frequency":0.4442975611,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":10126,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8209446380178087,"acs":21205,"articleLive":2,"columnArticles":314,"formTitle":"[1302]层数最深叶子节点的和","frequency":1.0182071603,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":25830,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8233630442235174,"acs":9607,"articleLive":2,"columnArticles":90,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"","submitted":11668,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7228923476005188,"acs":22294,"articleLive":2,"columnArticles":400,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":30840,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7480126064255139,"acs":15902,"articleLive":2,"columnArticles":239,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.4716067405,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":21259,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5762028409958759,"acs":18862,"articleLive":2,"columnArticles":290,"formTitle":"[1306]跳跃游戏 III","frequency":0.988662914,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":32735,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3302083333333333,"acs":1902,"articleLive":2,"columnArticles":58,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5760,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7523636834606916,"acs":5809,"articleLive":2,"columnArticles":63,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"","submitted":7721,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.754399721205785,"acs":17318,"articleLive":2,"columnArticles":300,"formTitle":"[1309]解码字母到整数映射","frequency":0.4442975611,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":22956,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7144589958872695,"acs":37697,"articleLive":2,"columnArticles":507,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":52763,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3834405667121596,"acs":5900,"articleLive":2,"columnArticles":91,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":15387,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6695696721311475,"acs":11763,"articleLive":2,"columnArticles":156,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.4181180555,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":17568,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8328210579834069,"acs":36037,"articleLive":2,"columnArticles":553,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":43271,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7490137541315706,"acs":14050,"articleLive":2,"columnArticles":225,"formTitle":"[1314]矩阵区域和","frequency":1.4459042916,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":18758,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8112980769230769,"acs":13500,"articleLive":2,"columnArticles":282,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":16640,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.44330965068087624,"acs":2995,"articleLive":2,"columnArticles":64,"formTitle":"[1316]不同的循环子字符串","frequency":0.6647595781,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6756,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6172188467270434,"acs":10768,"articleLive":2,"columnArticles":205,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":17446,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6574833919499805,"acs":6730,"articleLive":2,"columnArticles":123,"formTitle":"[1318]或运算的最小翻转次数","frequency":1.114219448,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":10236,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6184308131241084,"acs":32514,"articleLive":2,"columnArticles":524,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":52575,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5930549251021334,"acs":2613,"articleLive":2,"columnArticles":62,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4406,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6195885396945602,"acs":4909,"articleLive":2,"columnArticles":90,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.5001312072,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"","submitted":7923,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5946847210994342,"acs":5885,"articleLive":2,"columnArticles":68,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"","submitted":9896,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7535072463768115,"acs":25996,"articleLive":2,"columnArticles":505,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.3929911054,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":34500,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5897507963275248,"acs":6295,"articleLive":2,"columnArticles":128,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10674,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7294193966915342,"acs":11244,"articleLive":2,"columnArticles":196,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":15415,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.4739442600169845,"acs":6139,"articleLive":2,"columnArticles":97,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12953,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6901327838827839,"acs":6029,"articleLive":2,"columnArticles":58,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"","submitted":8736,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.46645912089541175,"acs":6293,"articleLive":2,"columnArticles":125,"formTitle":"[1328]破坏回文串","frequency":0.4442975611,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":13491,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7712771484983892,"acs":7422,"articleLive":2,"columnArticles":168,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.9602114928,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9623,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.38492555831265507,"acs":1241,"articleLive":2,"columnArticles":32,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":1.114219448,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3224,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5327875630530059,"acs":12886,"articleLive":2,"columnArticles":222,"formTitle":"[1331]数组序号转换","frequency":1.3805429075,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":24186,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6924489795918367,"acs":10179,"articleLive":2,"columnArticles":141,"formTitle":"[1332]删除回文子序列","frequency":0.4442975611,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":14700,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.54907306434024,"acs":6042,"articleLive":2,"columnArticles":127,"formTitle":"[1333]餐厅过滤器","frequency":1.1490055641,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":11004,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4997617913292044,"acs":6294,"articleLive":2,"columnArticles":97,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":1.4459042916,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":12594,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5903501945525291,"acs":3793,"articleLive":2,"columnArticles":61,"formTitle":"[1335]工作计划的最低难度","frequency":0.5612188992,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":6425,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.43361308370992035,"acs":2015,"articleLive":2,"columnArticles":50,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"","submitted":4647,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7045502348734488,"acs":40196,"articleLive":2,"columnArticles":646,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":2.1761588888,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":57052,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6404867992285695,"acs":9631,"articleLive":2,"columnArticles":143,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":15037,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.4020186545307079,"acs":8922,"articleLive":2,"columnArticles":142,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.4716067405,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":22193,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5741792150086399,"acs":4652,"articleLive":2,"columnArticles":100,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":8102,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.4362902268139176,"acs":3674,"articleLive":2,"columnArticles":52,"formTitle":"[1341]电影评分","frequency":0.4716067405,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"","submitted":8421,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.818937939859245,"acs":43520,"articleLive":2,"columnArticles":653,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.4442975611,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":53142,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5487373529653697,"acs":13342,"articleLive":2,"columnArticles":227,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":24314,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5966786355475763,"acs":6647,"articleLive":2,"columnArticles":124,"formTitle":"[1344]时钟指针的夹角","frequency":1.0489221055,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":11140,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3637479541734861,"acs":6223,"articleLive":2,"columnArticles":115,"formTitle":"[1345]跳跃游戏 IV","frequency":0.5299663557,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":17108,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.4330426381226005,"acs":17032,"articleLive":2,"columnArticles":291,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":39331,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7445294431595801,"acs":8370,"articleLive":2,"columnArticles":130,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":11242,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3117999479030998,"acs":3591,"articleLive":2,"columnArticles":58,"formTitle":"[1348]推文计数","frequency":1.4459042916,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":11517,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5060205143451761,"acs":3404,"articleLive":2,"columnArticles":99,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6727,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8460600375234522,"acs":9019,"articleLive":2,"columnArticles":89,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"","submitted":10660,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.753632967827449,"acs":31272,"articleLive":2,"columnArticles":566,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.4442975611,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":41495,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.45038643729743205,"acs":7226,"articleLive":2,"columnArticles":80,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":16044,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28662199630314233,"acs":12405,"articleLive":2,"columnArticles":162,"formTitle":"[1353]最多可以参加的会议数目","frequency":1.8554735886,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":43280,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2815398886827458,"acs":3035,"articleLive":2,"columnArticles":75,"formTitle":"[1354]多次求和构造目标数组","frequency":0.743540456,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10780,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6637757472510454,"acs":4286,"articleLive":2,"columnArticles":63,"formTitle":"[1355]活动参与者","frequency":0.4716067405,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"","submitted":6457,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7307009898524559,"acs":46949,"articleLive":2,"columnArticles":526,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":1.0489221055,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":64252,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5335586110463761,"acs":4579,"articleLive":2,"columnArticles":45,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.4442975611,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":8582,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.49630257279309814,"acs":6443,"articleLive":2,"columnArticles":121,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":12982,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5541926034419626,"acs":3027,"articleLive":2,"columnArticles":73,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5462,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5066673923692374,"acs":9309,"articleLive":2,"columnArticles":151,"formTitle":"[1360]日期之间隔几天","frequency":1.3805429075,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":18373,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4007184685793022,"acs":8143,"articleLive":2,"columnArticles":214,"formTitle":"[1361]验证二叉树","frequency":0.4442975611,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":20321,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5310073979358846,"acs":5814,"articleLive":2,"columnArticles":75,"formTitle":"[1362]最接近的因数","frequency":0.5612188992,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10949,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.36773841217830566,"acs":5387,"articleLive":2,"columnArticles":102,"formTitle":"[1363]形成三的最大倍数","frequency":0.5612188992,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":14649,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6835308685653635,"acs":3864,"articleLive":2,"columnArticles":73,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"","submitted":5653,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.824552697856882,"acs":88068,"articleLive":2,"columnArticles":1115,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.4716067405,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":106807,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5409229429690902,"acs":7455,"articleLive":2,"columnArticles":144,"formTitle":"[1366]通过投票对团队排名","frequency":0.4442975611,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13782,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4197650383317198,"acs":16043,"articleLive":2,"columnArticles":235,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":38219,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5368663594470046,"acs":3961,"articleLive":2,"columnArticles":96,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.4716067405,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":7378,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6040468161079151,"acs":3045,"articleLive":2,"columnArticles":44,"formTitle":"[1369]获取最近第二次的活动","frequency":0.4716067405,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"","submitted":5041,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7904004406142682,"acs":48793,"articleLive":2,"columnArticles":583,"formTitle":"[1370]上升下降字符串","frequency":0.4716067405,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":61732,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5810014138234588,"acs":21780,"articleLive":2,"columnArticles":280,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":1.0489221055,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":37487,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5187253806808161,"acs":8823,"articleLive":2,"columnArticles":172,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":17009,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.40543838242984137,"acs":9304,"articleLive":2,"columnArticles":193,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":1.4125900849,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":22948,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7408765276021914,"acs":17581,"articleLive":2,"columnArticles":233,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":23730,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5794416570178824,"acs":9008,"articleLive":2,"columnArticles":178,"formTitle":"[1375]二进制字符串前缀一致的次数","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15546,"title":"二进制字符串前缀一致的次数","titleSlug":"number-of-times-binary-string-is-prefix-aligned"},{"acceptance":0.5077462543831687,"acs":7964,"articleLive":2,"columnArticles":162,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":15685,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32783641160949867,"acs":4473,"articleLive":2,"columnArticles":136,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.5299663557,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":13644,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8649011062688569,"acs":7740,"articleLive":2,"columnArticles":64,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"","submitted":8949,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8387072068622194,"acs":10951,"articleLive":2,"columnArticles":171,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":13057,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7275667606568254,"acs":17546,"articleLive":2,"columnArticles":268,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":24116,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7309555011110478,"acs":12829,"articleLive":2,"columnArticles":176,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.4442975611,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":17551,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.7029674934873712,"acs":12413,"articleLive":2,"columnArticles":189,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":17658,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32623626373626374,"acs":4750,"articleLive":2,"columnArticles":92,"formTitle":"[1383]最大的团队表现值","frequency":1.2234585423,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14560,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5494477911646586,"acs":2189,"articleLive":2,"columnArticles":50,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"","submitted":3984,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.6988956822598228,"acs":14746,"articleLive":2,"columnArticles":222,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":21099,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.31773151471643934,"acs":6639,"articleLive":2,"columnArticles":135,"formTitle":"[1386]安排电影院座位","frequency":1.4125900849,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20895,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6947955890263583,"acs":10333,"articleLive":2,"columnArticles":189,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14872,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5485287138111058,"acs":4623,"articleLive":2,"columnArticles":56,"formTitle":"[1388]3n 块披萨","frequency":0.5299663557,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":8428,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8307328739821195,"acs":29177,"articleLive":2,"columnArticles":496,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.4442975611,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":35122,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3649035210901337,"acs":7016,"articleLive":2,"columnArticles":124,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":19227,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.4020291693088142,"acs":6974,"articleLive":2,"columnArticles":210,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.5001312072,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":17347,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.41214842826754905,"acs":8719,"articleLive":2,"columnArticles":159,"formTitle":"[1392]最长快乐前缀","frequency":1.114219448,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":21155,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8568965517241379,"acs":4473,"articleLive":2,"columnArticles":66,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"","submitted":5220,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6656086972383349,"acs":18245,"articleLive":2,"columnArticles":298,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":27411,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7388103942298192,"acs":14955,"articleLive":2,"columnArticles":214,"formTitle":"[1395]统计作战单位数","frequency":0.4442975611,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":20242,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.40676067474960464,"acs":12346,"articleLive":2,"columnArticles":169,"formTitle":"[1396]设计地铁系统","frequency":0.4181180555,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":30352,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.38605619146722164,"acs":1113,"articleLive":2,"columnArticles":38,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2883,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7598865605798015,"acs":4823,"articleLive":2,"columnArticles":76,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"","submitted":6347,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6703627012223632,"acs":10036,"articleLive":2,"columnArticles":162,"formTitle":"[1399]统计最大组的数目","frequency":0.4442975611,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14971,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6075405352607931,"acs":6220,"articleLive":2,"columnArticles":105,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":10238,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41937109453739163,"acs":4161,"articleLive":2,"columnArticles":96,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9922,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7543678584592702,"acs":10233,"articleLive":2,"columnArticles":186,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":13565,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6894168466522678,"acs":22344,"articleLive":2,"columnArticles":375,"formTitle":"[1403]非递增顺序的最小子序列","frequency":1.0489221055,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":32410,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4946777248089858,"acs":7575,"articleLive":2,"columnArticles":161,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":15313,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5093752627596065,"acs":6058,"articleLive":2,"columnArticles":145,"formTitle":"[1405]最长快乐字符串","frequency":1.3964137374,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11893,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5688194520849378,"acs":5170,"articleLive":2,"columnArticles":85,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":9089,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6708342088674091,"acs":6385,"articleLive":2,"columnArticles":71,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"","submitted":9518,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6148683754762729,"acs":14201,"articleLive":2,"columnArticles":215,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":23096,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8070425208807896,"acs":8503,"articleLive":2,"columnArticles":140,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10536,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.475349931871671,"acs":7675,"articleLive":2,"columnArticles":121,"formTitle":"[1410]HTML 实体解析器","frequency":0.6284711262,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":16146,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5516816220289061,"acs":8054,"articleLive":2,"columnArticles":146,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":1.1853732082,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14599,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5488881044828804,"acs":3110,"articleLive":2,"columnArticles":73,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"","submitted":5666,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6959016393442623,"acs":11886,"articleLive":2,"columnArticles":247,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.4181180555,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":17080,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6053738317757009,"acs":7773,"articleLive":2,"columnArticles":155,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":1.3805429075,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12840,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6861895855891328,"acs":6971,"articleLive":2,"columnArticles":188,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.5001312072,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":10159,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.41119017720106044,"acs":2947,"articleLive":2,"columnArticles":55,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":7167,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5209991242432319,"acs":13683,"articleLive":2,"columnArticles":191,"formTitle":"[1417]重新格式化字符串","frequency":0.4442975611,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":26263,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7314727825366123,"acs":26472,"articleLive":2,"columnArticles":420,"formTitle":"[1418]点菜展示表","frequency":2.5549469226,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":36190,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4212752943575106,"acs":8265,"articleLive":2,"columnArticles":159,"formTitle":"[1419]数青蛙","frequency":1.0489221055,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":19619,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.603017444601603,"acs":2558,"articleLive":2,"columnArticles":47,"formTitle":"[1420]生成数组","frequency":0.8807415775,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4242,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.741878059635069,"acs":3334,"articleLive":2,"columnArticles":41,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":1,"nodeType":"def","questionId":"1551","status":"","submitted":4494,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5410988797827457,"acs":11158,"articleLive":2,"columnArticles":209,"formTitle":"[1422]分割字符串的最大得分","frequency":0.4442975611,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":20621,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.554607586112837,"acs":36598,"articleLive":2,"columnArticles":534,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":65989,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.4020307966971658,"acs":7206,"articleLive":2,"columnArticles":158,"formTitle":"[1424]对角线遍历 II","frequency":0.988662914,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":17924,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.4448727833461835,"acs":3462,"articleLive":2,"columnArticles":76,"formTitle":"[1425]带限制的子序列和","frequency":0.5001312072,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7782,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.6988783433994823,"acs":1620,"articleLive":2,"columnArticles":55,"formTitle":"[1426]数元素","frequency":1.3496762595,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"","submitted":2318,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6442262739597943,"acs":1378,"articleLive":2,"columnArticles":53,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"","submitted":2139,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5993167398731089,"acs":1228,"articleLive":2,"columnArticles":23,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"","submitted":2049,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.4979712283290299,"acs":1350,"articleLive":2,"columnArticles":51,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"","submitted":2711,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5686411149825784,"acs":816,"articleLive":2,"columnArticles":31,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"","submitted":1435,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8460741617690584,"acs":80042,"articleLive":2,"columnArticles":1052,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":94604,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39652593085106386,"acs":4771,"articleLive":2,"columnArticles":104,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":12032,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6407914764079148,"acs":6315,"articleLive":2,"columnArticles":114,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9855,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4697559250088433,"acs":2656,"articleLive":2,"columnArticles":46,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5654,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6236016371077763,"acs":4571,"articleLive":2,"columnArticles":51,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"","submitted":7330,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8225055944304337,"acs":46312,"articleLive":2,"columnArticles":659,"formTitle":"[1436]旅行终点站","frequency":0.988662914,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":56306,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5829670613785615,"acs":11274,"articleLive":2,"columnArticles":191,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":19339,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.48244686102765905,"acs":34205,"articleLive":2,"columnArticles":483,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":1.0182071603,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":70899,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5421447944919675,"acs":5197,"articleLive":2,"columnArticles":71,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":1.0808941382,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":9586,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.7034951911799202,"acs":2999,"articleLive":2,"columnArticles":42,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"","submitted":4263,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6490869446715727,"acs":19052,"articleLive":2,"columnArticles":384,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":29352,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.791478358628443,"acs":35201,"articleLive":2,"columnArticles":379,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":44475,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.41198658843252306,"acs":5898,"articleLive":2,"columnArticles":146,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":14316,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5296021321149819,"acs":2782,"articleLive":2,"columnArticles":64,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":5253,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8569215876089061,"acs":4426,"articleLive":2,"columnArticles":56,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"","submitted":5165,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.6107544237927172,"acs":50703,"articleLive":2,"columnArticles":686,"formTitle":"[1446]连续字符","frequency":1.6020533872,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":83017,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6138369554901775,"acs":6468,"articleLive":2,"columnArticles":84,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":10537,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7140035677879715,"acs":11207,"articleLive":2,"columnArticles":181,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":1.0182071603,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":15696,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6273426416784887,"acs":16804,"articleLive":2,"columnArticles":207,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26786,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8027747376553145,"acs":24939,"articleLive":2,"columnArticles":353,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"ac","submitted":31066,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5254703541779241,"acs":10697,"articleLive":2,"columnArticles":164,"formTitle":"[1451]重新排列句子中的单词","frequency":0.4442975611,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":20357,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.5012602650622002,"acs":6165,"articleLive":2,"columnArticles":92,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":12299,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36721241760578355,"acs":1727,"articleLive":2,"columnArticles":36,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.8807415775,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4703,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.39377537212449254,"acs":5529,"articleLive":2,"columnArticles":87,"formTitle":"[1454]活跃用户","frequency":1.1490055641,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"","submitted":14041,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6277523274715531,"acs":12744,"articleLive":2,"columnArticles":225,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":20301,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5257454445057979,"acs":15234,"articleLive":2,"columnArticles":227,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.4442975611,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":28976,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6298449612403101,"acs":8450,"articleLive":2,"columnArticles":147,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":13416,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4432643080919997,"acs":5801,"articleLive":2,"columnArticles":92,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":13087,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5995797338314266,"acs":2568,"articleLive":2,"columnArticles":51,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"","submitted":4283,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7416879795396419,"acs":16240,"articleLive":2,"columnArticles":329,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":21896,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5068307102340817,"acs":6344,"articleLive":2,"columnArticles":91,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":12517,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.43669219722355196,"acs":7298,"articleLive":2,"columnArticles":145,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":16712,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.595448798988622,"acs":2826,"articleLive":2,"columnArticles":69,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4746,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7675364834807139,"acs":28296,"articleLive":2,"columnArticles":401,"formTitle":"[1464]数组中两元素的最大乘积","frequency":1.0182071603,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":36866,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.31365708437994233,"acs":6743,"articleLive":2,"columnArticles":85,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.4716067405,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":21498,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4832416208104052,"acs":6762,"articleLive":2,"columnArticles":127,"formTitle":"[1466]重新规划路线","frequency":0.5001312072,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13993,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6178343949044586,"acs":1746,"articleLive":2,"columnArticles":50,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2826,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7010156580617859,"acs":3313,"articleLive":2,"columnArticles":56,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"","submitted":4726,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.80078125,"acs":2665,"articleLive":2,"columnArticles":98,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"","submitted":3328,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.842306119667439,"acs":55620,"articleLive":2,"columnArticles":749,"formTitle":"[1470]重新排列数组","frequency":0.4442975611,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":66033,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5467017344327552,"acs":7691,"articleLive":2,"columnArticles":111,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.5612188992,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":14068,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6206331519958052,"acs":9469,"articleLive":2,"columnArticles":154,"formTitle":"[1472]设计浏览器历史记录","frequency":1.3199121576,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":15257,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6726618705035972,"acs":15708,"articleLive":2,"columnArticles":168,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23352,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7151474530831099,"acs":2134,"articleLive":2,"columnArticles":73,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"","submitted":2984,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7212578074520783,"acs":16744,"articleLive":2,"columnArticles":257,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":23215,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8642105959388848,"acs":13066,"articleLive":2,"columnArticles":123,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":15119,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.2909480449919657,"acs":5432,"articleLive":2,"columnArticles":105,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":1.0182071603,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":18670,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5855945730247406,"acs":2935,"articleLive":2,"columnArticles":63,"formTitle":"[1478]安排邮筒","frequency":0.594008722,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":5012,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5634233316352522,"acs":2212,"articleLive":2,"columnArticles":44,"formTitle":"[1479]周内每天的销售情况","frequency":0.5001312072,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"","submitted":3926,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.869187364106337,"acs":132319,"articleLive":2,"columnArticles":1347,"formTitle":"[1480]一维数组的动态和","frequency":1.8554735886,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":152233,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5168787515006003,"acs":10764,"articleLive":2,"columnArticles":153,"formTitle":"[1481]不同整数的最少数目","frequency":1.3805429075,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":20825,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5876107168399626,"acs":32043,"articleLive":2,"columnArticles":418,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":54531,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.3029916709161992,"acs":3565,"articleLive":2,"columnArticles":78,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11766,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8135135135135135,"acs":903,"articleLive":2,"columnArticles":27,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"","submitted":1110,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6570138564533707,"acs":4220,"articleLive":2,"columnArticles":49,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"","submitted":6423,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8586015881318054,"acs":72229,"articleLive":2,"columnArticles":705,"formTitle":"[1486]数组异或操作","frequency":0.3688470065,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":84124,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.31326423663677655,"acs":8070,"articleLive":2,"columnArticles":108,"formTitle":"[1487]保证文件名唯一","frequency":1.114219448,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":25761,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.2441923774954628,"acs":8073,"articleLive":2,"columnArticles":120,"formTitle":"[1488]避免洪水泛滥","frequency":3.1492421696,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":33060,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6889915769770707,"acs":11779,"articleLive":2,"columnArticles":129,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.594008722,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":17096,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8522427440633246,"acs":1292,"articleLive":2,"columnArticles":32,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"","submitted":1516,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6720218931101095,"acs":20873,"articleLive":2,"columnArticles":309,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":31060,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.65201741168592,"acs":7789,"articleLive":2,"columnArticles":90,"formTitle":"[1492]n 的第 k 个因子","frequency":1.3496762595,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":11946,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5748471842892444,"acs":8840,"articleLive":2,"columnArticles":167,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":0.9602114928,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":15378,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.37333537425378843,"acs":2439,"articleLive":2,"columnArticles":39,"formTitle":"[1494]并行课程 II","frequency":1.2234585423,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6533,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5411895086811969,"acs":4395,"articleLive":2,"columnArticles":42,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"","submitted":8121,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5357110112771615,"acs":11686,"articleLive":2,"columnArticles":177,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":21814,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39425828893487735,"acs":8954,"articleLive":2,"columnArticles":119,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":1.0182071603,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":22711,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33536328007235455,"acs":5562,"articleLive":2,"columnArticles":74,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":16585,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.37770193401592717,"acs":2988,"articleLive":2,"columnArticles":66,"formTitle":"[1499]满足不等式的最大值","frequency":0.5299663557,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7911,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.30329542140565763,"acs":1040,"articleLive":2,"columnArticles":33,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"","submitted":3429,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5967720597962693,"acs":4511,"articleLive":2,"columnArticles":65,"formTitle":"[1501]可以放心投资的国家","frequency":0.5001312072,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"","submitted":7559,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7162049600988796,"acs":26655,"articleLive":2,"columnArticles":314,"formTitle":"[1502]判断能否形成等差数列","frequency":1.6459420757,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":37217,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5162653391988886,"acs":8919,"articleLive":2,"columnArticles":92,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.4442975611,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":17276,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.6000151480724077,"acs":7922,"articleLive":2,"columnArticles":139,"formTitle":"[1504]统计全 1 子矩形","frequency":1.0182071603,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":13203,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3637038608400509,"acs":3429,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9428,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8374512353706112,"acs":644,"articleLive":2,"columnArticles":18,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"","submitted":769,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5877476073892722,"acs":10563,"articleLive":2,"columnArticles":136,"formTitle":"[1507]转变日期格式","frequency":0.4181180555,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":17972,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.553594489883771,"acs":6430,"articleLive":2,"columnArticles":58,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":11615,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5520437030533607,"acs":5659,"articleLive":2,"columnArticles":84,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.5299663557,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":10251,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5808210391276459,"acs":5433,"articleLive":2,"columnArticles":67,"formTitle":"[1510]石子游戏 IV","frequency":1.0489221055,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":9354,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.682141302770927,"acs":4702,"articleLive":2,"columnArticles":65,"formTitle":"[1511]消费者下单频率","frequency":0.4716067405,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"","submitted":6893,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8482384445870178,"acs":60817,"articleLive":2,"columnArticles":778,"formTitle":"[1512]好数对的数目","frequency":1.4125900849,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":71698,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.3828358705045536,"acs":11518,"articleLive":2,"columnArticles":164,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":30086,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.33877400295420973,"acs":9174,"articleLive":2,"columnArticles":160,"formTitle":"[1514]概率最大的路径","frequency":0.988662914,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":27080,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.3449795081967213,"acs":3367,"articleLive":2,"columnArticles":62,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9760,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.585812356979405,"acs":256,"articleLive":2,"columnArticles":14,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"","submitted":437,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.6593521421107628,"acs":3786,"articleLive":2,"columnArticles":39,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"","submitted":5742,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.703093485606517,"acs":53684,"articleLive":2,"columnArticles":802,"formTitle":"[1518]换酒问题","frequency":0.1682349471,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":76354,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.3017648912700914,"acs":5745,"articleLive":2,"columnArticles":127,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.5001312072,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":19038,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.3356876846025427,"acs":2614,"articleLive":2,"columnArticles":74,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7787,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.39386625017748117,"acs":2774,"articleLive":2,"columnArticles":55,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":7043,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7086280056577087,"acs":1002,"articleLive":2,"columnArticles":33,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"","submitted":1414,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5746905676483142,"acs":10772,"articleLive":2,"columnArticles":183,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":18744,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.43526768420237083,"acs":5618,"articleLive":2,"columnArticles":112,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.4181180555,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":12907,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6590396753832282,"acs":5847,"articleLive":2,"columnArticles":117,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8872,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6212370005473454,"acs":3405,"articleLive":2,"columnArticles":55,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5481,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.49194044542881754,"acs":3998,"articleLive":2,"columnArticles":42,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"","submitted":8127,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7853897326471696,"acs":31286,"articleLive":2,"columnArticles":383,"formTitle":"[1528]重新排列字符串","frequency":1.3805429075,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":39835,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.69377990430622,"acs":9280,"articleLive":2,"columnArticles":139,"formTitle":"[1529]最少的后缀翻转次数","frequency":0.5001312072,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":13376,"title":"最少的后缀翻转次数","titleSlug":"minimum-suffix-flips"},{"acceptance":0.57101739456889,"acs":9126,"articleLive":2,"columnArticles":152,"formTitle":"[1530]好叶子节点对的数量","frequency":1.4805818301,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15982,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.34375,"acs":2079,"articleLive":2,"columnArticles":36,"formTitle":"[1531]压缩字符串 II","frequency":2.4102792222,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":6048,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6181248776668624,"acs":3158,"articleLive":2,"columnArticles":52,"formTitle":"[1532]最近的三笔订单","frequency":1.593939094,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"","submitted":5109,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6043405676126878,"acs":362,"articleLive":2,"columnArticles":20,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"","submitted":599,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7861219195849546,"acs":18183,"articleLive":2,"columnArticles":169,"formTitle":"[1534]统计好三元组","frequency":1.0489221055,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":23130,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.45497504159733776,"acs":13672,"articleLive":2,"columnArticles":186,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.4181180555,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":30050,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.44450245379555187,"acs":4257,"articleLive":2,"columnArticles":83,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.7030490946,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9577,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3690298213864191,"acs":4690,"articleLive":2,"columnArticles":97,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12709,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.6068376068376068,"acs":142,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"","submitted":234,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5398529237338394,"acs":18206,"articleLive":2,"columnArticles":265,"formTitle":"[1539]第 k 个缺失的正整数","frequency":1.0808941382,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":33724,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3190068061507436,"acs":5062,"articleLive":2,"columnArticles":91,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15868,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.46683537559936067,"acs":7010,"articleLive":2,"columnArticles":106,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":15016,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.3882387361029842,"acs":2654,"articleLive":2,"columnArticles":51,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6836,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5552792971987403,"acs":3350,"articleLive":2,"columnArticles":46,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"","submitted":6033,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5506065496954236,"acs":21151,"articleLive":2,"columnArticles":336,"formTitle":"[1544]整理字符串","frequency":1.4125900849,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":38414,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5553191489361702,"acs":7830,"articleLive":2,"columnArticles":104,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":1.0489221055,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":14100,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4186064377352693,"acs":5449,"articleLive":2,"columnArticles":82,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":13017,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5388461538461539,"acs":4203,"articleLive":2,"columnArticles":73,"formTitle":"[1547]切棍子的最小成本","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7800,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.712707182320442,"acs":387,"articleLive":2,"columnArticles":16,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"","submitted":543,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6671511627906976,"acs":2754,"articleLive":2,"columnArticles":53,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"","submitted":4128,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6559880415030189,"acs":22381,"articleLive":2,"columnArticles":302,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":34118,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8175182481751825,"acs":11760,"articleLive":2,"columnArticles":164,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":14385,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.513988597972973,"acs":9737,"articleLive":2,"columnArticles":130,"formTitle":"[1552]两球之间的磁力","frequency":1.0182071603,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":18944,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.2982215635420526,"acs":8049,"articleLive":2,"columnArticles":126,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":1.4125900849,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26990,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7092896174863388,"acs":649,"articleLive":2,"columnArticles":22,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"","submitted":915,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.44102701257020593,"acs":3298,"articleLive":2,"columnArticles":62,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"","submitted":7478,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5749916383964834,"acs":12034,"articleLive":2,"columnArticles":185,"formTitle":"[1556]千位分隔数","frequency":2.1761588888,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":20929,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7766200762388819,"acs":9168,"articleLive":2,"columnArticles":130,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":1.3199121576,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":11805,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6243225380039656,"acs":4723,"articleLive":2,"columnArticles":77,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.594008722,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7565,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.37637938896488826,"acs":4127,"articleLive":2,"columnArticles":75,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":10965,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5716813041005876,"acs":9048,"articleLive":2,"columnArticles":93,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15827,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7787090317738303,"acs":12450,"articleLive":2,"columnArticles":185,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":1.0489221055,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":15988,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3109643516545945,"acs":4379,"articleLive":2,"columnArticles":89,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":14082,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.38304495102078184,"acs":4184,"articleLive":2,"columnArticles":67,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10923,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5527272727272727,"acs":760,"articleLive":2,"columnArticles":28,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"","submitted":1375,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7312059514487079,"acs":3735,"articleLive":2,"columnArticles":46,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"","submitted":5108,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4450129226225012,"acs":8437,"articleLive":2,"columnArticles":126,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.4442975611,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":18959,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.4095070748173495,"acs":17712,"articleLive":2,"columnArticles":266,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":1.7925558035,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":43252,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.4593052525591542,"acs":2737,"articleLive":2,"columnArticles":51,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5959,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.4734905864531487,"acs":2188,"articleLive":2,"columnArticles":47,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4621,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.896578843885175,"acs":2280,"articleLive":2,"columnArticles":40,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.4442975611,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"","submitted":2543,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7601126987321393,"acs":3777,"articleLive":2,"columnArticles":46,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"","submitted":4969,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8010465070873521,"acs":20514,"articleLive":2,"columnArticles":339,"formTitle":"[1572]矩阵对角线元素的和","frequency":1.0182071603,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":25609,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2983278439321003,"acs":4710,"articleLive":2,"columnArticles":67,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15788,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.33173015262280364,"acs":5173,"articleLive":2,"columnArticles":90,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.5001312072,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":15594,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5943598286530224,"acs":4995,"articleLive":2,"columnArticles":72,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":8404,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47679012975094953,"acs":18704,"articleLive":2,"columnArticles":267,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":39229,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.32840529506371396,"acs":5309,"articleLive":2,"columnArticles":85,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.743540456,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":16166,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5857113529049477,"acs":11412,"articleLive":2,"columnArticles":213,"formTitle":"[1578]使绳子变成彩色的最短时间","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":19484,"title":"使绳子变成彩色的最短时间","titleSlug":"minimum-time-to-make-rope-colorful"},{"acceptance":0.6196244700181708,"acs":16368,"articleLive":2,"columnArticles":298,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":26416,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.5962616822429907,"acs":319,"articleLive":2,"columnArticles":23,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"","submitted":535,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8078423321699856,"acs":3935,"articleLive":2,"columnArticles":55,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"","submitted":4871,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6694728662090402,"acs":10338,"articleLive":2,"columnArticles":122,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.4716067405,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":15442,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6851456486339786,"acs":18934,"articleLive":2,"columnArticles":246,"formTitle":"[1583]统计不开心的朋友","frequency":2.6477779086,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27635,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6637528047868362,"acs":28398,"articleLive":2,"columnArticles":361,"formTitle":"[1584]连接所有点的最小费用","frequency":1.6459420757,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":42784,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4309829435554774,"acs":2451,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5687,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6288951841359773,"acs":444,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"","submitted":706,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8320871608630634,"acs":3895,"articleLive":2,"columnArticles":44,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"","submitted":4681,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8390276316518079,"acs":45456,"articleLive":2,"columnArticles":722,"formTitle":"[1588]所有奇数长度子数组的和","frequency":2.1436281392,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":54177,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2975840562047459,"acs":4151,"articleLive":2,"columnArticles":60,"formTitle":"[1589]所有排列中的最大和","frequency":0.4716067405,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13949,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2708599905717557,"acs":4022,"articleLive":2,"columnArticles":61,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.5299663557,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":14849,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5858015984955336,"acs":1246,"articleLive":2,"columnArticles":37,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":2127,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4450199633106723,"acs":8248,"articleLive":2,"columnArticles":131,"formTitle":"[1592]重新排列单词间的空格","frequency":0.4716067405,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":18534,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.54160096466005,"acs":5839,"articleLive":2,"columnArticles":95,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":1.0182071603,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10781,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3143366619115549,"acs":4407,"articleLive":2,"columnArticles":103,"formTitle":"[1594]矩阵的最大非负积","frequency":0.5612188992,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":14020,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4693157770985187,"acs":1996,"articleLive":2,"columnArticles":40,"formTitle":"[1595]连通两组点的最小成本","frequency":0.8320938533,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4253,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7560433453737149,"acs":2721,"articleLive":2,"columnArticles":47,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"","submitted":3599,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6611909650924025,"acs":322,"articleLive":2,"columnArticles":21,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"","submitted":487,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6733079068708374,"acs":11828,"articleLive":2,"columnArticles":158,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":17567,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.42092508692445474,"acs":3995,"articleLive":2,"columnArticles":71,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9491,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6756566328727444,"acs":17261,"articleLive":2,"columnArticles":210,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":25547,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4905254091300603,"acs":2278,"articleLive":2,"columnArticles":41,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4644,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7485477178423237,"acs":902,"articleLive":2,"columnArticles":36,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"","submitted":1205,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8439083025671846,"acs":58974,"articleLive":2,"columnArticles":470,"formTitle":"[1603]设计停车系统","frequency":1.3805429075,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":69882,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4152354010911295,"acs":4110,"articleLive":2,"columnArticles":69,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":1.1490055641,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9898,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7405743309240086,"acs":3791,"articleLive":2,"columnArticles":75,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":5119,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3501769563507668,"acs":1781,"articleLive":2,"columnArticles":38,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":5086,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5411313198731854,"acs":3243,"articleLive":2,"columnArticles":44,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"","submitted":5993,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6388109592311825,"acs":10702,"articleLive":2,"columnArticles":179,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":16753,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.593497890203109,"acs":27146,"articleLive":2,"columnArticles":432,"formTitle":"[1609]奇偶树","frequency":0.553266571,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"ac","submitted":45739,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.44680323806377004,"acs":16227,"articleLive":2,"columnArticles":154,"formTitle":"[1610]可见点的最大数目","frequency":0.7976076772,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":36318,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.607993430057487,"acs":2221,"articleLive":2,"columnArticles":58,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3653,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7289586305278174,"acs":511,"articleLive":2,"columnArticles":23,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"","submitted":701,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7335307179866766,"acs":1982,"articleLive":2,"columnArticles":38,"formTitle":"[1613]找到遗失的ID","frequency":0.5612188992,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"","submitted":2702,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8212973747872054,"acs":18333,"articleLive":2,"columnArticles":303,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":22322,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.5036419482229048,"acs":5739,"articleLive":2,"columnArticles":69,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":11395,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.27746092099704267,"acs":5254,"articleLive":2,"columnArticles":97,"formTitle":"[1616]分割两个字符串得到回文串","frequency":1.7849943308,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18936,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6264406779661017,"acs":1848,"articleLive":2,"columnArticles":35,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2950,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5781990521327014,"acs":366,"articleLive":2,"columnArticles":18,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"","submitted":633,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6718555932764759,"acs":8114,"articleLive":2,"columnArticles":138,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":12077,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3737388091516271,"acs":2630,"articleLive":2,"columnArticles":44,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":7037,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.44226731980405876,"acs":1896,"articleLive":2,"columnArticles":37,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4287,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.15479690732875967,"acs":2843,"articleLive":2,"columnArticles":61,"formTitle":"[1622]奇妙序列","frequency":1.8886727603,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":18366,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7846919726197884,"acs":3783,"articleLive":2,"columnArticles":48,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"","submitted":4821,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.621226549852395,"acs":13047,"articleLive":2,"columnArticles":226,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":1.0182071603,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":21002,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5478818084727661,"acs":3078,"articleLive":2,"columnArticles":69,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5618,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3910677425408144,"acs":4168,"articleLive":2,"columnArticles":87,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.5001312072,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10658,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3846729531507259,"acs":2570,"articleLive":2,"columnArticles":40,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6681,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8330404217926186,"acs":474,"articleLive":2,"columnArticles":21,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"","submitted":569,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5241703984383971,"acs":9130,"articleLive":2,"columnArticles":106,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":17418,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7622124326970142,"acs":7786,"articleLive":2,"columnArticles":124,"formTitle":"[1630]等差子数组","frequency":1.4125900849,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":10215,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4937716637781629,"acs":27351,"articleLive":2,"columnArticles":315,"formTitle":"[1631]最小体力消耗路径","frequency":1.5167303442,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":55392,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3254755996691481,"acs":1574,"articleLive":2,"columnArticles":29,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4836,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6567036720751495,"acs":3076,"articleLive":2,"columnArticles":32,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"","submitted":4684,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5319715808170515,"acs":599,"articleLive":2,"columnArticles":30,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"","submitted":1126,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.547760602457392,"acs":1382,"articleLive":2,"columnArticles":38,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"","submitted":2523,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7056443173097049,"acs":10114,"articleLive":2,"columnArticles":199,"formTitle":"[1636]按照频率将数组升序排序","frequency":1.3805429075,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":14333,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8074003795066413,"acs":5957,"articleLive":2,"columnArticles":82,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":7378,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7151445086705203,"acs":3093,"articleLive":2,"columnArticles":52,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.594008722,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":4325,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4005805515239477,"acs":1380,"articleLive":2,"columnArticles":33,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3445,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6548335044741088,"acs":13392,"articleLive":2,"columnArticles":228,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":20451,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.773379301853106,"acs":12562,"articleLive":2,"columnArticles":291,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":1.0489221055,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":16243,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.451971163213613,"acs":6959,"articleLive":2,"columnArticles":112,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":15397,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4571155682903534,"acs":2393,"articleLive":2,"columnArticles":49,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":5235,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5597602098164106,"acs":1494,"articleLive":2,"columnArticles":29,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"","submitted":2669,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.41980533220482436,"acs":992,"articleLive":2,"columnArticles":28,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"","submitted":2363,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5338408003479774,"acs":36819,"articleLive":2,"columnArticles":368,"formTitle":"[1646]获取生成数组中的最大值","frequency":2.4560782663,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":68970,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5188371789857906,"acs":7960,"articleLive":2,"columnArticles":121,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":1.0489221055,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":15342,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2818047337278107,"acs":3810,"articleLive":2,"columnArticles":94,"formTitle":"[1648]销售价值减少的颜色球","frequency":1.0182071603,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":13520,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4749075541468568,"acs":2697,"articleLive":2,"columnArticles":68,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5679,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.8005804311774462,"acs":1931,"articleLive":2,"columnArticles":36,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.4442975611,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"","submitted":2412,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6612305411415864,"acs":892,"articleLive":2,"columnArticles":25,"formTitle":"[1651]Hopper Company Queries III","frequency":0.6647595781,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"","submitted":1349,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6508930061759306,"acs":7799,"articleLive":2,"columnArticles":193,"formTitle":"[1652]拆炸弹","frequency":0.4442975611,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":11982,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5155358275206088,"acs":4065,"articleLive":2,"columnArticles":93,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7885,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2812586254485233,"acs":4076,"articleLive":2,"columnArticles":55,"formTitle":"[1654]到家的最少跳跃次数","frequency":1.4125900849,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":14492,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.37964512889186475,"acs":2268,"articleLive":2,"columnArticles":34,"formTitle":"[1655]分配重复整数","frequency":0.7864655007,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5974,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.782297761679205,"acs":8423,"articleLive":2,"columnArticles":100,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10767,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46538554313741254,"acs":5788,"articleLive":2,"columnArticles":83,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.4442975611,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":12437,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.30668301655426117,"acs":10004,"articleLive":2,"columnArticles":161,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":1.0489221055,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":32620,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.406628242074928,"acs":1411,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":1.114219448,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3470,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7417503586800573,"acs":517,"articleLive":2,"columnArticles":25,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"","submitted":697,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7345971563981043,"acs":3100,"articleLive":2,"columnArticles":61,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":1.0182071603,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"","submitted":4220,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.812532081836181,"acs":22161,"articleLive":2,"columnArticles":317,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":27274,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5731958762886598,"acs":8062,"articleLive":2,"columnArticles":136,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.5299663557,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":14065,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.55,"acs":5687,"articleLive":2,"columnArticles":110,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":10340,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6592995169082125,"acs":5459,"articleLive":2,"columnArticles":88,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":8280,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.711943793911007,"acs":304,"articleLive":2,"columnArticles":14,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"","submitted":427,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.604440200525185,"acs":2532,"articleLive":2,"columnArticles":35,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"","submitted":4189,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4452066842568162,"acs":7593,"articleLive":2,"columnArticles":143,"formTitle":"[1668]最大重复子字符串","frequency":0.4181180555,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":17055,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.753375902857741,"acs":14394,"articleLive":2,"columnArticles":267,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":19106,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.527388397670908,"acs":4891,"articleLive":2,"columnArticles":86,"formTitle":"[1670]设计前中后队列","frequency":0.4716067405,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":9274,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46875,"acs":2220,"articleLive":2,"columnArticles":46,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.594008722,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4736,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8490083441653739,"acs":40496,"articleLive":2,"columnArticles":469,"formTitle":"[1672]最富有客户的资产总量","frequency":0.3688470065,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":47698,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.36121335757683265,"acs":8145,"articleLive":2,"columnArticles":178,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":22549,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3705562526139691,"acs":2658,"articleLive":2,"columnArticles":56,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.5612188992,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":7173,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4339564817652467,"acs":2832,"articleLive":2,"columnArticles":47,"formTitle":"[1675]数组的最小偏移量","frequency":0.6647595781,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":6526,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.768790264853257,"acs":1074,"articleLive":2,"columnArticles":27,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"","submitted":1397,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.37716484926234767,"acs":2352,"articleLive":2,"columnArticles":38,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"","submitted":6236,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8280679616025959,"acs":18374,"articleLive":2,"columnArticles":302,"formTitle":"[1678]设计 Goal 解析器","frequency":0.4442975611,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":22189,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49899705803690825,"acs":7463,"articleLive":2,"columnArticles":120,"formTitle":"[1679]K 和数对的最大数目","frequency":0.4181180555,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":14956,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.47102925596935863,"acs":5780,"articleLive":2,"columnArticles":74,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":12271,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3870315658529,"acs":2489,"articleLive":2,"columnArticles":50,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6431,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5025510204081632,"acs":394,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"","submitted":784,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8983786252569079,"acs":3934,"articleLive":2,"columnArticles":42,"formTitle":"[1683]无效的推文","frequency":0.4442975611,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"","submitted":4379,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8269358775238518,"acs":18635,"articleLive":2,"columnArticles":384,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":22535,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.6124436691379561,"acs":4213,"articleLive":2,"columnArticles":94,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6879,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.47635244574020086,"acs":2941,"articleLive":2,"columnArticles":51,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":6174,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.39895405304445275,"acs":1068,"articleLive":2,"columnArticles":26,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2677,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8068718573822947,"acs":21182,"articleLive":2,"columnArticles":281,"formTitle":"[1688]比赛中的配对次数","frequency":1.0182071603,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":26252,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8652344831404684,"acs":15627,"articleLive":2,"columnArticles":207,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":18061,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5226045883940621,"acs":4647,"articleLive":2,"columnArticles":109,"formTitle":"[1690]石子游戏 VII","frequency":0.6284711262,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8892,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4932898773006135,"acs":2573,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":5216,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6091954022988506,"acs":212,"articleLive":2,"columnArticles":13,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"","submitted":348,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8051867860450757,"acs":2608,"articleLive":2,"columnArticles":36,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"","submitted":3239,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.637157298207995,"acs":8320,"articleLive":2,"columnArticles":144,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":13058,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.47220569766673276,"acs":7144,"articleLive":2,"columnArticles":144,"formTitle":"[1695]删除子数组的最大得分","frequency":0.4181180555,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":15129,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.3955249569707401,"acs":6894,"articleLive":2,"columnArticles":122,"formTitle":"[1696]跳跃游戏 VI","frequency":0.4716067405,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":17430,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5314076111875287,"acs":2318,"articleLive":2,"columnArticles":46,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4362,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5168949771689497,"acs":566,"articleLive":2,"columnArticles":18,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.7864655007,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"","submitted":1095,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8016284233900814,"acs":2166,"articleLive":2,"columnArticles":45,"formTitle":"[1699]两人之间的通话次数","frequency":0.4716067405,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"","submitted":2702,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7039793662490789,"acs":9553,"articleLive":2,"columnArticles":198,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.4442975611,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":13570,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6147776183644189,"acs":4285,"articleLive":2,"columnArticles":86,"formTitle":"[1701]平均等待时间","frequency":0.4442975611,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6970,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4796625489605303,"acs":3184,"articleLive":2,"columnArticles":68,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6638,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.388647474198805,"acs":1431,"articleLive":2,"columnArticles":25,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.8320938533,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3682,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.780336104299982,"acs":13048,"articleLive":2,"columnArticles":203,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":16721,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.45279532079804796,"acs":25237,"articleLive":2,"columnArticles":341,"formTitle":"[1705]吃苹果的最大数目","frequency":0.8089232152,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"ac","submitted":55736,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5936675461741425,"acs":4725,"articleLive":2,"columnArticles":119,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7959,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5032886723507917,"acs":14462,"articleLive":2,"columnArticles":152,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28735,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.690978886756238,"acs":1080,"articleLive":2,"columnArticles":27,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"","submitted":1563,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7183741186229781,"acs":1732,"articleLive":2,"columnArticles":43,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.4442975611,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"","submitted":2411,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6960234854550307,"acs":13040,"articleLive":2,"columnArticles":203,"formTitle":"[1710]卡车上的最大单元数","frequency":0.4442975611,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":18735,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3588845258529474,"acs":30526,"articleLive":2,"columnArticles":365,"formTitle":"[1711]大餐计数","frequency":2.5903413307,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":85058,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.265262686232777,"acs":7104,"articleLive":2,"columnArticles":107,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.4716067405,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":26781,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.49434511821026866,"acs":15954,"articleLive":2,"columnArticles":173,"formTitle":"[1713]得到子序列的最少操作次数","frequency":2.602439228,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":32273,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6062639821029083,"acs":271,"articleLive":2,"columnArticles":10,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"","submitted":447,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7257203842049093,"acs":2040,"articleLive":2,"columnArticles":39,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"","submitted":2811,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6686046511627907,"acs":9085,"articleLive":2,"columnArticles":201,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":13588,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.44051976573938506,"acs":2407,"articleLive":2,"columnArticles":54,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.6284711262,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5464,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4983035512327528,"acs":2203,"articleLive":2,"columnArticles":52,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.594008722,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4421,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3764772087788407,"acs":669,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1777,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8686147383800567,"acs":47561,"articleLive":2,"columnArticles":501,"formTitle":"[1720]解码异或后的数组","frequency":0.4181180555,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":54755,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6445921892995498,"acs":12313,"articleLive":2,"columnArticles":191,"formTitle":"[1721]交换链表中的节点","frequency":1.0182071603,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":19102,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5164501257334451,"acs":4929,"articleLive":2,"columnArticles":119,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9544,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5051782932682187,"acs":23999,"articleLive":2,"columnArticles":180,"formTitle":"[1723]完成所有工作的最短时间","frequency":1.5167303442,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":47506,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5568181818181818,"acs":392,"articleLive":2,"columnArticles":14,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"","submitted":704,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7890528057355577,"acs":11446,"articleLive":2,"columnArticles":156,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":14506,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4898868983736481,"acs":5934,"articleLive":2,"columnArticles":115,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":12113,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5776847528578328,"acs":3588,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.594008722,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":6211,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3650015323322096,"acs":1191,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3263,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6241806263656228,"acs":2571,"articleLive":2,"columnArticles":25,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"","submitted":4119,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.525279054497702,"acs":800,"articleLive":2,"columnArticles":25,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"","submitted":1523,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.46278726544381193,"acs":2195,"articleLive":2,"columnArticles":33,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"","submitted":4743,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7892430518038298,"acs":13148,"articleLive":2,"columnArticles":223,"formTitle":"[1732]找到最高海拔","frequency":0.4442975611,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":16659,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4662638469284995,"acs":2315,"articleLive":2,"columnArticles":57,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4965,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7233928022147031,"acs":28221,"articleLive":2,"columnArticles":370,"formTitle":"[1734]解码异或后的排列","frequency":0.5001312072,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":39012,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4902139280837506,"acs":1077,"articleLive":2,"columnArticles":26,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2197,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4484355828220859,"acs":29238,"articleLive":2,"columnArticles":358,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":1.8886727603,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":65200,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3263516804676084,"acs":4020,"articleLive":2,"columnArticles":107,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":12318,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6537520391517129,"acs":28854,"articleLive":2,"columnArticles":393,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":44136,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.47525083612040137,"acs":2842,"articleLive":2,"columnArticles":62,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5980,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.6538152610441768,"acs":814,"articleLive":2,"columnArticles":26,"formTitle":"[1740]找到二叉树中的距离","frequency":0.7864655007,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"","submitted":1245,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8407599309153714,"acs":2434,"articleLive":2,"columnArticles":33,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"","submitted":2895,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7107020813917365,"acs":9151,"articleLive":2,"columnArticles":137,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":12876,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6965823754789272,"acs":22726,"articleLive":2,"columnArticles":332,"formTitle":"[1743]从相邻元素对还原数组","frequency":2.4482885482,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32625,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36266440067472444,"acs":28595,"articleLive":2,"columnArticles":369,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78847,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4851564589462423,"acs":3628,"articleLive":2,"columnArticles":76,"formTitle":"[1745]回文串分割 IV","frequency":0.4716067405,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":7478,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5731930466605673,"acs":1253,"articleLive":2,"columnArticles":48,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":1.114219448,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"","submitted":2186,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.6972076788830716,"acs":1598,"articleLive":2,"columnArticles":37,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"","submitted":2292,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.74378223495702,"acs":12979,"articleLive":2,"columnArticles":251,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":17450,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5369736842105263,"acs":4081,"articleLive":2,"columnArticles":94,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":7600,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4535937699476573,"acs":3553,"articleLive":2,"columnArticles":82,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7833,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4781772736012305,"acs":2487,"articleLive":2,"columnArticles":36,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.7030490946,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":5201,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6693187136457845,"acs":10011,"articleLive":2,"columnArticles":119,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.4442975611,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":14957,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6297651135926069,"acs":6542,"articleLive":2,"columnArticles":136,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":10388,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.42422802850356295,"acs":4465,"articleLive":2,"columnArticles":93,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.594008722,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":10525,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4189916789035732,"acs":3424,"articleLive":2,"columnArticles":58,"formTitle":"[1755]最接近目标值的子序列和","frequency":1.2634159152,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":8172,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7854077253218884,"acs":549,"articleLive":2,"columnArticles":18,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"","submitted":699,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9228556485355649,"acs":3529,"articleLive":2,"columnArticles":37,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"","submitted":3824,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6436638432154127,"acs":7751,"articleLive":2,"columnArticles":119,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":12042,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.4350322409681124,"acs":4925,"articleLive":2,"columnArticles":103,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":11321,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5465591915303176,"acs":4543,"articleLive":2,"columnArticles":80,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":8312,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.43928908461780436,"acs":2793,"articleLive":2,"columnArticles":43,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.8807415775,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6358,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.7283511269276394,"acs":1228,"articleLive":2,"columnArticles":25,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"","submitted":1686,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.5883490452018371,"acs":4868,"articleLive":2,"columnArticles":90,"formTitle":"[1763]最长的美好子字符串","frequency":0.4716067405,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":8274,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4753574115876599,"acs":2527,"articleLive":2,"columnArticles":62,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.594008722,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":5316,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5471044610695484,"acs":3949,"articleLive":2,"columnArticles":90,"formTitle":"[1765]地图中的最高点","frequency":1.0808941382,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":7218,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37989523571963085,"acs":1523,"articleLive":2,"columnArticles":29,"formTitle":"[1766]互质树","frequency":1.3964137374,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":4009,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7941176470588235,"acs":1026,"articleLive":2,"columnArticles":25,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"","submitted":1292,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7597177371127856,"acs":12704,"articleLive":2,"columnArticles":225,"formTitle":"[1768]交替合并字符串","frequency":0.3929911054,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":16722,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8547721137049389,"acs":10765,"articleLive":2,"columnArticles":188,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":12594,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.3735637075495787,"acs":4389,"articleLive":2,"columnArticles":110,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11749,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36746440472584063,"acs":2426,"articleLive":2,"columnArticles":48,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6602,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.49440715883668906,"acs":442,"articleLive":2,"columnArticles":13,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"","submitted":894,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8431603773584906,"acs":17160,"articleLive":2,"columnArticles":213,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":20352,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5452362576108396,"acs":6358,"articleLive":2,"columnArticles":93,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":11661,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4766217354675653,"acs":4526,"articleLive":2,"columnArticles":98,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9496,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4617041646720919,"acs":1929,"articleLive":2,"columnArticles":46,"formTitle":"[1776]车队 II","frequency":0.9327824556,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":4178,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7863582908663269,"acs":6018,"articleLive":2,"columnArticles":65,"formTitle":"[1777]每家商店的产品价格","frequency":1.0182071603,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"","submitted":7653,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5035128805620609,"acs":215,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"","submitted":427,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.645883969142978,"acs":6112,"articleLive":2,"columnArticles":76,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.4442975611,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":9463,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.669219827114564,"acs":6116,"articleLive":2,"columnArticles":118,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":9139,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5264437689969604,"acs":4330,"articleLive":2,"columnArticles":62,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.7030490946,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":8225,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2976078799249531,"acs":1269,"articleLive":2,"columnArticles":36,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4264,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7977407208176439,"acs":1483,"articleLive":2,"columnArticles":34,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"","submitted":1859,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42330210772833726,"acs":9399,"articleLive":2,"columnArticles":111,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":22204,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.3536095550153261,"acs":6691,"articleLive":2,"columnArticles":68,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18922,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3433876896974267,"acs":3643,"articleLive":2,"columnArticles":94,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.5001312072,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":10609,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6527143721467467,"acs":11867,"articleLive":2,"columnArticles":61,"formTitle":"[1787]使所有区间的异或结果为零","frequency":1.1853732082,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18181,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6208425720620843,"acs":280,"articleLive":2,"columnArticles":19,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"","submitted":451,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7149090909090909,"acs":1966,"articleLive":2,"columnArticles":35,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"","submitted":2750,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6344472773629576,"acs":13935,"articleLive":2,"columnArticles":161,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":21964,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8095442512699434,"acs":11315,"articleLive":2,"columnArticles":156,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":13977,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.513118664281455,"acs":6884,"articleLive":2,"columnArticles":110,"formTitle":"[1792]最大平均通过率","frequency":1.9231446693,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":13416,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41945659916556427,"acs":4122,"articleLive":2,"columnArticles":100,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9827,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5525,"acs":221,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"","submitted":400,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7867445054945055,"acs":2291,"articleLive":2,"columnArticles":32,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.4442975611,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"","submitted":2912,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.4920105242892896,"acs":7667,"articleLive":2,"columnArticles":139,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":15583,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5693135935397039,"acs":5499,"articleLive":2,"columnArticles":85,"formTitle":"[1797]设计一个验证系统","frequency":1.0489221055,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":9659,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5268936982813495,"acs":3311,"articleLive":2,"columnArticles":52,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":1.0808941382,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":6284,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5156765676567657,"acs":2500,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":1.3496762595,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4848,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6804901644630764,"acs":10551,"articleLive":2,"columnArticles":177,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":15505,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.38382963988919666,"acs":4434,"articleLive":2,"columnArticles":116,"formTitle":"[1801]积压订单中的订单总数","frequency":0.5001312072,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":11552,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2644771476429768,"acs":4421,"articleLive":2,"columnArticles":110,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":16716,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.40861208649048236,"acs":2211,"articleLive":2,"columnArticles":55,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5411,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5798548094373865,"acs":639,"articleLive":2,"columnArticles":37,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.7030490946,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"","submitted":1102,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4764171526042286,"acs":12010,"articleLive":2,"columnArticles":164,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":25209,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.662608695652174,"acs":5334,"articleLive":2,"columnArticles":83,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":8050,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5858664085188771,"acs":6052,"articleLive":2,"columnArticles":93,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":10330,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.26896624695799387,"acs":2542,"articleLive":2,"columnArticles":48,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9451,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6258581235697941,"acs":2188,"articleLive":2,"columnArticles":36,"formTitle":"[1809]没有广告的剧集","frequency":0.4716067405,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"","submitted":3496,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.615819209039548,"acs":218,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"","submitted":354,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6599888703394546,"acs":1186,"articleLive":2,"columnArticles":33,"formTitle":"[1811]寻找面试候选人","frequency":0.5299663557,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"","submitted":1797,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7923654786862334,"acs":9071,"articleLive":2,"columnArticles":223,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.4181180555,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":11448,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5008517887563884,"acs":5586,"articleLive":2,"columnArticles":85,"formTitle":"[1813]句子相似性 III","frequency":1.114219448,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":11153,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3510667271901952,"acs":3867,"articleLive":2,"columnArticles":89,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":11015,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.2945673389720234,"acs":1811,"articleLive":2,"columnArticles":40,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":6148,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7348541163352537,"acs":47451,"articleLive":2,"columnArticles":645,"formTitle":"[1816]截断句子","frequency":0.8253985953,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":64572,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6975551189696573,"acs":6391,"articleLive":2,"columnArticles":107,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.5001312072,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":9162,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37170782766132,"acs":26279,"articleLive":2,"columnArticles":342,"formTitle":"[1818]绝对差值和","frequency":2.5549469226,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":70698,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.38064708513493367,"acs":2553,"articleLive":2,"columnArticles":35,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.7864655007,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6707,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.4575757575757576,"acs":151,"articleLive":2,"columnArticles":10,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"","submitted":330,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9012728966159578,"acs":2903,"articleLive":2,"columnArticles":25,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"","submitted":3221,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8025928996758875,"acs":21296,"articleLive":2,"columnArticles":215,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":26534,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7226143421795596,"acs":10238,"articleLive":2,"columnArticles":132,"formTitle":"[1823]找出游戏的获胜者","frequency":1.6786996721,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":14168,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6493243789950643,"acs":8025,"articleLive":2,"columnArticles":160,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":12359,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2856699751861042,"acs":2763,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9672,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.42606516290726815,"acs":340,"articleLive":2,"columnArticles":24,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"","submitted":798,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7920806232578086,"acs":11082,"articleLive":2,"columnArticles":156,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":13991,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8656625897098958,"acs":8564,"articleLive":2,"columnArticles":109,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":9893,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6909061593034505,"acs":4285,"articleLive":2,"columnArticles":88,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":6202,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4915346805024577,"acs":900,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1831,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7428010471204188,"acs":1135,"articleLive":2,"columnArticles":29,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"","submitted":1528,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8226590106007067,"acs":14900,"articleLive":2,"columnArticles":235,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":18112,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6828792279440014,"acs":44437,"articleLive":2,"columnArticles":394,"formTitle":"[1833]雪糕的最大数量","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":65073,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.35552703353120485,"acs":6648,"articleLive":2,"columnArticles":138,"formTitle":"[1834]单线程 CPU","frequency":0.594008722,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":18699,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5154794520547945,"acs":3763,"articleLive":2,"columnArticles":63,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.6647595781,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7300,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.735969387755102,"acs":577,"articleLive":2,"columnArticles":33,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.6647595781,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"","submitted":784,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7954042081949059,"acs":8619,"articleLive":2,"columnArticles":105,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.4442975611,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":10836,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42873437032178957,"acs":30071,"articleLive":2,"columnArticles":314,"formTitle":"[1838]最高频元素的频数","frequency":3.2196637891,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":70139,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5648522048134389,"acs":6994,"articleLive":2,"columnArticles":135,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":12382,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3900112233445567,"acs":2085,"articleLive":2,"columnArticles":48,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5346,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5280312907431551,"acs":1215,"articleLive":2,"columnArticles":39,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"","submitted":2301,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6431924882629108,"acs":137,"articleLive":2,"columnArticles":15,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"","submitted":213,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.515531660692951,"acs":863,"articleLive":2,"columnArticles":28,"formTitle":"[1843]可疑银行账户","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"","submitted":1674,"title":"可疑银行账户","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.7989775051124745,"acs":7814,"articleLive":2,"columnArticles":131,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":9780,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5067350022997569,"acs":7712,"articleLive":2,"columnArticles":74,"formTitle":"[1845]座位预约管理系统","frequency":0.4442975611,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":15219,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6329639576609718,"acs":28046,"articleLive":2,"columnArticles":379,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":2.1436281392,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":44309,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3638073195428902,"acs":2515,"articleLive":2,"columnArticles":48,"formTitle":"[1847]最近的房间","frequency":0.7864655007,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6913,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6809294871794872,"acs":8498,"articleLive":2,"columnArticles":108,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":12480,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3283699059561129,"acs":5866,"articleLive":2,"columnArticles":114,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.6284711262,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17864,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.611405197305101,"acs":2541,"articleLive":2,"columnArticles":52,"formTitle":"[1850]邻位交换的最小次数","frequency":0.6647595781,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":4156,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.4048152295632699,"acs":2169,"articleLive":2,"columnArticles":53,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.743540456,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":5358,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.5468549422336328,"acs":426,"articleLive":2,"columnArticles":13,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"","submitted":779,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6407678244972578,"acs":1402,"articleLive":2,"columnArticles":21,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"","submitted":2188,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7734461880637588,"acs":12519,"articleLive":2,"columnArticles":133,"formTitle":"[1854]人口最多的年份","frequency":1.3805429075,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":16186,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.668119363234671,"acs":11038,"articleLive":2,"columnArticles":108,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":16521,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35650094216553124,"acs":4919,"articleLive":2,"columnArticles":85,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.4442975611,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":13798,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4575300629891201,"acs":2397,"articleLive":2,"columnArticles":35,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":5239,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6207865168539326,"acs":442,"articleLive":2,"columnArticles":25,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"","submitted":712,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7653169183418294,"acs":7957,"articleLive":2,"columnArticles":160,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":10397,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7692172692172692,"acs":4383,"articleLive":2,"columnArticles":79,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5698,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6215802888700085,"acs":3658,"articleLive":2,"columnArticles":73,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5885,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.316288877174486,"acs":2400,"articleLive":2,"columnArticles":45,"formTitle":"[1862]向下取整数对和","frequency":0.743540456,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7588,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.8869364017259709,"acs":14183,"articleLive":2,"columnArticles":166,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.988662914,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":15991,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.39105290015308725,"acs":4598,"articleLive":2,"columnArticles":112,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.743540456,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11758,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.509543035419343,"acs":5553,"articleLive":2,"columnArticles":67,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.5612188992,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10898,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.6043928300934107,"acs":2394,"articleLive":2,"columnArticles":51,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":1.8774694166,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3961,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7549450549450549,"acs":687,"articleLive":2,"columnArticles":18,"formTitle":"[1867]最大数量高于平均水平的订单","frequency":1.2234585423,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"","submitted":910,"title":"最大数量高于平均水平的订单","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5118577075098815,"acs":518,"articleLive":2,"columnArticles":22,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"","submitted":1012,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7729701775555938,"acs":13452,"articleLive":2,"columnArticles":160,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.3929911054,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":17403,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.44954599965735825,"acs":7872,"articleLive":2,"columnArticles":76,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.4442975611,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":17511,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27596966413867824,"acs":6368,"articleLive":2,"columnArticles":132,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":23075,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.615851974592654,"acs":2230,"articleLive":2,"columnArticles":32,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3621,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8193887002161161,"acs":2654,"articleLive":2,"columnArticles":37,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"","submitted":3239,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.840867992766727,"acs":465,"articleLive":2,"columnArticles":24,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"","submitted":553,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7272727272727273,"acs":616,"articleLive":2,"columnArticles":24,"formTitle":"[1875]将工资相同的雇员分组","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"","submitted":847,"title":"将工资相同的雇员分组","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7248573115528439,"acs":7366,"articleLive":2,"columnArticles":121,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":10162,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8181448228501665,"acs":32167,"articleLive":2,"columnArticles":412,"formTitle":"[1877]数组中最大数对和的最小值","frequency":2.8492153347,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":39317,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.43410261300781994,"acs":2276,"articleLive":2,"columnArticles":58,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":5243,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.41806505075616324,"acs":2018,"articleLive":2,"columnArticles":40,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4827,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.770006598171364,"acs":8169,"articleLive":2,"columnArticles":115,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":10609,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.35686643078283947,"acs":6455,"articleLive":2,"columnArticles":68,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":18088,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.28235882058970513,"acs":3955,"articleLive":2,"columnArticles":119,"formTitle":"[1882]使用服务器处理任务","frequency":0.5299663557,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":14007,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.3817427385892116,"acs":1840,"articleLive":2,"columnArticles":31,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.9327824556,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4820,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6946206896551724,"acs":2518,"articleLive":2,"columnArticles":46,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":2.112207242,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":3625,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5090152565880721,"acs":367,"articleLive":2,"columnArticles":18,"formTitle":"[1885]统计数对","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"","submitted":721,"title":"统计数对","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.572209745142076,"acs":5860,"articleLive":2,"columnArticles":89,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.3929911054,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":10241,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6475651456196203,"acs":5492,"articleLive":2,"columnArticles":73,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.5001312072,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":8481,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3239389920424403,"acs":2931,"articleLive":2,"columnArticles":69,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":9048,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2731689973927471,"acs":2305,"articleLive":2,"columnArticles":44,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.743540456,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":8438,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.732508073196986,"acs":1361,"articleLive":2,"columnArticles":23,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"","submitted":1858,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.39165357080495894,"acs":2243,"articleLive":2,"columnArticles":25,"formTitle":"[1891]割绳子","frequency":0.5001312072,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"","submitted":5727,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3600189483657035,"acs":760,"articleLive":2,"columnArticles":18,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"","submitted":2111,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5909190133158699,"acs":32484,"articleLive":2,"columnArticles":427,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":2.1436281392,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":54972,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.4575379093547882,"acs":37988,"articleLive":2,"columnArticles":523,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":2.0286164134,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":83027,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5387065164135227,"acs":2199,"articleLive":2,"columnArticles":42,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":4082,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5077010838562465,"acs":890,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1753,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.537276457381745,"acs":6940,"articleLive":2,"columnArticles":92,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.4442975611,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":12917,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3140203449800973,"acs":4260,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.6647595781,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13566,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6340678783979411,"acs":3942,"articleLive":2,"columnArticles":45,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":6217,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.44203612479474547,"acs":1346,"articleLive":2,"columnArticles":37,"formTitle":"[1900]最佳运动员的比拼回合","frequency":1.1853732082,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":3045,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6157598499061914,"acs":1641,"articleLive":2,"columnArticles":48,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":2665,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4529616724738676,"acs":130,"articleLive":2,"columnArticles":5,"formTitle":"[1902]给定二叉搜索树的插入顺序求深度","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"","submitted":287,"title":"给定二叉搜索树的插入顺序求深度","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6375336290263942,"acs":8768,"articleLive":2,"columnArticles":113,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":13753,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2877351503480966,"acs":3885,"articleLive":2,"columnArticles":76,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":13502,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5974596058653218,"acs":6397,"articleLive":2,"columnArticles":139,"formTitle":"[1905]统计子岛屿","frequency":1.3805429075,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":10707,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.42342485319790507,"acs":2668,"articleLive":2,"columnArticles":57,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.6284711262,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":6301,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5906821963394343,"acs":710,"articleLive":2,"columnArticles":25,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"","submitted":1202,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6136986301369863,"acs":224,"articleLive":2,"columnArticles":11,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"","submitted":365,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.3199976115125097,"acs":5359,"articleLive":2,"columnArticles":81,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.4442975611,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"ac","submitted":16747,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.672273024167211,"acs":4117,"articleLive":2,"columnArticles":70,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.4716067405,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":6124,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5663612178539758,"acs":3832,"articleLive":2,"columnArticles":79,"formTitle":"[1911]最大子序列交替和","frequency":1.3805429075,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":6766,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2499702274621889,"acs":2099,"articleLive":2,"columnArticles":49,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":8397,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.832070069058447,"acs":9880,"articleLive":2,"columnArticles":117,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.988662914,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":11874,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4451883943809899,"acs":3391,"articleLive":2,"columnArticles":74,"formTitle":"[1914]循环轮转矩阵","frequency":1.4459042916,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7617,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3962018730489074,"acs":3046,"articleLive":2,"columnArticles":61,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7688,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5496083550913838,"acs":1263,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2298,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.37284234752589185,"acs":648,"articleLive":2,"columnArticles":12,"formTitle":"[1917]Leetcodify 好友推荐","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"","submitted":1738,"title":"Leetcodify 好友推荐","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.5055555555555555,"acs":273,"articleLive":2,"columnArticles":6,"formTitle":"[1918]第 K 小的子数组和·","frequency":1.114219448,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"","submitted":540,"title":"第 K 小的子数组和·","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3981841763942931,"acs":614,"articleLive":2,"columnArticles":21,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"","submitted":1542,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.8931914112681226,"acs":14601,"articleLive":2,"columnArticles":128,"formTitle":"[1920]基于排列构建数组","frequency":2.1436281392,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":16347,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.34869004672068127,"acs":5896,"articleLive":2,"columnArticles":96,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.5001312072,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16909,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.36263173302107726,"acs":4955,"articleLive":2,"columnArticles":81,"formTitle":"[1922]统计好数字的数目","frequency":0.5001312072,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":13664,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.24189009035698414,"acs":1633,"articleLive":2,"columnArticles":34,"formTitle":"[1923]最长公共子路径","frequency":1.4459042916,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6751,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.3568075117370892,"acs":76,"articleLive":2,"columnArticles":6,"formTitle":"[1924]安装栅栏 II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"","submitted":213,"title":"安装栅栏 II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6913698302653598,"acs":5784,"articleLive":2,"columnArticles":74,"formTitle":"[1925]统计平方和三元组的数目","frequency":1.6459420757,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":8366,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3476896990250106,"acs":4101,"articleLive":2,"columnArticles":69,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":11795,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4137497380004192,"acs":1974,"articleLive":2,"columnArticles":38,"formTitle":"[1927]求和游戏","frequency":0.5001312072,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4771,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.40973091364205255,"acs":2619,"articleLive":2,"columnArticles":46,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":2.2936786261,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":6392,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.8919374374637948,"acs":16937,"articleLive":2,"columnArticles":146,"formTitle":"[1929]数组串联","frequency":1.3496762595,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":18989,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.48487618414492273,"acs":5835,"articleLive":2,"columnArticles":106,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":1.114219448,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":12034,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5654668753260302,"acs":2168,"articleLive":2,"columnArticles":66,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.6647595781,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3834,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.331807164018314,"acs":1232,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":1.6786996721,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3713,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5048975957257347,"acs":567,"articleLive":2,"columnArticles":28,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.8807415775,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"","submitted":1123,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7654941373534339,"acs":457,"articleLive":2,"columnArticles":17,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"","submitted":597,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7338348728692505,"acs":7706,"articleLive":2,"columnArticles":111,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":10501,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.4513194496654387,"acs":6003,"articleLive":2,"columnArticles":69,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":13301,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.2502728264823572,"acs":3440,"articleLive":2,"columnArticles":65,"formTitle":"[1937]扣分后的最大得分","frequency":1.4459042916,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":13745,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.35504322766570606,"acs":1232,"articleLive":2,"columnArticles":43,"formTitle":"[1938]查询最大基因差","frequency":1.6143688138,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3470,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6367634124890061,"acs":724,"articleLive":2,"columnArticles":17,"formTitle":"[1939]主动请求确认消息的用户","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"","submitted":1137,"title":"主动请求确认消息的用户","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7535545023696683,"acs":477,"articleLive":2,"columnArticles":29,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"","submitted":633,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7637007973674218,"acs":6034,"articleLive":2,"columnArticles":104,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":1.0182071603,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":7901,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.3994738819992484,"acs":3189,"articleLive":2,"columnArticles":74,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7983,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.41088217643528707,"acs":2054,"articleLive":2,"columnArticles":57,"formTitle":"[1943]描述绘画结果","frequency":0.6647595781,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4999,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5840643274853801,"acs":2397,"articleLive":2,"columnArticles":67,"formTitle":"[1944]队列中可以看到的人数","frequency":1.0182071603,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":4104,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6590152128904492,"acs":7321,"articleLive":2,"columnArticles":91,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.4716067405,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":11109,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30707169157461556,"acs":5671,"articleLive":2,"columnArticles":84,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":1.0489221055,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":18468,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5457425240750127,"acs":4307,"articleLive":2,"columnArticles":94,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7892,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5120039196472318,"acs":1045,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.9327824556,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":2041,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.530690537084399,"acs":415,"articleLive":2,"columnArticles":16,"formTitle":"[1949]坚定的友谊","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"","submitted":782,"title":"坚定的友谊","titleSlug":"strong-friendship"},{"acceptance":0.4895833333333333,"acs":188,"articleLive":2,"columnArticles":8,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"","submitted":384,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.7027397260273973,"acs":513,"articleLive":2,"columnArticles":18,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"","submitted":730,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5432358510414476,"acs":7746,"articleLive":2,"columnArticles":87,"formTitle":"[1952]三除数","frequency":0.4442975611,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":14259,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3334304867385602,"acs":4576,"articleLive":2,"columnArticles":87,"formTitle":"[1953]你可以工作的最大周数","frequency":0.5612188992,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13724,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4796106003244997,"acs":4434,"articleLive":2,"columnArticles":73,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.5001312072,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":9245,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49772520473157417,"acs":2735,"articleLive":2,"columnArticles":44,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.8320938533,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5495,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4046511627906977,"acs":174,"articleLive":2,"columnArticles":13,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":2.2098775248,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"","submitted":430,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6091608157806754,"acs":5466,"articleLive":2,"columnArticles":64,"formTitle":"[1957]删除字符使字符串变好","frequency":0.4181180555,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":8973,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.4263453815261044,"acs":2654,"articleLive":2,"columnArticles":48,"formTitle":"[1958]检查操作是否合法","frequency":0.6284711262,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":6225,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.42405896288496975,"acs":1611,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3799,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.2850222042793702,"acs":706,"articleLive":2,"columnArticles":20,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":1.5544706722,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2477,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5354794046382831,"acs":7735,"articleLive":2,"columnArticles":76,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.4716067405,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":14445,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4385594761731539,"acs":6028,"articleLive":2,"columnArticles":82,"formTitle":"[1962]移除石子使总数最小","frequency":1.4459042916,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":13745,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6208154226911554,"acs":4766,"articleLive":2,"columnArticles":61,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.5001312072,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7677,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3906927675536279,"acs":3333,"articleLive":2,"columnArticles":50,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8531,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7606837606837606,"acs":712,"articleLive":2,"columnArticles":17,"formTitle":"[1965]丢失信息的雇员","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"","submitted":936,"title":"丢失信息的雇员","titleSlug":"employees-with-missing-information"},{"acceptance":0.5867768595041323,"acs":71,"articleLive":2,"columnArticles":8,"formTitle":"[1966]未排序数组中的可被二分搜索的数","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"","submitted":121,"title":"未排序数组中的可被二分搜索的数","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.783342526199669,"acs":7101,"articleLive":2,"columnArticles":87,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":9065,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3639651609093593,"acs":4931,"articleLive":2,"columnArticles":72,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":13548,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.2836654870553176,"acs":3046,"articleLive":2,"columnArticles":44,"formTitle":"[1969]数组元素的最小非零乘积","frequency":2.0352188407,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10738,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4780507450664519,"acs":2374,"articleLive":2,"columnArticles":53,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":1.724369709,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4966,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.48924122310305773,"acs":1296,"articleLive":2,"columnArticles":32,"formTitle":"[1971]寻找图中是否存在路径","frequency":0.4442975611,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":2649,"title":"寻找图中是否存在路径","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4488950276243094,"acs":325,"articleLive":2,"columnArticles":13,"formTitle":"[1972]同一天的第一个电话和最后一个电话","frequency":0.594008722,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"","submitted":724,"title":"同一天的第一个电话和最后一个电话","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5323383084577115,"acs":107,"articleLive":2,"columnArticles":11,"formTitle":"[1973]值等于子节点值之和的节点数量","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"","submitted":201,"title":"值等于子节点值之和的节点数量","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7343092976171935,"acs":4715,"articleLive":2,"columnArticles":69,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.988662914,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":6421,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.38896814075130764,"acs":3272,"articleLive":2,"columnArticles":48,"formTitle":"[1975]最大方阵和","frequency":1.4805818301,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":8412,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.3038838565578856,"acs":2449,"articleLive":2,"columnArticles":55,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":8059,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.2579771222155328,"acs":857,"articleLive":2,"columnArticles":17,"formTitle":"[1977]划分数字的方案数","frequency":1.4459042916,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":3322,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5408631772268135,"acs":589,"articleLive":2,"columnArticles":15,"formTitle":"[1978]上级经理已离职的公司员工","frequency":0.4716067405,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"","submitted":1089,"title":"上级经理已离职的公司员工","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.7914882901032485,"acs":9429,"articleLive":2,"columnArticles":120,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":11913,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5857369551012788,"acs":6275,"articleLive":2,"columnArticles":112,"formTitle":"[1980]找出不同的二进制字符串","frequency":1.0808941382,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":10713,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.3052644788856121,"acs":4865,"articleLive":2,"columnArticles":88,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":1.7849943308,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15937,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.46765913757700206,"acs":911,"articleLive":2,"columnArticles":19,"formTitle":"[1982]从子集的和还原数组","frequency":1.1853732082,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1948,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.5398773006134969,"acs":88,"articleLive":2,"columnArticles":4,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"","submitted":163,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5763093999306278,"acs":6646,"articleLive":2,"columnArticles":74,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":11532,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.41523700597280466,"acs":6535,"articleLive":2,"columnArticles":94,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":15738,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.28669282911166605,"acs":4018,"articleLive":2,"columnArticles":80,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.5001312072,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":14015,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.47370030581039757,"acs":1549,"articleLive":2,"columnArticles":27,"formTitle":"[1987]不同的好子序列数目","frequency":0.9327824556,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3270,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6725806451612903,"acs":417,"articleLive":2,"columnArticles":10,"formTitle":"[1988]找出每所学校的最低分数要求","frequency":1.1853732082,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"","submitted":620,"title":"找出每所学校的最低分数要求","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.521505376344086,"acs":97,"articleLive":2,"columnArticles":3,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"","submitted":186,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.5503355704697986,"acs":492,"articleLive":2,"columnArticles":12,"formTitle":"[1990]统计实验的数量","frequency":0.4442975611,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"","submitted":894,"title":"统计实验的数量","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6566328686100549,"acs":6217,"articleLive":2,"columnArticles":86,"formTitle":"[1991]找到数组的中间位置","frequency":0.4181180555,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":9468,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5932596291012838,"acs":3327,"articleLive":2,"columnArticles":69,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":5608,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.3851286939942803,"acs":2020,"articleLive":2,"columnArticles":46,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":5245,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.37341072415699283,"acs":1351,"articleLive":2,"columnArticles":38,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3618,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.6632169395400824,"acs":32042,"articleLive":2,"columnArticles":227,"formTitle":"[1995]统计特殊四元组","frequency":1.0973811987,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":48313,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.2558651369702646,"acs":5464,"articleLive":2,"columnArticles":101,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":21355,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.3413208649912332,"acs":2336,"articleLive":2,"columnArticles":38,"formTitle":"[1997]访问完所有房间的第一天","frequency":1.3054212505,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6844,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.4228380315336837,"acs":1770,"articleLive":2,"columnArticles":34,"formTitle":"[1998]数组的最大公因数排序","frequency":0.743540456,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":4186,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.4619289340101523,"acs":91,"articleLive":2,"columnArticles":9,"formTitle":"[1999]最小的仅由两个数组成的倍数","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"","submitted":197,"title":"最小的仅由两个数组成的倍数","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7700474993014809,"acs":8268,"articleLive":2,"columnArticles":123,"formTitle":"[2000]反转单词前缀","frequency":0.4181180555,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":10737,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.36315758328895203,"acs":6137,"articleLive":2,"columnArticles":133,"formTitle":"[2001]可互换矩形的组数","frequency":0.5612188992,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":16899,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5816809707013909,"acs":3931,"articleLive":2,"columnArticles":90,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6758,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.39558507521000197,"acs":2025,"articleLive":2,"columnArticles":43,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":5119,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.425,"acs":221,"articleLive":2,"columnArticles":9,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"","submitted":520,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6181818181818182,"acs":34,"articleLive":2,"columnArticles":3,"formTitle":"[2005]斐波那契树的移除子树游戏","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"","submitted":55,"title":"斐波那契树的移除子树游戏","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8465004928883256,"acs":6011,"articleLive":2,"columnArticles":82,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":7101,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.32204291541053376,"acs":3632,"articleLive":2,"columnArticles":72,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.4442975611,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":11278,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.42674752633258856,"acs":2674,"articleLive":2,"columnArticles":47,"formTitle":"[2008]出租车的最大盈利","frequency":1.6786996721,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":6266,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.4160452558498329,"acs":1618,"articleLive":2,"columnArticles":44,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3889,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6406779661016949,"acs":189,"articleLive":2,"columnArticles":9,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"","submitted":295,"title":"The Number of Seniors and Juniors to Join the Company II","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company-ii"},{"acceptance":0.876531748978834,"acs":9442,"articleLive":2,"columnArticles":97,"formTitle":"[2011]执行操作后的变量值","frequency":1.3805429075,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":10772,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.36522160329377573,"acs":4524,"articleLive":2,"columnArticles":81,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":12387,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.3446140234461402,"acs":3116,"articleLive":2,"columnArticles":57,"formTitle":"[2013]检测正方形","frequency":0.5001312072,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":9042,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5332005312084993,"acs":1606,"articleLive":2,"columnArticles":26,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":3012,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.6722689075630253,"acs":80,"articleLive":2,"columnArticles":5,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"","submitted":119,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5569160614761021,"acs":6595,"articleLive":2,"columnArticles":88,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.4442975611,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":11842,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.3571043165467626,"acs":3971,"articleLive":2,"columnArticles":100,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":11120,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.41060866246899447,"acs":2152,"articleLive":2,"columnArticles":53,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.594008722,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":5241,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.35856115107913666,"acs":1246,"articleLive":2,"columnArticles":36,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.5612188992,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":3475,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.7641277641277642,"acs":311,"articleLive":2,"columnArticles":9,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"","submitted":407,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.5826446280991735,"acs":141,"articleLive":2,"columnArticles":10,"formTitle":"[2021]街上最亮的位置","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":242,"title":"街上最亮的位置","titleSlug":"brightest-position-on-street"},{"acceptance":0.7509375689388925,"acs":3404,"articleLive":2,"columnArticles":57,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":4533,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.49279341111873715,"acs":2872,"articleLive":2,"columnArticles":72,"formTitle":"[2024]考试的最大困扰度","frequency":0.4716067405,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":5828,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.2646613696556943,"acs":1399,"articleLive":2,"columnArticles":46,"formTitle":"[2025]分割数组的最多方案数","frequency":0.7030490946,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":5286,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.8573388203017832,"acs":625,"articleLive":2,"columnArticles":15,"formTitle":"[2026]低质量的问题","frequency":1.4125900849,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":729,"title":"低质量的问题","titleSlug":"low-quality-problems"},{"acceptance":0.562607944732297,"acs":5212,"articleLive":2,"columnArticles":61,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":9264,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.4278526866572751,"acs":4252,"articleLive":2,"columnArticles":64,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":9938,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.23771742447360392,"acs":2337,"articleLive":2,"columnArticles":68,"formTitle":"[2029]石子游戏 IX","frequency":0.5612188992,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":9831,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.35140826533298236,"acs":1335,"articleLive":2,"columnArticles":41,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.743540456,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3799,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.5445026178010471,"acs":104,"articleLive":2,"columnArticles":5,"formTitle":"[2031]1 比 0 多的子数组个数","frequency":2.062116643,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":191,"title":"1 比 0 多的子数组个数","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6624550490815434,"acs":6816,"articleLive":2,"columnArticles":116,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":10289,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.397773458208164,"acs":4502,"articleLive":2,"columnArticles":93,"formTitle":"[2033]获取单值网格的最小操作数","frequency":1.0182071603,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":11318,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.3065080475857243,"acs":3504,"articleLive":2,"columnArticles":71,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"ac","submitted":11432,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.31991157429338385,"acs":2026,"articleLive":2,"columnArticles":47,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.594008722,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":6333,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.44385026737967914,"acs":83,"articleLive":2,"columnArticles":9,"formTitle":"[2036]最大交替子数组和","frequency":0.0,"frontendQuestionId":"2036","leaf":true,"level":2,"nodeType":"def","questionId":"512","status":"","submitted":187,"title":"最大交替子数组和","titleSlug":"maximum-alternating-subarray-sum"},{"acceptance":0.8292733278282411,"acs":4017,"articleLive":2,"columnArticles":58,"formTitle":"[2037]使每位学生都有座位的最少移动次数","frequency":0.0,"frontendQuestionId":"2037","leaf":true,"level":1,"nodeType":"def","questionId":"2148","status":"ac","submitted":4844,"title":"使每位学生都有座位的最少移动次数","titleSlug":"minimum-number-of-moves-to-seat-everyone"},{"acceptance":0.5080593165699548,"acs":3152,"articleLive":2,"columnArticles":66,"formTitle":"[2038]如果相邻两个颜色均相同则删除当前颜色","frequency":0.0,"frontendQuestionId":"2038","leaf":true,"level":2,"nodeType":"def","questionId":"2149","status":"ac","submitted":6204,"title":"如果相邻两个颜色均相同则删除当前颜色","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color"},{"acceptance":0.3642273402674591,"acs":1961,"articleLive":2,"columnArticles":45,"formTitle":"[2039]网络空闲的时刻","frequency":0.594008722,"frontendQuestionId":"2039","leaf":true,"level":2,"nodeType":"def","questionId":"2151","status":"ac","submitted":5384,"title":"网络空闲的时刻","titleSlug":"the-time-when-the-network-becomes-idle"},{"acceptance":0.3230897009966777,"acs":1167,"articleLive":2,"columnArticles":21,"formTitle":"[2040]两个有序数组的第 K 小乘积","frequency":0.0,"frontendQuestionId":"2040","leaf":true,"level":3,"nodeType":"def","questionId":"2150","status":"","submitted":3612,"title":"两个有序数组的第 K 小乘积","titleSlug":"kth-smallest-product-of-two-sorted-arrays"},{"acceptance":0.6537634408602151,"acs":304,"articleLive":2,"columnArticles":14,"formTitle":"[2041]面试中被录取的候选人","frequency":0.0,"frontendQuestionId":"2041","leaf":true,"level":2,"nodeType":"def","questionId":"2185","status":"","submitted":465,"title":"面试中被录取的候选人","titleSlug":"accepted-candidates-from-the-interviews"},{"acceptance":0.667722911715518,"acs":7586,"articleLive":2,"columnArticles":122,"formTitle":"[2042]检查句子中的数字是否递增","frequency":1.3496762595,"frontendQuestionId":"2042","leaf":true,"level":1,"nodeType":"def","questionId":"2168","status":"ac","submitted":11361,"title":"检查句子中的数字是否递增","titleSlug":"check-if-numbers-are-ascending-in-a-sentence"},{"acceptance":0.5932853717026378,"acs":6185,"articleLive":2,"columnArticles":73,"formTitle":"[2043]简易银行系统","frequency":0.4716067405,"frontendQuestionId":"2043","leaf":true,"level":2,"nodeType":"def","questionId":"2169","status":"ac","submitted":10425,"title":"简易银行系统","titleSlug":"simple-bank-system"},{"acceptance":0.7412325010824072,"acs":5136,"articleLive":2,"columnArticles":98,"formTitle":"[2044]统计按位或能得到最大值的子集数目","frequency":0.4181180555,"frontendQuestionId":"2044","leaf":true,"level":2,"nodeType":"def","questionId":"2170","status":"ac","submitted":6929,"title":"统计按位或能得到最大值的子集数目","titleSlug":"count-number-of-maximum-bitwise-or-subsets"},{"acceptance":0.3338068181818182,"acs":2350,"articleLive":2,"columnArticles":61,"formTitle":"[2045]到达目的地的第二短时间","frequency":0.594008722,"frontendQuestionId":"2045","leaf":true,"level":3,"nodeType":"def","questionId":"2171","status":"ac","submitted":7040,"title":"到达目的地的第二短时间","titleSlug":"second-minimum-time-to-reach-destination"},{"acceptance":0.6508474576271186,"acs":192,"articleLive":2,"columnArticles":18,"formTitle":"[2046]给按照绝对值排序的链表排序","frequency":0.0,"frontendQuestionId":"2046","leaf":true,"level":2,"nodeType":"def","questionId":"1992","status":"","submitted":295,"title":"给按照绝对值排序的链表排序","titleSlug":"sort-linked-list-already-sorted-using-absolute-values"},{"acceptance":0.2875565999885367,"acs":5017,"articleLive":2,"columnArticles":108,"formTitle":"[2047]句子中的有效单词数","frequency":0.4442975611,"frontendQuestionId":"2047","leaf":true,"level":1,"nodeType":"def","questionId":"2173","status":"ac","submitted":17447,"title":"句子中的有效单词数","titleSlug":"number-of-valid-words-in-a-sentence"},{"acceptance":0.41502137187054755,"acs":4078,"articleLive":2,"columnArticles":94,"formTitle":"[2048]下一个更大的数值平衡数","frequency":0.0,"frontendQuestionId":"2048","leaf":true,"level":2,"nodeType":"def","questionId":"2174","status":"ac","submitted":9826,"title":"下一个更大的数值平衡数","titleSlug":"next-greater-numerically-balanced-number"},{"acceptance":0.39650426644646297,"acs":2881,"articleLive":2,"columnArticles":96,"formTitle":"[2049]统计最高分的节点数目","frequency":0.0,"frontendQuestionId":"2049","leaf":true,"level":2,"nodeType":"def","questionId":"2175","status":"","submitted":7266,"title":"统计最高分的节点数目","titleSlug":"count-nodes-with-the-highest-score"},{"acceptance":0.5610079575596817,"acs":2115,"articleLive":2,"columnArticles":71,"formTitle":"[2050]并行课程 III","frequency":0.4716067405,"frontendQuestionId":"2050","leaf":true,"level":3,"nodeType":"def","questionId":"2176","status":"","submitted":3770,"title":"并行课程 III","titleSlug":"parallel-courses-iii"},{"acceptance":0.6737160120845922,"acs":223,"articleLive":2,"columnArticles":8,"formTitle":"[2051]The Category of Each Member in the Store","frequency":0.0,"frontendQuestionId":"2051","leaf":true,"level":2,"nodeType":"def","questionId":"2194","status":"","submitted":331,"title":"The Category of Each Member in the Store","titleSlug":"the-category-of-each-member-in-the-store"},{"acceptance":0.4094488188976378,"acs":52,"articleLive":2,"columnArticles":7,"formTitle":"[2052]将句子分隔成行的最低成本","frequency":0.0,"frontendQuestionId":"2052","leaf":true,"level":2,"nodeType":"def","questionId":"2082","status":"","submitted":127,"title":"将句子分隔成行的最低成本","titleSlug":"minimum-cost-to-separate-sentence-into-rows"},{"acceptance":0.7475945017182131,"acs":4351,"articleLive":2,"columnArticles":68,"formTitle":"[2053]数组中第 K 个独一无二的字符串","frequency":0.0,"frontendQuestionId":"2053","leaf":true,"level":1,"nodeType":"def","questionId":"2163","status":"","submitted":5820,"title":"数组中第 K 个独一无二的字符串","titleSlug":"kth-distinct-string-in-an-array"},{"acceptance":0.3342304241958221,"acs":2608,"articleLive":2,"columnArticles":60,"formTitle":"[2054]两个最好的不重叠活动","frequency":0.0,"frontendQuestionId":"2054","leaf":true,"level":2,"nodeType":"def","questionId":"2164","status":"","submitted":7803,"title":"两个最好的不重叠活动","titleSlug":"two-best-non-overlapping-events"},{"acceptance":0.3823837818944425,"acs":2188,"articleLive":2,"columnArticles":71,"formTitle":"[2055]蜡烛之间的盘子","frequency":0.988662914,"frontendQuestionId":"2055","leaf":true,"level":2,"nodeType":"def","questionId":"2165","status":"","submitted":5722,"title":"蜡烛之间的盘子","titleSlug":"plates-between-candles"},{"acceptance":0.6098020735155514,"acs":647,"articleLive":2,"columnArticles":14,"formTitle":"[2056]棋盘上有效移动组合的数目","frequency":0.0,"frontendQuestionId":"2056","leaf":true,"level":3,"nodeType":"def","questionId":"2166","status":"","submitted":1061,"title":"棋盘上有效移动组合的数目","titleSlug":"number-of-valid-move-combinations-on-chessboard"},{"acceptance":0.7742013846714442,"acs":6374,"articleLive":2,"columnArticles":44,"formTitle":"[2057]值相等的最小索引","frequency":0.0,"frontendQuestionId":"2057","leaf":true,"level":1,"nodeType":"def","questionId":"2181","status":"","submitted":8233,"title":"值相等的最小索引","titleSlug":"smallest-index-with-equal-value"},{"acceptance":0.5720533566586485,"acs":5232,"articleLive":2,"columnArticles":78,"formTitle":"[2058]找出临界点之间的最小和最大距离","frequency":0.0,"frontendQuestionId":"2058","leaf":true,"level":2,"nodeType":"def","questionId":"2182","status":"","submitted":9146,"title":"找出临界点之间的最小和最大距离","titleSlug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points"},{"acceptance":0.42689377909437154,"acs":4035,"articleLive":2,"columnArticles":93,"formTitle":"[2059]转化数字的最小运算数","frequency":0.0,"frontendQuestionId":"2059","leaf":true,"level":2,"nodeType":"def","questionId":"2183","status":"","submitted":9452,"title":"转化数字的最小运算数","titleSlug":"minimum-operations-to-convert-number"},{"acceptance":0.36538461538461536,"acs":1007,"articleLive":2,"columnArticles":20,"formTitle":"[2060]同源字符串检测","frequency":0.0,"frontendQuestionId":"2060","leaf":true,"level":3,"nodeType":"def","questionId":"2184","status":"","submitted":2756,"title":"同源字符串检测","titleSlug":"check-if-an-original-string-exists-given-two-encoded-strings"},{"acceptance":0.5121951219512195,"acs":63,"articleLive":2,"columnArticles":6,"formTitle":"[2061]扫地机器人清扫过的空间个数","frequency":0.0,"frontendQuestionId":"2061","leaf":true,"level":2,"nodeType":"def","questionId":"2203","status":"","submitted":123,"title":"扫地机器人清扫过的空间个数","titleSlug":"number-of-spaces-cleaning-robot-cleaned"},{"acceptance":0.6076253721089994,"acs":5307,"articleLive":2,"columnArticles":95,"formTitle":"[2062]统计字符串中的元音子字符串","frequency":0.4442975611,"frontendQuestionId":"2062","leaf":true,"level":1,"nodeType":"def","questionId":"2186","status":"ac","submitted":8734,"title":"统计字符串中的元音子字符串","titleSlug":"count-vowel-substrings-of-a-string"},{"acceptance":0.48622589531680444,"acs":4236,"articleLive":2,"columnArticles":101,"formTitle":"[2063]所有子字符串中的元音","frequency":0.4442975611,"frontendQuestionId":"2063","leaf":true,"level":2,"nodeType":"def","questionId":"2187","status":"ac","submitted":8712,"title":"所有子字符串中的元音","titleSlug":"vowels-of-all-substrings"},{"acceptance":0.41697772426249247,"acs":3463,"articleLive":2,"columnArticles":72,"formTitle":"[2064]分配给商店的最多商品的最小值","frequency":0.0,"frontendQuestionId":"2064","leaf":true,"level":2,"nodeType":"def","questionId":"2188","status":"notac","submitted":8305,"title":"分配给商店的最多商品的最小值","titleSlug":"minimized-maximum-of-products-distributed-to-any-store"},{"acceptance":0.5341993637327678,"acs":2015,"articleLive":2,"columnArticles":57,"formTitle":"[2065]最大化一张图中的路径价值","frequency":0.0,"frontendQuestionId":"2065","leaf":true,"level":3,"nodeType":"def","questionId":"2189","status":"ac","submitted":3772,"title":"最大化一张图中的路径价值","titleSlug":"maximum-path-quality-of-a-graph"},{"acceptance":0.8308823529411765,"acs":226,"articleLive":2,"columnArticles":10,"formTitle":"[2066]账户余额","frequency":0.0,"frontendQuestionId":"2066","leaf":true,"level":2,"nodeType":"def","questionId":"2208","status":"","submitted":272,"title":"账户余额","titleSlug":"account-balance"},{"acceptance":0.4444444444444444,"acs":48,"articleLive":2,"columnArticles":5,"formTitle":"[2067]Number of Equal Count Substrings","frequency":0.0,"frontendQuestionId":"2067","leaf":true,"level":2,"nodeType":"def","questionId":"2209","status":"","submitted":108,"title":"Number of Equal Count Substrings","titleSlug":"number-of-equal-count-substrings"},{"acceptance":0.7389777604369879,"acs":3788,"articleLive":2,"columnArticles":67,"formTitle":"[2068]检查两个字符串是否几乎相等","frequency":0.0,"frontendQuestionId":"2068","leaf":true,"level":1,"nodeType":"def","questionId":"2177","status":"ac","submitted":5126,"title":"检查两个字符串是否几乎相等","titleSlug":"check-whether-two-strings-are-almost-equivalent"},{"acceptance":0.19150766343446982,"acs":2449,"articleLive":2,"columnArticles":76,"formTitle":"[2069]模拟行走机器人 II","frequency":0.0,"frontendQuestionId":"2069","leaf":true,"level":2,"nodeType":"def","questionId":"2178","status":"notac","submitted":12788,"title":"模拟行走机器人 II","titleSlug":"walking-robot-simulation-ii"},{"acceptance":0.4259693417493237,"acs":2362,"articleLive":2,"columnArticles":79,"formTitle":"[2070]每一个查询的最大美丽值","frequency":0.0,"frontendQuestionId":"2070","leaf":true,"level":2,"nodeType":"def","questionId":"2179","status":"","submitted":5545,"title":"每一个查询的最大美丽值","titleSlug":"most-beautiful-item-for-each-query"},{"acceptance":0.36528662420382163,"acs":1147,"articleLive":2,"columnArticles":28,"formTitle":"[2071]你可以安排的最多任务数目","frequency":0.4442975611,"frontendQuestionId":"2071","leaf":true,"level":3,"nodeType":"def","questionId":"2180","status":"","submitted":3140,"title":"你可以安排的最多任务数目","titleSlug":"maximum-number-of-tasks-you-can-assign"},{"acceptance":0.6889952153110048,"acs":288,"articleLive":2,"columnArticles":6,"formTitle":"[2072]赢得比赛的大学","frequency":0.0,"frontendQuestionId":"2072","leaf":true,"level":1,"nodeType":"def","questionId":"2214","status":"","submitted":418,"title":"赢得比赛的大学","titleSlug":"the-winner-university"},{"acceptance":0.6146230007616146,"acs":6456,"articleLive":2,"columnArticles":96,"formTitle":"[2073]买票需要的时间","frequency":0.0,"frontendQuestionId":"2073","leaf":true,"level":1,"nodeType":"def","questionId":"2195","status":"","submitted":10504,"title":"买票需要的时间","titleSlug":"time-needed-to-buy-tickets"},{"acceptance":0.417162800246356,"acs":4064,"articleLive":2,"columnArticles":117,"formTitle":"[2074]反转偶数长度组的节点","frequency":0.988662914,"frontendQuestionId":"2074","leaf":true,"level":2,"nodeType":"def","questionId":"2196","status":"","submitted":9742,"title":"反转偶数长度组的节点","titleSlug":"reverse-nodes-in-even-length-groups"},{"acceptance":0.4594407530454042,"acs":3319,"articleLive":2,"columnArticles":65,"formTitle":"[2075]解码斜向换位密码","frequency":0.4716067405,"frontendQuestionId":"2075","leaf":true,"level":2,"nodeType":"def","questionId":"2197","status":"","submitted":7224,"title":"解码斜向换位密码","titleSlug":"decode-the-slanted-ciphertext"},{"acceptance":0.49314285714285716,"acs":2589,"articleLive":2,"columnArticles":68,"formTitle":"[2076]处理含限制条件的好友请求","frequency":0.0,"frontendQuestionId":"2076","leaf":true,"level":3,"nodeType":"def","questionId":"2198","status":"","submitted":5250,"title":"处理含限制条件的好友请求","titleSlug":"process-restricted-friend-requests"},{"acceptance":0.6493506493506493,"acs":50,"articleLive":2,"columnArticles":4,"formTitle":"[2077]Paths in Maze That Lead to Same Room","frequency":0.0,"frontendQuestionId":"2077","leaf":true,"level":2,"nodeType":"def","questionId":"2218","status":"","submitted":77,"title":"Paths in Maze That Lead to Same Room","titleSlug":"paths-in-maze-that-lead-to-same-room"},{"acceptance":0.7525298988040479,"acs":6544,"articleLive":2,"columnArticles":88,"formTitle":"[2078]两栋颜色不同且距离最远的房子","frequency":0.3688470065,"frontendQuestionId":"2078","leaf":true,"level":1,"nodeType":"def","questionId":"2199","status":"","submitted":8696,"title":"两栋颜色不同且距离最远的房子","titleSlug":"two-furthest-houses-with-different-colors"},{"acceptance":0.7718392408596149,"acs":5531,"articleLive":2,"columnArticles":103,"formTitle":"[2079]给植物浇水","frequency":0.0,"frontendQuestionId":"2079","leaf":true,"level":2,"nodeType":"def","questionId":"1310","status":"","submitted":7166,"title":"给植物浇水","titleSlug":"watering-plants"},{"acceptance":0.26878456033828474,"acs":4958,"articleLive":2,"columnArticles":134,"formTitle":"[2080]区间内查询数字的频率","frequency":0.4181180555,"frontendQuestionId":"2080","leaf":true,"level":2,"nodeType":"def","questionId":"1294","status":"","submitted":18446,"title":"区间内查询数字的频率","titleSlug":"range-frequency-queries"},{"acceptance":0.40721370604147883,"acs":2258,"articleLive":2,"columnArticles":64,"formTitle":"[2081]k 镜像数字的和","frequency":0.0,"frontendQuestionId":"2081","leaf":true,"level":3,"nodeType":"def","questionId":"2202","status":"","submitted":5545,"title":"k 镜像数字的和","titleSlug":"sum-of-k-mirror-numbers"},{"acceptance":0.774617067833698,"acs":354,"articleLive":2,"columnArticles":10,"formTitle":"[2082]富有客户的数量","frequency":0.0,"frontendQuestionId":"2082","leaf":true,"level":1,"nodeType":"def","questionId":"2223","status":"","submitted":457,"title":"富有客户的数量","titleSlug":"the-number-of-rich-customers"},{"acceptance":0.6783216783216783,"acs":97,"articleLive":2,"columnArticles":8,"formTitle":"[2083]求以相同字母开头和结尾的子串总数","frequency":0.0,"frontendQuestionId":"2083","leaf":true,"level":2,"nodeType":"def","questionId":"2225","status":"","submitted":143,"title":"求以相同字母开头和结尾的子串总数","titleSlug":"substrings-that-begin-and-end-with-the-same-letter"},{"acceptance":0.8256880733944955,"acs":180,"articleLive":2,"columnArticles":9,"formTitle":"[2084]为订单类型为 0 的客户删除类型为 1 的订单","frequency":0.0,"frontendQuestionId":"2084","leaf":true,"level":2,"nodeType":"def","questionId":"2224","status":"","submitted":218,"title":"为订单类型为 0 的客户删除类型为 1 的订单","titleSlug":"drop-type-1-orders-for-customers-with-type-0-orders"},{"acceptance":0.7359905288082084,"acs":3730,"articleLive":2,"columnArticles":61,"formTitle":"[2085]统计出现过一次的公共字符串","frequency":0.0,"frontendQuestionId":"2085","leaf":true,"level":1,"nodeType":"def","questionId":"2190","status":"ac","submitted":5068,"title":"统计出现过一次的公共字符串","titleSlug":"count-common-words-with-one-occurrence"},{"acceptance":0.44745815251084936,"acs":2887,"articleLive":2,"columnArticles":67,"formTitle":"[2086]从房屋收集雨水需要的最少水桶数","frequency":0.0,"frontendQuestionId":"2086","leaf":true,"level":2,"nodeType":"def","questionId":"2191","status":"ac","submitted":6452,"title":"从房屋收集雨水需要的最少水桶数","titleSlug":"minimum-number-of-buckets-required-to-collect-rainwater-from-houses"},{"acceptance":0.46609825416159156,"acs":2296,"articleLive":2,"columnArticles":58,"formTitle":"[2087]网格图中机器人回家的最小代价","frequency":0.4442975611,"frontendQuestionId":"2087","leaf":true,"level":2,"nodeType":"def","questionId":"2192","status":"ac","submitted":4926,"title":"网格图中机器人回家的最小代价","titleSlug":"minimum-cost-homecoming-of-a-robot-in-a-grid"},{"acceptance":0.6175670423630004,"acs":1589,"articleLive":2,"columnArticles":43,"formTitle":"[2088]统计农场中肥沃金字塔的数目","frequency":0.0,"frontendQuestionId":"2088","leaf":true,"level":3,"nodeType":"def","questionId":"2193","status":"","submitted":2573,"title":"统计农场中肥沃金字塔的数目","titleSlug":"count-fertile-pyramids-in-a-land"},{"acceptance":0.8403859567542432,"acs":7229,"articleLive":2,"columnArticles":82,"formTitle":"[2089]找出数组排序后的目标下标","frequency":0.8807415775,"frontendQuestionId":"2089","leaf":true,"level":1,"nodeType":"def","questionId":"2210","status":"","submitted":8602,"title":"找出数组排序后的目标下标","titleSlug":"find-target-indices-after-sorting-array"},{"acceptance":0.3475481107346078,"acs":5436,"articleLive":2,"columnArticles":89,"formTitle":"[2090]半径为 k 的子数组平均值","frequency":0.3688470065,"frontendQuestionId":"2090","leaf":true,"level":2,"nodeType":"def","questionId":"2211","status":"","submitted":15641,"title":"半径为 k 的子数组平均值","titleSlug":"k-radius-subarray-averages"},{"acceptance":0.5711851772974124,"acs":5364,"articleLive":2,"columnArticles":108,"formTitle":"[2091]从数组中移除最大值和最小值","frequency":0.0,"frontendQuestionId":"2091","leaf":true,"level":2,"nodeType":"def","questionId":"2212","status":"","submitted":9391,"title":"从数组中移除最大值和最小值","titleSlug":"removing-minimum-and-maximum-from-array"},{"acceptance":0.2648743346135705,"acs":3931,"articleLive":2,"columnArticles":108,"formTitle":"[2092]找出知晓秘密的所有专家","frequency":0.4716067405,"frontendQuestionId":"2092","leaf":true,"level":3,"nodeType":"def","questionId":"2213","status":"","submitted":14841,"title":"找出知晓秘密的所有专家","titleSlug":"find-all-people-with-secret"},{"acceptance":0.6461538461538462,"acs":42,"articleLive":2,"columnArticles":3,"formTitle":"[2093]Minimum Cost to Reach City With Discounts","frequency":0.0,"frontendQuestionId":"2093","leaf":true,"level":2,"nodeType":"def","questionId":"2230","status":"","submitted":65,"title":"Minimum Cost to Reach City With Discounts","titleSlug":"minimum-cost-to-reach-city-with-discounts"},{"acceptance":0.5518152978498414,"acs":6262,"articleLive":2,"columnArticles":104,"formTitle":"[2094]找出 3 位偶数","frequency":0.0760722799,"frontendQuestionId":"2094","leaf":true,"level":1,"nodeType":"def","questionId":"2215","status":"","submitted":11348,"title":"找出 3 位偶数","titleSlug":"finding-3-digit-even-numbers"},{"acceptance":0.596066105647369,"acs":5879,"articleLive":2,"columnArticles":92,"formTitle":"[2095]删除链表的中间节点","frequency":0.0,"frontendQuestionId":"2095","leaf":true,"level":2,"nodeType":"def","questionId":"2216","status":"","submitted":9863,"title":"删除链表的中间节点","titleSlug":"delete-the-middle-node-of-a-linked-list"},{"acceptance":0.40665184182538916,"acs":4206,"articleLive":2,"columnArticles":152,"formTitle":"[2096]从二叉树一个节点到另一个节点每一步的方向","frequency":0.1531289197,"frontendQuestionId":"2096","leaf":true,"level":2,"nodeType":"def","questionId":"2217","status":"","submitted":10343,"title":"从二叉树一个节点到另一个节点每一步的方向","titleSlug":"step-by-step-directions-from-a-binary-tree-node-to-another"},{"acceptance":0.33851055356431703,"acs":1700,"articleLive":2,"columnArticles":45,"formTitle":"[2097]合法重新排列数对","frequency":0.3929911054,"frontendQuestionId":"2097","leaf":true,"level":3,"nodeType":"def","questionId":"2201","status":"","submitted":5022,"title":"合法重新排列数对","titleSlug":"valid-arrangement-of-pairs"},{"acceptance":0.41379310344827586,"acs":36,"articleLive":2,"columnArticles":2,"formTitle":"[2098]Subsequence of Size K With the Largest Even Sum","frequency":0.988662914,"frontendQuestionId":"2098","leaf":true,"level":2,"nodeType":"def","questionId":"2242","status":"","submitted":87,"title":"Subsequence of Size K With the Largest Even Sum","titleSlug":"subsequence-of-size-k-with-the-largest-even-sum"},{"acceptance":0.4904642904116796,"acs":3729,"articleLive":2,"columnArticles":86,"formTitle":"[2099]找到和最大的长度为 K 的子序列","frequency":0.280916934,"frontendQuestionId":"2099","leaf":true,"level":1,"nodeType":"def","questionId":"2204","status":"ac","submitted":7603,"title":"找到和最大的长度为 K 的子序列","titleSlug":"find-subsequence-of-length-k-with-the-largest-sum"},{"acceptance":0.35521978021978023,"acs":2586,"articleLive":2,"columnArticles":56,"formTitle":"[2100]适合打劫银行的日子","frequency":0.0,"frontendQuestionId":"2100","leaf":true,"level":2,"nodeType":"def","questionId":"2205","status":"ac","submitted":7280,"title":"适合打劫银行的日子","titleSlug":"find-good-days-to-rob-the-bank"},{"acceptance":0.37234716503009185,"acs":2351,"articleLive":2,"columnArticles":60,"formTitle":"[2101]引爆最多的炸弹","frequency":0.0,"frontendQuestionId":"2101","leaf":true,"level":2,"nodeType":"def","questionId":"2206","status":"notac","submitted":6314,"title":"引爆最多的炸弹","titleSlug":"detonate-the-maximum-bombs"},{"acceptance":0.5299705207992139,"acs":1618,"articleLive":2,"columnArticles":56,"formTitle":"[2102]序列顺序查询","frequency":0.0,"frontendQuestionId":"2102","leaf":true,"level":3,"nodeType":"def","questionId":"2207","status":"","submitted":3053,"title":"序列顺序查询","titleSlug":"sequentially-ordinal-rank-tracker"},{"acceptance":0.8110309829059829,"acs":6073,"articleLive":2,"columnArticles":108,"formTitle":"[2103]环和杆","frequency":0.1146005998,"frontendQuestionId":"2103","leaf":true,"level":1,"nodeType":"def","questionId":"2226","status":"","submitted":7488,"title":"环和杆","titleSlug":"rings-and-rods"},{"acceptance":0.5574529029415005,"acs":5060,"articleLive":2,"columnArticles":89,"formTitle":"[2104]子数组范围和","frequency":0.0,"frontendQuestionId":"2104","leaf":true,"level":2,"nodeType":"def","questionId":"2227","status":"","submitted":9077,"title":"子数组范围和","titleSlug":"sum-of-subarray-ranges"},{"acceptance":0.5489021956087824,"acs":4400,"articleLive":2,"columnArticles":75,"formTitle":"[2105]给植物浇水 II","frequency":0.1837873601,"frontendQuestionId":"2105","leaf":true,"level":2,"nodeType":"def","questionId":"2228","status":"","submitted":8016,"title":"给植物浇水 II","titleSlug":"watering-plants-ii"},{"acceptance":0.31618556701030925,"acs":3067,"articleLive":2,"columnArticles":74,"formTitle":"[2106]摘水果","frequency":1.1853732082,"frontendQuestionId":"2106","leaf":true,"level":3,"nodeType":"def","questionId":"2229","status":"","submitted":9700,"title":"摘水果","titleSlug":"maximum-fruits-harvested-after-at-most-k-steps"},{"acceptance":0.5789473684210527,"acs":44,"articleLive":2,"columnArticles":5,"formTitle":"[2107]Number of Unique Flavors After Sharing K Candies","frequency":0.0,"frontendQuestionId":"2107","leaf":true,"level":2,"nodeType":"def","questionId":"2247","status":"","submitted":76,"title":"Number of Unique Flavors After Sharing K Candies","titleSlug":"number-of-unique-flavors-after-sharing-k-candies"},{"acceptance":0.8196764091858038,"acs":6282,"articleLive":2,"columnArticles":79,"formTitle":"[2108]找出数组中的第一个回文字符串","frequency":0.0,"frontendQuestionId":"2108","leaf":true,"level":1,"nodeType":"def","questionId":"2231","status":"ac","submitted":7664,"title":"找出数组中的第一个回文字符串","titleSlug":"find-first-palindromic-string-in-the-array"},{"acceptance":0.6079817085844939,"acs":5850,"articleLive":2,"columnArticles":74,"formTitle":"[2109]向字符串添加空格","frequency":0.0,"frontendQuestionId":"2109","leaf":true,"level":2,"nodeType":"def","questionId":"2232","status":"ac","submitted":9622,"title":"向字符串添加空格","titleSlug":"adding-spaces-to-a-string"},{"acceptance":0.4990270652750752,"acs":5642,"articleLive":2,"columnArticles":102,"formTitle":"[2110]股票平滑下跌阶段的数目","frequency":0.0,"frontendQuestionId":"2110","leaf":true,"level":2,"nodeType":"def","questionId":"2233","status":"ac","submitted":11306,"title":"股票平滑下跌阶段的数目","titleSlug":"number-of-smooth-descent-periods-of-a-stock"},{"acceptance":0.3177108090122635,"acs":3342,"articleLive":2,"columnArticles":82,"formTitle":"[2111]使数组 K 递增的最少操作次数","frequency":0.0,"frontendQuestionId":"2111","leaf":true,"level":3,"nodeType":"def","questionId":"2234","status":"notac","submitted":10519,"title":"使数组 K 递增的最少操作次数","titleSlug":"minimum-operations-to-make-the-array-k-increasing"},{"acceptance":0.780952380952381,"acs":82,"articleLive":2,"columnArticles":4,"formTitle":"[2112]The Airport With the Most Traffic","frequency":0.0,"frontendQuestionId":"2112","leaf":true,"level":2,"nodeType":"def","questionId":"2252","status":"","submitted":105,"title":"The Airport With the Most Traffic","titleSlug":"the-airport-with-the-most-traffic"},{"acceptance":0.9122807017543859,"acs":52,"articleLive":2,"columnArticles":4,"formTitle":"[2113]Elements in Array After Removing and Replacing Elements","frequency":0.0,"frontendQuestionId":"2113","leaf":true,"level":2,"nodeType":"def","questionId":"2258","status":"","submitted":57,"title":"Elements in Array After Removing and Replacing Elements","titleSlug":"elements-in-array-after-removing-and-replacing-elements"},{"acceptance":0.9047395588925388,"acs":3856,"articleLive":2,"columnArticles":53,"formTitle":"[2114]句子中的最多单词数","frequency":0.0,"frontendQuestionId":"2114","leaf":true,"level":1,"nodeType":"def","questionId":"2219","status":"ac","submitted":4262,"title":"句子中的最多单词数","titleSlug":"maximum-number-of-words-found-in-sentences"},{"acceptance":0.350439322551891,"acs":2752,"articleLive":2,"columnArticles":73,"formTitle":"[2115]从给定原材料中找到所有可以做出的菜","frequency":0.0,"frontendQuestionId":"2115","leaf":true,"level":2,"nodeType":"def","questionId":"2220","status":"ac","submitted":7853,"title":"从给定原材料中找到所有可以做出的菜","titleSlug":"find-all-possible-recipes-from-given-supplies"},{"acceptance":0.26429720637706594,"acs":1807,"articleLive":2,"columnArticles":43,"formTitle":"[2116]判断一个括号字符串是否有效","frequency":0.6284711262,"frontendQuestionId":"2116","leaf":true,"level":2,"nodeType":"def","questionId":"2221","status":"ac","submitted":6837,"title":"判断一个括号字符串是否有效","titleSlug":"check-if-a-parentheses-string-can-be-valid"},{"acceptance":0.3628727425451491,"acs":864,"articleLive":2,"columnArticles":13,"formTitle":"[2117]一个区间内所有数乘积的缩写","frequency":0.0,"frontendQuestionId":"2117","leaf":true,"level":3,"nodeType":"def","questionId":"2222","status":"","submitted":2381,"title":"一个区间内所有数乘积的缩写","titleSlug":"abbreviating-the-product-of-a-range"},{"acceptance":0.6,"acs":36,"articleLive":2,"columnArticles":1,"formTitle":"[2118]Build the Equation","frequency":0.0,"frontendQuestionId":"2118","leaf":true,"level":3,"nodeType":"def","questionId":"2253","status":"","submitted":60,"title":"Build the Equation","titleSlug":"build-the-equation"},{"acceptance":0.8043710021321961,"acs":6036,"articleLive":2,"columnArticles":47,"formTitle":"[2119]反转两次的数字","frequency":0.0,"frontendQuestionId":"2119","leaf":true,"level":1,"nodeType":"def","questionId":"2238","status":"ac","submitted":7504,"title":"反转两次的数字","titleSlug":"a-number-after-a-double-reversal"},{"acceptance":0.8261685431593313,"acs":4843,"articleLive":2,"columnArticles":64,"formTitle":"[2120]执行所有后缀指令","frequency":1.0700913973,"frontendQuestionId":"2120","leaf":true,"level":2,"nodeType":"def","questionId":"2239","status":"ac","submitted":5862,"title":"执行所有后缀指令","titleSlug":"execution-of-all-suffix-instructions-staying-in-a-grid"},{"acceptance":0.33666666666666667,"acs":3838,"articleLive":2,"columnArticles":113,"formTitle":"[2121]相同元素的间隔之和","frequency":0.7230058535,"frontendQuestionId":"2121","leaf":true,"level":2,"nodeType":"def","questionId":"2240","status":"ac","submitted":11400,"title":"相同元素的间隔之和","titleSlug":"intervals-between-identical-elements"},{"acceptance":0.392991239048811,"acs":2512,"articleLive":2,"columnArticles":50,"formTitle":"[2122]还原原数组","frequency":0.0,"frontendQuestionId":"2122","leaf":true,"level":3,"nodeType":"def","questionId":"2241","status":"notac","submitted":6392,"title":"还原原数组","titleSlug":"recover-the-original-array"},{"acceptance":0.3076923076923077,"acs":8,"articleLive":2,"columnArticles":1,"formTitle":"[2123]Minimum Operations to Remove Adjacent Ones in Matrix","frequency":0.0,"frontendQuestionId":"2123","leaf":true,"level":3,"nodeType":"def","questionId":"2259","status":"","submitted":26,"title":"Minimum Operations to Remove Adjacent Ones in Matrix","titleSlug":"minimum-operations-to-remove-adjacent-ones-in-matrix"},{"acceptance":0.8451117770937956,"acs":83470,"articleLive":2,"columnArticles":642,"formTitle":"[LCP 01]猜数字","frequency":0.4442975611,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":98768,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.691415089797294,"acs":14360,"articleLive":2,"columnArticles":247,"formTitle":"[LCP 02]分式化简","frequency":1.3805429075,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":20769,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.22152243800642965,"acs":11783,"articleLive":2,"columnArticles":188,"formTitle":"[LCP 03]机器人大冒险","frequency":0.5001312072,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":53191,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.38587401145350425,"acs":2830,"articleLive":2,"columnArticles":64,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":7334,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.20256122639745747,"acs":2167,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10698,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8392912822582125,"acs":45759,"articleLive":2,"columnArticles":692,"formTitle":"[LCP 06]拿硬币","frequency":0.4716067405,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":54521,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7662571784340327,"acs":41230,"articleLive":2,"columnArticles":493,"formTitle":"[LCP 07]传递信息","frequency":2.4526082093,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":53807,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.29315263908701855,"acs":5343,"articleLive":2,"columnArticles":109,"formTitle":"[LCP 08]剧情触发时间","frequency":1.1490055641,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":18226,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.28032979976442873,"acs":6902,"articleLive":2,"columnArticles":112,"formTitle":"[LCP 09]最小跳跃次数","frequency":2.1761588888,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":24621,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5900452488687783,"acs":1956,"articleLive":2,"columnArticles":39,"formTitle":"[LCP 10]二叉树任务调度","frequency":1.9057438474,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3315,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6940093040919016,"acs":7310,"articleLive":2,"columnArticles":74,"formTitle":"[LCP 11]期望个数统计","frequency":1.0182071603,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":10533,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.41567230632235086,"acs":7002,"articleLive":2,"columnArticles":115,"formTitle":"[LCP 12]小张刷题计划","frequency":0.5299663557,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":16845,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6114955786236063,"acs":9543,"articleLive":2,"columnArticles":86,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15606,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21562312762133012,"acs":2879,"articleLive":2,"columnArticles":45,"formTitle":"[LCP 14]切分数组","frequency":1.8234606116,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":13352,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5830280830280831,"acs":955,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 15]游乐园的迷宫","frequency":1.114219448,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1638,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.3134191176470588,"acs":682,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 16]游乐园的游览计划","frequency":1.0489221055,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":2176,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7988430017676362,"acs":24856,"articleLive":2,"columnArticles":270,"formTitle":"[LCP 17]速算机器人","frequency":0.4442975611,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":31115,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2903497026126491,"acs":18648,"articleLive":2,"columnArticles":249,"formTitle":"[LCP 18]早餐组合","frequency":1.6786996721,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":64226,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5171171638116464,"acs":19954,"articleLive":2,"columnArticles":206,"formTitle":"[LCP 19]秋叶收藏集","frequency":1.114219448,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38587,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3202888814242526,"acs":1907,"articleLive":2,"columnArticles":34,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5954,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.33227959255356515,"acs":946,"articleLive":2,"columnArticles":27,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2847,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3360188713482127,"acs":9259,"articleLive":2,"columnArticles":190,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":27555,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3411808209047208,"acs":2768,"articleLive":2,"columnArticles":56,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":8113,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.28751465416178196,"acs":981,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3412,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.33864434242506075,"acs":1254,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3703,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3448471121177803,"acs":609,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 26]导航装置","frequency":1.114219448,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1766,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32812105926860025,"acs":1301,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3965,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.28897969291728576,"acs":11669,"articleLive":2,"columnArticles":190,"formTitle":"[LCP 28]采购方案","frequency":0.4442975611,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":40380,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.19261213720316622,"acs":5694,"articleLive":2,"columnArticles":134,"formTitle":"[LCP 29]乐团站位","frequency":1.4125900849,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":29562,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3558504221954162,"acs":6195,"articleLive":2,"columnArticles":108,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":17409,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.25685071574642127,"acs":1884,"articleLive":2,"columnArticles":38,"formTitle":"[LCP 31]变换的迷宫","frequency":1.9057438474,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":7335,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.4154228855721393,"acs":1169,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 32]批量处理任务","frequency":1.3054212505,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2814,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.22595581426114567,"acs":5124,"articleLive":2,"columnArticles":88,"formTitle":"[LCP 33]蓄水","frequency":1.0808941382,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":22677,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.5003675119441382,"acs":2723,"articleLive":2,"columnArticles":65,"formTitle":"[LCP 34]二叉树染色","frequency":1.9963034245,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":5442,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.41442006269592474,"acs":1322,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 35]电动车游城市","frequency":1.1490055641,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":3190,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.2741635687732342,"acs":885,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":2.9339190408,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":3228,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19986263736263737,"acs":873,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 37]最小矩形面积","frequency":0.7030490946,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":4368,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5701849836779108,"acs":524,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":919,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5139498990858364,"acs":4329,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 39]无人机方阵","frequency":0.4181180555,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":8423,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.2534423407917384,"acs":3534,"articleLive":2,"columnArticles":74,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":13944,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.43381906496660594,"acs":1429,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.6284711262,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3294,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.2083941605839416,"acs":1142,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5480,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.42910101946246526,"acs":463,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":1079,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8171611868484362,"acs":4076,"articleLive":2,"columnArticles":56,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":4988,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.20574482297929192,"acs":1232,"articleLive":2,"columnArticles":31,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5988,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.39187056037884765,"acs":993,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2534,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.36643414033647925,"acs":893,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2437,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.17623956799214532,"acs":359,"articleLive":2,"columnArticles":10,"formTitle":"[LCP 48]无限棋局","frequency":0.988662914,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":2037,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.2501776830135039,"acs":352,"articleLive":2,"columnArticles":10,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1407,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5428543151227236,"acs":5485,"articleLive":2,"columnArticles":117,"formTitle":"[LCS 01]下载插件","frequency":1.8554735886,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"ac","submitted":10104,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6743083003952569,"acs":4265,"articleLive":2,"columnArticles":82,"formTitle":"[LCS 02]完成一半题目","frequency":1.0808941382,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":6325,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4095315024232633,"acs":2028,"articleLive":2,"columnArticles":65,"formTitle":"[LCS 03]主题空间","frequency":1.3805429075,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4952,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.678591673872836,"acs":446514,"articleLive":2,"columnArticles":3026,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":4.1579355259,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"ac","submitted":658001,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4030424822704764,"acs":293822,"articleLive":2,"columnArticles":2322,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":3.3817263258,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":729010,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7599152078774617,"acs":333390,"articleLive":2,"columnArticles":2163,"formTitle":"[剑指 Offer 05]替换空格","frequency":3.3996473789,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":438720,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7498656479652951,"acs":347439,"articleLive":2,"columnArticles":2335,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":3.5881970272,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":463335,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6995262557270908,"acs":206575,"articleLive":2,"columnArticles":1548,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":3.1205581437,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":295307,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7131676012146446,"acs":310715,"articleLive":2,"columnArticles":1920,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":4.6396172696,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":435683,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.36082258447513177,"acs":294787,"articleLive":2,"columnArticles":1998,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":3.651250741,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":816986,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.44708573560815157,"acs":220462,"articleLive":2,"columnArticles":1430,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":3.1663746771,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":493109,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.4924355144168913,"acs":293561,"articleLive":2,"columnArticles":1781,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":3.9779703622,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":596141,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.45267166915531026,"acs":191596,"articleLive":2,"columnArticles":1250,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":2.8160133283,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":423256,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5286376963574884,"acs":197609,"articleLive":2,"columnArticles":1853,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":3.5669015036,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":373808,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5706049495572856,"acs":172903,"articleLive":2,"columnArticles":1420,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":2.8160133283,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":303017,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3141789575829572,"acs":90979,"articleLive":2,"columnArticles":524,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.3232602621,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":289577,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7481954026973616,"acs":215802,"articleLive":2,"columnArticles":1347,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":1.5260111533,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":288430,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3416966066373367,"acs":137238,"articleLive":2,"columnArticles":832,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":1.2634159152,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":401637,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7782476966012922,"acs":162853,"articleLive":2,"columnArticles":1186,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":2.9112326857,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":209256,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5978347853230795,"acs":210671,"articleLive":2,"columnArticles":1596,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":2.2342333317,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":352390,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3802283145320798,"acs":73243,"articleLive":2,"columnArticles":481,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":2.5805565168,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":192629,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24542732755752902,"acs":84843,"articleLive":2,"columnArticles":930,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":2.8514701779,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":345695,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.644927536231884,"acs":217961,"articleLive":2,"columnArticles":1799,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":2.7327185853,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":337962,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7989444661059433,"acs":286869,"articleLive":2,"columnArticles":2619,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":4.0164986821,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":359060,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7424852007487404,"acs":332003,"articleLive":2,"columnArticles":2017,"formTitle":"[剑指 Offer 24]反转链表","frequency":4.1141542148,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":447151,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7275512584386239,"acs":208968,"articleLive":2,"columnArticles":1300,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":3.4598188209,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":287221,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4663754750273342,"acs":166781,"articleLive":2,"columnArticles":1347,"formTitle":"[剑指 Offer 26]树的子结构","frequency":3.539013472,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":357611,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7928910092392547,"acs":215059,"articleLive":2,"columnArticles":1551,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":2.3770115678,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":271234,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5790988156290651,"acs":170057,"articleLive":2,"columnArticles":1226,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":2.1861459886,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":293658,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.4394878252177323,"acs":159157,"articleLive":2,"columnArticles":1584,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":3.4390544942,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":362142,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5603304612984434,"acs":173833,"articleLive":2,"columnArticles":1151,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":3.1205581437,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":310233,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6167523575255963,"acs":125115,"articleLive":2,"columnArticles":1044,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":2.1761588888,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":202861,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6406795202622653,"acs":157907,"articleLive":2,"columnArticles":1107,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":2.2849502823,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":246468,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6880253257074422,"acs":156265,"articleLive":2,"columnArticles":1227,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":2.157944776,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":227121,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5885329337504617,"acs":138646,"articleLive":2,"columnArticles":1294,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":2.3385896309,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":235579,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5549920231351056,"acs":126279,"articleLive":2,"columnArticles":1058,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":2.3954958944,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":227533,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5801263841382109,"acs":150099,"articleLive":2,"columnArticles":964,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":2.8836066195,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":258735,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7184111567675259,"acs":144239,"articleLive":2,"columnArticles":995,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":2.6439160053,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":200775,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6538819102429306,"acs":118163,"articleLive":2,"columnArticles":1023,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":3.1340773438,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":180710,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.563420083248002,"acs":84735,"articleLive":2,"columnArticles":601,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":2.6984412663,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":150394,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5802667567111262,"acs":171846,"articleLive":2,"columnArticles":1195,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":3.8224778523,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":296150,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6938705349969545,"acs":185686,"articleLive":2,"columnArticles":1102,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":1.7925558035,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":267609,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5717360564935826,"acs":273331,"articleLive":2,"columnArticles":1933,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":3.3389414794,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":478072,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5820304340141083,"acs":72443,"articleLive":2,"columnArticles":529,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":2.112207242,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":124466,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6062702558714279,"acs":245805,"articleLive":2,"columnArticles":1632,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":3.9595550485,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":405438,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.49043905468093657,"acs":53707,"articleLive":2,"columnArticles":546,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":2.7766672155,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":109508,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.4195134240754989,"acs":61611,"articleLive":2,"columnArticles":516,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":2.4560782663,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":146863,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5584402114111514,"acs":123833,"articleLive":2,"columnArticles":917,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":3.2718464213,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":221748,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.53073199070488,"acs":137035,"articleLive":2,"columnArticles":1584,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":3.4302169037,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":258200,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6901112935595695,"acs":136170,"articleLive":2,"columnArticles":1121,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":2.42529903,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":197316,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46467882572646724,"acs":171440,"articleLive":2,"columnArticles":1162,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":3.3541635428,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":368943,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6515861716987214,"acs":97029,"articleLive":2,"columnArticles":569,"formTitle":"[剑指 Offer 49]丑数","frequency":2.8836066195,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":148912,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6176637304780551,"acs":177616,"articleLive":2,"columnArticles":1194,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":3.1393861277,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":287561,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4851100449646092,"acs":112742,"articleLive":2,"columnArticles":919,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":3.7763229138,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":232405,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6517698026889817,"acs":193472,"articleLive":2,"columnArticles":1129,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":2.9992086292,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":296841,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5351853444568676,"acs":217791,"articleLive":2,"columnArticles":1761,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":2.9742483374,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":406945,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.4477229273686393,"acs":194361,"articleLive":2,"columnArticles":1649,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":2.9366413161,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":434110,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7584827915429615,"acs":181131,"articleLive":2,"columnArticles":1268,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":1.8234606116,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":238807,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7904081227488017,"acs":195083,"articleLive":2,"columnArticles":1373,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":2.1803070674,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":246813,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5898491987229162,"acs":152233,"articleLive":2,"columnArticles":1017,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":1.2365614551,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":258088,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6962125762526933,"acs":126341,"articleLive":2,"columnArticles":1110,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":3.0064602926,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":181469,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.802845236384538,"acs":100566,"articleLive":2,"columnArticles":758,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":1.6459420757,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":125262,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6693589873239623,"acs":152237,"articleLive":2,"columnArticles":940,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":2.6213576886,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":227437,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7092205194671988,"acs":152120,"articleLive":2,"columnArticles":1949,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":2.7766672155,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":214489,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4427235077412054,"acs":147094,"articleLive":2,"columnArticles":1083,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":2.3047053119,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":332248,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.858642839200488,"acs":239278,"articleLive":2,"columnArticles":1988,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":2.1184061213,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":278670,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44507684963016697,"acs":143572,"articleLive":2,"columnArticles":1276,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":3.0835870647,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":322578,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4762520697737353,"acs":103832,"articleLive":2,"columnArticles":1119,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":2.1803070674,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":218019,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.56532079516206,"acs":72261,"articleLive":2,"columnArticles":640,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":2.761054444,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":127823,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4602616478513067,"acs":118070,"articleLive":2,"columnArticles":1102,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":1.9963034245,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":256528,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6559236684580766,"acs":120097,"articleLive":2,"columnArticles":813,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":3.6308210213,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":183096,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6352001555920107,"acs":150235,"articleLive":2,"columnArticles":1066,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":2.912882715,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":236516,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8569557229052307,"acs":151119,"articleLive":2,"columnArticles":1380,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":2.2098775248,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":176344,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5879387833890577,"acs":80714,"articleLive":2,"columnArticles":557,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":2.5724789284,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":137283,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5990469112053513,"acs":82212,"articleLive":2,"columnArticles":600,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":2.7327185853,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":137238,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28855017279013956,"acs":77068,"articleLive":2,"columnArticles":618,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":1.6786996721,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":267087,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6951518442180062,"acs":131871,"articleLive":2,"columnArticles":766,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":1.748123795,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":189701,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.70155807212818,"acs":130219,"articleLive":2,"columnArticles":758,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":2.6504607454,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":185614,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20672587360307293,"acs":16038,"articleLive":2,"columnArticles":178,"formTitle":"[剑指 Offer II 001]整数除法","frequency":2.9802067653,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"ac","submitted":77581,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5585991541167635,"acs":14132,"articleLive":2,"columnArticles":183,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":1.5839018723,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"ac","submitted":25299,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7852763422965753,"acs":17931,"articleLive":2,"columnArticles":221,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":1.2365614551,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"ac","submitted":22834,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.7012766759315966,"acs":14886,"articleLive":2,"columnArticles":158,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":1.2365614551,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":21227,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7138247704144949,"acs":11504,"articleLive":2,"columnArticles":137,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":1.0182071603,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":16116,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6441012317167052,"acs":13387,"articleLive":2,"columnArticles":155,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.9327824556,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"ac","submitted":20784,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4477284753193741,"acs":11846,"articleLive":2,"columnArticles":120,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":2.2936786261,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":26458,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.49722281110875555,"acs":11727,"articleLive":2,"columnArticles":142,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.9327824556,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":23585,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5534230879404182,"acs":9660,"articleLive":2,"columnArticles":126,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.988662914,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":17455,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.44101786316144254,"acs":10468,"articleLive":2,"columnArticles":113,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":1.8234606116,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":23736,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5600738059754453,"acs":7892,"articleLive":2,"columnArticles":99,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":1.8774694166,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":14091,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.668762663313072,"acs":9572,"articleLive":2,"columnArticles":123,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.2608439999,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":14313,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6557556462043578,"acs":6591,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.9602114928,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":10051,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5100752455044,"acs":7999,"articleLive":2,"columnArticles":111,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.4181180555,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":15682,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6269306930693069,"acs":6332,"articleLive":2,"columnArticles":93,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.4181180555,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":10100,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.4858443139122612,"acs":9181,"articleLive":2,"columnArticles":136,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":1.7058163011,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":18897,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5141757416447615,"acs":5477,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.4181180555,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":10652,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5204010258801586,"acs":8928,"articleLive":2,"columnArticles":116,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":17156,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4673006134969325,"acs":7617,"articleLive":2,"columnArticles":111,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":1.3496762595,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":16300,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7163693702572189,"acs":7269,"articleLive":2,"columnArticles":100,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":1.1853732082,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":10147,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5231377257491621,"acs":10457,"articleLive":2,"columnArticles":139,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":1.8554735886,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":19989,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5453407261670542,"acs":12196,"articleLive":2,"columnArticles":111,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":1.7058163011,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":22364,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.6970888468809073,"acs":9219,"articleLive":2,"columnArticles":92,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.9602114928,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":13225,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7394132653061225,"acs":23188,"articleLive":2,"columnArticles":188,"formTitle":"[剑指 Offer II 024]反转链表","frequency":1.9963034245,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":31360,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6017879548306148,"acs":7674,"articleLive":2,"columnArticles":130,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":2.3954958944,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":12752,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6626868031944335,"acs":8381,"articleLive":2,"columnArticles":126,"formTitle":"[剑指 Offer II 026]重排链表","frequency":2.0239294907,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":12647,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.611824120835843,"acs":13205,"articleLive":2,"columnArticles":153,"formTitle":"[剑指 Offer II 027]回文链表","frequency":1.8234606116,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":21583,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6281081081081081,"acs":4648,"articleLive":2,"columnArticles":92,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.988662914,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":7400,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.30522013746981236,"acs":4929,"articleLive":2,"columnArticles":118,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.3456225535,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":16149,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5474515611501913,"acs":4436,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.3929911054,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":8103,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5451396406148517,"acs":5036,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":9238,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.5992548306039338,"acs":6916,"articleLive":2,"columnArticles":103,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":11541,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7656420021762785,"acs":5629,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 033]变位词组","frequency":1.0182071603,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":7352,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5721280152854072,"acs":4791,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":8374,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6634727437524278,"acs":5124,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":7723,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5693079657118963,"acs":5446,"articleLive":2,"columnArticles":93,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.3929911054,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":9566,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.44430816404752776,"acs":5796,"articleLive":2,"columnArticles":107,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":13045,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7787167797175581,"acs":7003,"articleLive":2,"columnArticles":110,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":8993,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5055395524041657,"acs":4563,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":9026,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5769580228966018,"acs":3175,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":1.6786996721,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":5503,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7794802647707771,"acs":6359,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":8158,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8352272727272727,"acs":5292,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.4181180555,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":6336,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6466746863722289,"acs":3763,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.9602114928,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":5819,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6389604810996563,"acs":5950,"articleLive":2,"columnArticles":110,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.3688470065,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":9312,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.804602510460251,"acs":5769,"articleLive":2,"columnArticles":117,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":7170,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7203321725154032,"acs":5378,"articleLive":2,"columnArticles":109,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.9063118788,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":7466,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.689918533604888,"acs":5420,"articleLive":2,"columnArticles":103,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":1.3199121576,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":7856,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.687687125748503,"acs":3675,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":5344,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7542764051045343,"acs":5556,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":1.0489221055,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":7366,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6008420480782289,"acs":4424,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":7363,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.41565386485172584,"acs":3420,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":1.712728134,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":8228,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.746448087431694,"acs":6147,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":1.0808941382,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":8235,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6433566433566433,"acs":5980,"articleLive":2,"columnArticles":92,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.4181180555,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":9295,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8563436202851471,"acs":4745,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":5541,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8831335616438356,"acs":4126,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":4672,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7216763347934178,"acs":6096,"articleLive":2,"columnArticles":102,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":1.3805429075,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":8447,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.35878773416060133,"acs":3007,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":8381,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.6064282673478075,"acs":2849,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.4716067405,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":4698,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6303282340709936,"acs":4244,"articleLive":2,"columnArticles":63,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":6733,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6819740569554197,"acs":4574,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.3929911054,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":6707,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5478060046189377,"acs":3558,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.4181180555,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":6495,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.768363855906621,"acs":3818,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":4969,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7239547239547239,"acs":3134,"articleLive":2,"columnArticles":79,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.4181180555,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":4329,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6202712348322627,"acs":2607,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":4203,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6474722898080563,"acs":2395,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":3699,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6496012348855158,"acs":2525,"articleLive":2,"columnArticles":78,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":3887,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6740315638450503,"acs":2349,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":3485,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.500792532581895,"acs":5687,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":11356,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7210226323313715,"acs":38835,"articleLive":2,"columnArticles":412,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":1.7058163011,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"ac","submitted":53861,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6510286001003512,"acs":5190,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.3688470065,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":7972,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5082644628099173,"acs":2460,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":1.0489221055,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":4840,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4195712843655365,"acs":7066,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 072]求平方根","frequency":1.3199121576,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":16841,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5243273386309772,"acs":3761,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":7173,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5723589001447178,"acs":4746,"articleLive":2,"columnArticles":75,"formTitle":"[剑指 Offer II 074]合并区间","frequency":1.3199121576,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":8292,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.715752929263706,"acs":4948,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.3456225535,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":6913,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6830038212327629,"acs":8222,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":1.6143688138,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":12038,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5864491641766939,"acs":7262,"articleLive":2,"columnArticles":121,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.3929911054,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":12383,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6422273781902552,"acs":5536,"articleLive":2,"columnArticles":95,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":1.5544706722,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":8620,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8546942557134033,"acs":5535,"articleLive":2,"columnArticles":104,"formTitle":"[剑指 Offer II 079]所有子集","frequency":1.3199121576,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":6476,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8236749116607773,"acs":4662,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":5660,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7845757149554617,"acs":6694,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":8532,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6466470154753132,"acs":5265,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.988662914,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":8142,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.860545193687231,"acs":5998,"articleLive":2,"columnArticles":98,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.9063118788,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":6970,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6847841081528486,"acs":4964,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":1.3199121576,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":7249,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.85106998264893,"acs":5886,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":1.5839018723,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":6916,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7480257116620753,"acs":4073,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.988662914,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":5445,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6321663354227183,"acs":4135,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":1.6143688138,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":6541,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.74039136979428,"acs":7378,"articleLive":2,"columnArticles":90,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.9602114928,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"ac","submitted":9965,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6156339608527615,"acs":4938,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.988662914,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":8021,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.4984984984984985,"acs":3154,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":1.0808941382,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":6327,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7732536421367202,"acs":4140,"articleLive":2,"columnArticles":101,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":5354,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6791537267080745,"acs":3499,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":5152,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5724749421742482,"acs":2970,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":5188,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5989505247376312,"acs":2397,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.4716067405,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":4002,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6523702031602708,"acs":9248,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":2.6653530534,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":14176,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.48894018080400076,"acs":2542,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":1.748123795,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":5199,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5473112719751809,"acs":2117,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":1.0489221055,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":3868,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7544144509843719,"acs":3717,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":4927,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.7160175784209729,"acs":4725,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":2.0286164134,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":6599,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.750202922077922,"acs":3697,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":1.0182071603,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":4928,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.48778195488721804,"acs":4152,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":1.114219448,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":8512,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5934570499330399,"acs":3102,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":5227,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.5002432616522331,"acs":5141,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":2.1761588888,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":10277,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5914500850133593,"acs":2435,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.5001312072,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":4117,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6968188440990772,"acs":5739,"articleLive":2,"columnArticles":83,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":1.6143688138,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":8236,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.549154092363969,"acs":2402,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 106]二分图","frequency":1.0489221055,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":4374,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5427491733585262,"acs":2298,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":4234,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5933656354826686,"acs":1592,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":2683,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.5914696813977389,"acs":2302,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":1.4805818301,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":3892,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8187986931389797,"acs":3258,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":3979,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6832844574780058,"acs":1398,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.4716067405,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":2046,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.562605548854041,"acs":2332,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":4145,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.587173860034138,"acs":2408,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":1.114219448,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":4101,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.42437395659432386,"acs":1271,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.5001312072,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":2995,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.30939226519337015,"acs":1568,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.4442975611,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":5068,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6489513822688274,"acs":5446,"articleLive":2,"columnArticles":95,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":8392,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6379025598678778,"acs":1545,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":2422,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6963577353047241,"acs":1931,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":2773,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.48353421277403436,"acs":5095,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":1.4125900849,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":10537,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.716611447503713,"acs":100360,"articleLive":2,"columnArticles":1642,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":3.9239064261,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":140048,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.642123407794915,"acs":64073,"articleLive":2,"columnArticles":1188,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":1.3199121576,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":99783,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5784847952188433,"acs":49365,"articleLive":2,"columnArticles":536,"formTitle":"[面试题 01.03]URL化","frequency":2.0286164134,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":85335,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5489948191666046,"acs":44294,"articleLive":2,"columnArticles":845,"formTitle":"[面试题 01.04]回文排列","frequency":1.7925558035,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":80682,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.32884697970633114,"acs":35990,"articleLive":2,"columnArticles":614,"formTitle":"[面试题 01.05]一次编辑","frequency":1.3805429075,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":109443,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4709353933258163,"acs":78520,"articleLive":2,"columnArticles":1225,"formTitle":"[面试题 01.06]字符串压缩","frequency":3.0064602926,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":166732,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7494521084560575,"acs":70788,"articleLive":2,"columnArticles":1007,"formTitle":"[面试题 01.07]旋转矩阵","frequency":2.9689826731,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":94453,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6227593872570939,"acs":48744,"articleLive":2,"columnArticles":541,"formTitle":"[面试题 01.08]零矩阵","frequency":0.988662914,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":78271,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5489705483375034,"acs":36422,"articleLive":2,"columnArticles":457,"formTitle":"[面试题 01.09]字符串轮转","frequency":1.9650996448,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":66346,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.677982036766618,"acs":67786,"articleLive":2,"columnArticles":726,"formTitle":"[面试题 02.01]移除重复节点","frequency":1.6786996721,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":99982,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7796870413439609,"acs":69060,"articleLive":2,"columnArticles":988,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":2.5805565168,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":88574,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8553675545901452,"acs":74819,"articleLive":2,"columnArticles":716,"formTitle":"[面试题 02.03]删除中间节点","frequency":1.7925558035,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":87470,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6489586265128061,"acs":27669,"articleLive":2,"columnArticles":399,"formTitle":"[面试题 02.04]分割链表","frequency":0.988662914,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":42636,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4673732408279004,"acs":40217,"articleLive":2,"columnArticles":564,"formTitle":"[面试题 02.05]链表求和","frequency":2.7114796006,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":86049,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.48398996772125563,"acs":43033,"articleLive":2,"columnArticles":534,"formTitle":"[面试题 02.06]回文链表","frequency":0.4181180555,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":88913,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6805517146017699,"acs":59061,"articleLive":2,"columnArticles":521,"formTitle":"[面试题 02.07]链表相交","frequency":0.9327824556,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":86784,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5348887254989868,"acs":29827,"articleLive":2,"columnArticles":310,"formTitle":"[面试题 02.08]环路检测","frequency":1.3496762595,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":55763,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5331607756608817,"acs":12565,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 03.01]三合一","frequency":1.0182071603,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":23567,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6137736431374278,"acs":27842,"articleLive":2,"columnArticles":315,"formTitle":"[面试题 03.02]栈的最小值","frequency":1.8554735886,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":45362,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.38792356267283007,"acs":9399,"articleLive":2,"columnArticles":147,"formTitle":"[面试题 03.03]堆盘子","frequency":1.0182071603,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":24229,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.714112197051014,"acs":25281,"articleLive":2,"columnArticles":361,"formTitle":"[面试题 03.04]化栈为队","frequency":1.6459420757,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":35402,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5406994023049235,"acs":16374,"articleLive":2,"columnArticles":226,"formTitle":"[面试题 03.05]栈排序","frequency":1.3805429075,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":30283,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5886926142793879,"acs":11964,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 03.06]动物收容所","frequency":1.0182071603,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":20323,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5311589665405243,"acs":19510,"articleLive":2,"columnArticles":266,"formTitle":"[面试题 04.01]节点间通路","frequency":1.6459420757,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":36731,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7889695956804011,"acs":36822,"articleLive":2,"columnArticles":447,"formTitle":"[面试题 04.02]最小高度树","frequency":2.1761588888,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":46671,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8055790628428146,"acs":25702,"articleLive":2,"columnArticles":567,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":1.8554735886,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":31905,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5876076250460652,"acs":35079,"articleLive":2,"columnArticles":400,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":59698,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3528770706190061,"acs":27523,"articleLive":2,"columnArticles":348,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":1.0182071603,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":77996,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5931968066643527,"acs":22217,"articleLive":2,"columnArticles":269,"formTitle":"[面试题 04.06]后继者","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":37453,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7155633665299747,"acs":18322,"articleLive":2,"columnArticles":194,"formTitle":"[面试题 04.08]首个共同祖先","frequency":1.4125900849,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":25605,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47672436401783375,"acs":7271,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":1.0489221055,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":15252,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7165905139298856,"acs":17722,"articleLive":2,"columnArticles":287,"formTitle":"[面试题 04.10]检查子树","frequency":1.3805429075,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":24731,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48666260966580455,"acs":19193,"articleLive":2,"columnArticles":281,"formTitle":"[面试题 04.12]求和路径","frequency":2.0286164134,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":39438,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5059489262913522,"acs":10461,"articleLive":2,"columnArticles":214,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":20676,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6973618715778994,"acs":8406,"articleLive":2,"columnArticles":141,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.4181180555,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":12054,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3837536786810544,"acs":12127,"articleLive":2,"columnArticles":253,"formTitle":"[面试题 05.03]翻转数位","frequency":1.3496762595,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":31601,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3779035721257076,"acs":5808,"articleLive":2,"columnArticles":147,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":15369,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5309063645451516,"acs":12746,"articleLive":2,"columnArticles":248,"formTitle":"[面试题 05.06]整数转换","frequency":1.0182071603,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":24008,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7059122767352476,"acs":12489,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 05.07]配对交换","frequency":0.988662914,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":17692,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5575418994413408,"acs":3992,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 05.08]绘制直线","frequency":1.0182071603,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":7160,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.3633963014515808,"acs":45688,"articleLive":2,"columnArticles":499,"formTitle":"[面试题 08.01]三步问题","frequency":1.6786996721,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":125725,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3625904273778063,"acs":13583,"articleLive":2,"columnArticles":214,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":37461,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.675649711800991,"acs":53452,"articleLive":2,"columnArticles":443,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":79112,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8214492963876396,"acs":22649,"articleLive":2,"columnArticles":353,"formTitle":"[面试题 08.04]幂集","frequency":1.8886727603,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":27572,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.678396871945259,"acs":24290,"articleLive":2,"columnArticles":538,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":35805,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6535566706021252,"acs":26571,"articleLive":2,"columnArticles":284,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":1.3199121576,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":40656,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8141454944899189,"acs":22976,"articleLive":2,"columnArticles":339,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":1.8234606116,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":28221,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7175047534285367,"acs":17736,"articleLive":2,"columnArticles":259,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.5001312072,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":24719,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8157583761990824,"acs":23471,"articleLive":2,"columnArticles":388,"formTitle":"[面试题 08.09]括号","frequency":2.5486512584,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":28772,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5589527781915686,"acs":15009,"articleLive":2,"columnArticles":238,"formTitle":"[面试题 08.10]颜色填充","frequency":1.0182071603,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":26852,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4949431188542412,"acs":35284,"articleLive":2,"columnArticles":341,"formTitle":"[面试题 08.11]硬币","frequency":1.6459420757,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":71289,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7615310765120842,"acs":18244,"articleLive":2,"columnArticles":312,"formTitle":"[面试题 08.12]八皇后","frequency":2.062116643,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":23957,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5028240989779451,"acs":7478,"articleLive":2,"columnArticles":97,"formTitle":"[面试题 08.13]堆箱子","frequency":1.0808941382,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":14872,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5358226371061844,"acs":4592,"articleLive":2,"columnArticles":81,"formTitle":"[面试题 08.14]布尔运算","frequency":1.4125900849,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":8570,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.556477244130449,"acs":59705,"articleLive":2,"columnArticles":2402,"formTitle":"[面试题 10.01]合并排序的数组","frequency":3.1997834966,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":107291,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7395356509546785,"acs":35866,"articleLive":2,"columnArticles":439,"formTitle":"[面试题 10.02]变位词组","frequency":3.0626548509,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":48498,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3941015162920744,"acs":14659,"articleLive":2,"columnArticles":220,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":2.7114796006,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":37196,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5566171825647505,"acs":21147,"articleLive":2,"columnArticles":277,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.3929911054,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":37992,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4534808067664281,"acs":13940,"articleLive":2,"columnArticles":188,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":1.4125900849,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":30740,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6245932124593212,"acs":5374,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":8604,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6638589923568866,"acs":8512,"articleLive":2,"columnArticles":114,"formTitle":"[面试题 10.11]峰与谷","frequency":1.0489221055,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":12822,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8282148835793639,"acs":27211,"articleLive":2,"columnArticles":435,"formTitle":"[面试题 16.01]交换数字","frequency":1.0182071603,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":32855,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7653328347045625,"acs":16372,"articleLive":2,"columnArticles":215,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":21392,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.4409795551561447,"acs":9814,"articleLive":2,"columnArticles":238,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":22255,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4607215007215007,"acs":7982,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":17325,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46019233801040516,"acs":11676,"articleLive":2,"columnArticles":137,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.988662914,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":25372,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.42477584190481904,"acs":14165,"articleLive":2,"columnArticles":212,"formTitle":"[面试题 16.06]最小差","frequency":2.0286164134,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":33347,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7329590740548221,"acs":21151,"articleLive":2,"columnArticles":317,"formTitle":"[面试题 16.07]最大数值","frequency":1.3805429075,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":28857,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3785896857615396,"acs":2518,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6651,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5452684258416742,"acs":2397,"articleLive":2,"columnArticles":42,"formTitle":"[面试题 16.09]运算","frequency":0.5001312072,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":4396,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.680209147184326,"acs":11318,"articleLive":2,"columnArticles":214,"formTitle":"[面试题 16.10]生存人数","frequency":1.3805429075,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":16639,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4408119639994232,"acs":51966,"articleLive":2,"columnArticles":605,"formTitle":"[面试题 16.11]跳水板","frequency":1.6786996721,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":117887,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4278723820708554,"acs":2186,"articleLive":2,"columnArticles":60,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":5109,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.553083638411715,"acs":3928,"articleLive":2,"columnArticles":68,"formTitle":"[面试题 16.14]最佳直线","frequency":1.3805429075,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":7102,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5030027024321889,"acs":10051,"articleLive":2,"columnArticles":255,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.5299663557,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":19982,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4570702841511751,"acs":16375,"articleLive":2,"columnArticles":231,"formTitle":"[面试题 16.16]部分排序","frequency":1.3805429075,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":35826,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.5969842357779301,"acs":36582,"articleLive":2,"columnArticles":396,"formTitle":"[面试题 16.17]连续数列","frequency":1.7925558035,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":61278,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3437866808406972,"acs":15523,"articleLive":2,"columnArticles":319,"formTitle":"[面试题 16.18]模式匹配","frequency":0.4716067405,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":45153,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6149151959660784,"acs":21463,"articleLive":2,"columnArticles":388,"formTitle":"[面试题 16.19]水域大小","frequency":1.8554735886,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":34904,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7203940004477278,"acs":9654,"articleLive":2,"columnArticles":189,"formTitle":"[面试题 16.20]T9键盘","frequency":1.0182071603,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":13401,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4654452377744847,"acs":10365,"articleLive":2,"columnArticles":196,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":22269,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5860519632740769,"acs":3000,"articleLive":2,"columnArticles":63,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":5119,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47320493190426305,"acs":11744,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 16.24]数对和","frequency":0.4442975611,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":24818,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5455972621234242,"acs":34754,"articleLive":2,"columnArticles":278,"formTitle":"[面试题 16.25]LRU 缓存","frequency":3.9690608235,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":63699,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3904670552645171,"acs":15876,"articleLive":2,"columnArticles":222,"formTitle":"[面试题 16.26]计算器","frequency":2.4878976863,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":40659,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5976192583414461,"acs":13505,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 17.01]不用加号的加法","frequency":1.3805429075,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":22598,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6387223892979363,"acs":30796,"articleLive":2,"columnArticles":491,"formTitle":"[面试题 17.04]消失的数字","frequency":1.3496762595,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":48215,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.39012012590736816,"acs":6073,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":15567,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.4539249146757679,"acs":5054,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.06]2出现的次数","frequency":1.0808941382,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":11134,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.410295029680163,"acs":9262,"articleLive":2,"columnArticles":222,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.4716067405,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":22574,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.2725283530571992,"acs":8843,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 17.08]马戏团人塔","frequency":1.4125900849,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":32448,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5490726708522768,"acs":15217,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 17.09]第 k 个数","frequency":1.8554735886,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":27714,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5699676804508162,"acs":68778,"articleLive":2,"columnArticles":952,"formTitle":"[面试题 17.10]主要元素","frequency":2.8836066195,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":120670,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6851818830242511,"acs":15370,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 17.11]单词距离","frequency":1.0489221055,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":22432,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6313548569011702,"acs":22391,"articleLive":2,"columnArticles":309,"formTitle":"[面试题 17.12]BiNode","frequency":1.0182071603,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":35465,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5519783031867195,"acs":25237,"articleLive":2,"columnArticles":277,"formTitle":"[面试题 17.13]恢复空格","frequency":1.0808941382,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":45721,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5963186570460904,"acs":80992,"articleLive":2,"columnArticles":801,"formTitle":"[面试题 17.14]最小K个数","frequency":3.6677255782,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":135820,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40410456877595896,"acs":6616,"articleLive":2,"columnArticles":129,"formTitle":"[面试题 17.15]最长单词","frequency":1.8554735886,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":16372,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.517024804188208,"acs":63304,"articleLive":2,"columnArticles":1170,"formTitle":"[面试题 17.16]按摩师","frequency":1.748123795,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":122439,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4484651351900793,"acs":8824,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 17.17]多次搜索","frequency":0.4442975611,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":19676,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4425888439046334,"acs":7871,"articleLive":2,"columnArticles":134,"formTitle":"[面试题 17.18]最短超串","frequency":1.6786996721,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":17784,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5780575095643589,"acs":9368,"articleLive":2,"columnArticles":197,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.4181180555,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":16206,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5745526838966203,"acs":4335,"articleLive":2,"columnArticles":76,"formTitle":"[面试题 17.20]连续中值","frequency":0.5001312072,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":7545,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6361653934354732,"acs":45218,"articleLive":2,"columnArticles":543,"formTitle":"[面试题 17.21]直方图的水量","frequency":2.5208278926,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":71079,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3815624017604527,"acs":9710,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 17.22]单词转换","frequency":0.988662914,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":25448,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.37635216346153844,"acs":5010,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 17.23]最大黑方阵","frequency":1.4125900849,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":13312,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5224493214943877,"acs":12474,"articleLive":2,"columnArticles":132,"formTitle":"[面试题 17.24]最大子矩阵","frequency":3.85210526,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":23876,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5053131991051454,"acs":1807,"articleLive":2,"columnArticles":40,"formTitle":"[面试题 17.25]单词矩阵","frequency":0.594008722,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3576,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3461331419343262,"acs":3858,"articleLive":2,"columnArticles":59,"formTitle":"[面试题 17.26]稀疏相似度","frequency":1.0489221055,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":11146,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}]
\ No newline at end of file
+[{"acceptance":0.6265001124445444,"acs":30644,"articleLive":2,"columnArticles":449,"formTitle":"[1185]一周中的第几天","frequency":0.7526696758,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"notac","submitted":48913,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.5223762023881662,"acs":2824135,"articleLive":2,"columnArticles":15425,"formTitle":"[1]两数之和","frequency":4.7477890979,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":5406324,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.41179780376667807,"acs":1116836,"articleLive":2,"columnArticles":7932,"formTitle":"[2]两数相加","frequency":4.7100487699,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2712098,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.38325345549953904,"acs":1404773,"articleLive":2,"columnArticles":8391,"formTitle":"[3]无重复字符的最长子串","frequency":4.612902019,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3665389,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4107827494721114,"acs":579536,"articleLive":2,"columnArticles":4326,"formTitle":"[4]寻找两个正序数组的中位数","frequency":4.575161691,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1410809,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3594993627608333,"acs":830995,"articleLive":2,"columnArticles":4512,"formTitle":"[5]最长回文子串","frequency":4.537421363,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2311534,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5096765747287986,"acs":338702,"articleLive":2,"columnArticles":2750,"formTitle":"[6]Z 字形变换","frequency":3.7760734279,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":664543,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35089577208693407,"acs":920141,"articleLive":2,"columnArticles":5723,"formTitle":"[7]整数反转","frequency":4.650642347,"frontendQuestionId":"7","leaf":true,"level":2,"nodeType":"def","questionId":"7","status":"ac","submitted":2622263,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21745251496541784,"acs":384291,"articleLive":2,"columnArticles":2944,"formTitle":"[8]字符串转换整数 (atoi)","frequency":3.8183094352,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1767241,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5804888104130559,"acs":856084,"articleLive":2,"columnArticles":5424,"formTitle":"[9]回文数","frequency":3.8488554875,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1474764,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3161514230758509,"acs":226826,"articleLive":2,"columnArticles":1365,"formTitle":"[10]正则表达式匹配","frequency":4.2681586872,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":717460,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6220933673792566,"acs":599084,"articleLive":2,"columnArticles":3404,"formTitle":"[11]盛最多水的容器","frequency":4.2058190683,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":963013,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6640093196891672,"acs":250793,"articleLive":2,"columnArticles":1961,"formTitle":"[12]整数转罗马数字","frequency":3.4748650588,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":377695,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6295664053305768,"acs":518905,"articleLive":2,"columnArticles":4251,"formTitle":"[13]罗马数字转整数","frequency":4.2108236941,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":824226,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.414874597986259,"acs":694788,"articleLive":2,"columnArticles":4335,"formTitle":"[14]最长公共前缀","frequency":4.499681035,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"ac","submitted":1674694,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3417662158384485,"acs":750656,"articleLive":2,"columnArticles":3519,"formTitle":"[15]三数之和","frequency":4.4047448498,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":2196402,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4582796371400776,"acs":290179,"articleLive":2,"columnArticles":1593,"formTitle":"[16]最接近的三数之和","frequency":4.1377579778,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":633192,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5751405722760524,"acs":384696,"articleLive":2,"columnArticles":3468,"formTitle":"[17]电话号码的字母组合","frequency":3.578127912,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":668873,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.39467800137256204,"acs":249592,"articleLive":2,"columnArticles":1719,"formTitle":"[18]四数之和","frequency":3.4469939869,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"ac","submitted":632394,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.4329813032150685,"acs":605097,"articleLive":2,"columnArticles":4491,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":3.5489488492,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1397513,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44551016983081626,"acs":881310,"articleLive":2,"columnArticles":6219,"formTitle":"[20]有效的括号","frequency":4.3443011396,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1978204,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.666820218602119,"acs":812073,"articleLive":2,"columnArticles":3933,"formTitle":"[21]合并两个有序链表","frequency":4.0601794766,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1217829,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7729435086162295,"acs":398886,"articleLive":2,"columnArticles":2972,"formTitle":"[22]括号生成","frequency":4.3329185533,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":516061,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5622566605803139,"acs":367672,"articleLive":2,"columnArticles":2367,"formTitle":"[23]合并K个升序链表","frequency":3.8570268028,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":653922,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7046505561220859,"acs":356556,"articleLive":2,"columnArticles":2812,"formTitle":"[24]两两交换链表中的节点","frequency":2.9490197624,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":506004,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6587944276763492,"acs":258868,"articleLive":2,"columnArticles":2442,"formTitle":"[25]K 个一组翻转链表","frequency":4.146541682,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":392942,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5363868041429941,"acs":917672,"articleLive":2,"columnArticles":5039,"formTitle":"[26]删除有序数组中的重复项","frequency":3.7168319446,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1710840,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5958276114521376,"acs":550161,"articleLive":2,"columnArticles":4581,"formTitle":"[27]移除元素","frequency":3.4192430584,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":923356,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40324292183140464,"acs":528966,"articleLive":2,"columnArticles":3592,"formTitle":"[28]实现 strStr()","frequency":3.2183579432,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1311780,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.22051525130037072,"acs":140496,"articleLive":2,"columnArticles":1107,"formTitle":"[29]两数相除","frequency":3.375746596,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"ac","submitted":637126,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.36249821352008005,"acs":88774,"articleLive":2,"columnArticles":680,"formTitle":"[30]串联所有单词的子串","frequency":2.750126737,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":244895,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3726992151816222,"acs":243569,"articleLive":2,"columnArticles":1967,"formTitle":"[31]下一个排列","frequency":3.6497879988,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":653527,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.35783600112704783,"acs":213359,"articleLive":2,"columnArticles":1438,"formTitle":"[32]最长有效括号","frequency":3.6748855182,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":596248,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4304481085603518,"acs":417251,"articleLive":2,"columnArticles":2764,"formTitle":"[33]搜索旋转排序数组","frequency":3.5331056787,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":969341,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.42282411831052835,"acs":402244,"articleLive":2,"columnArticles":3790,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":3.4942809268,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":951327,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.45889872403294113,"acs":607553,"articleLive":2,"columnArticles":4518,"formTitle":"[35]搜索插入位置","frequency":3.2870038298,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1323937,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6376471368047769,"acs":230878,"articleLive":2,"columnArticles":1639,"formTitle":"[36]有效的数独","frequency":3.3346327864,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":362078,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6702089453821835,"acs":113837,"articleLive":2,"columnArticles":961,"formTitle":"[37]解数独","frequency":2.9654128043,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":169853,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5972251158152481,"acs":255128,"articleLive":2,"columnArticles":2685,"formTitle":"[38]外观数列","frequency":2.2775886463,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"ac","submitted":427189,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.727474214911667,"acs":384684,"articleLive":2,"columnArticles":2242,"formTitle":"[39]组合总和","frequency":3.7297728493,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":528794,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6151857712650655,"acs":227038,"articleLive":2,"columnArticles":1546,"formTitle":"[40]组合总和 II","frequency":3.1325788523,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":369056,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4202579905469464,"acs":182542,"articleLive":2,"columnArticles":1549,"formTitle":"[41]缺失的第一个正数","frequency":4.1179238367,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":434357,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5912368486139914,"acs":372912,"articleLive":2,"columnArticles":2727,"formTitle":"[42]接雨水","frequency":4.3670045218,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":630732,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.449658462435648,"acs":188138,"articleLive":2,"columnArticles":1272,"formTitle":"[43]字符串相乘","frequency":3.8711678812,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":418402,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.3287550403225806,"acs":91315,"articleLive":2,"columnArticles":597,"formTitle":"[44]通配符匹配","frequency":2.9225172248,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":277760,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4359692907908231,"acs":243161,"articleLive":2,"columnArticles":1909,"formTitle":"[45]跳跃游戏 II","frequency":3.6093330441,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":557748,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7843497943594812,"acs":480968,"articleLive":2,"columnArticles":3088,"formTitle":"[46]全排列","frequency":3.9248634071,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":613206,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6415014772682901,"acs":246436,"articleLive":2,"columnArticles":1679,"formTitle":"[47]全排列 II","frequency":3.1745225135,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":384155,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7365095504393928,"acs":253525,"articleLive":2,"columnArticles":2112,"formTitle":"[48]旋转图像","frequency":3.2567095947,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":344225,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6676873336840546,"acs":261449,"articleLive":2,"columnArticles":1494,"formTitle":"[49]字母异位词分组","frequency":2.8196516934,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":391574,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3775097235362136,"acs":244205,"articleLive":2,"columnArticles":1445,"formTitle":"[50]Pow(x, n)","frequency":3.4559465982,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":646884,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7381497010870731,"acs":171997,"articleLive":2,"columnArticles":1700,"formTitle":"[51]N 皇后","frequency":3.632245741,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":233011,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8221458611139604,"acs":80151,"articleLive":2,"columnArticles":655,"formTitle":"[52]N皇后 II","frequency":0.3843222307,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":97490,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5526428777364403,"acs":799320,"articleLive":2,"columnArticles":4249,"formTitle":"[53]最大子数组和","frequency":4.0285258009,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1446359,"title":"最大子数组和","titleSlug":"maximum-subarray"},{"acceptance":0.48310836381985617,"acs":210628,"articleLive":2,"columnArticles":2225,"formTitle":"[54]螺旋矩阵","frequency":3.8183094352,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":435985,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4343633028361783,"acs":380044,"articleLive":2,"columnArticles":2889,"formTitle":"[55]跳跃游戏","frequency":3.2642612459,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":874945,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4747510541076417,"acs":344317,"articleLive":2,"columnArticles":2625,"formTitle":"[56]合并区间","frequency":4.1625669902,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":725258,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.413234342480368,"acs":94510,"articleLive":2,"columnArticles":998,"formTitle":"[57]插入区间","frequency":1.6449038473,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":228708,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.38607170434498345,"acs":273992,"articleLive":2,"columnArticles":2929,"formTitle":"[58]最后一个单词的长度","frequency":2.7076878266,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":709692,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7813583531123395,"acs":147154,"articleLive":2,"columnArticles":1787,"formTitle":"[59]螺旋矩阵 II","frequency":3.5635772624,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":188331,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5266246205696533,"acs":95941,"articleLive":2,"columnArticles":1030,"formTitle":"[60]排列序列","frequency":1.93130382,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":182181,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4175710463883701,"acs":215085,"articleLive":2,"columnArticles":2195,"formTitle":"[61]旋转链表","frequency":2.3617000696,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":515086,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6655857807948299,"acs":351404,"articleLive":2,"columnArticles":2676,"formTitle":"[62]不同路径","frequency":3.0563805429,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":527962,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3958303481874194,"acs":204425,"articleLive":2,"columnArticles":1923,"formTitle":"[63]不同路径 II","frequency":2.5514075405,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":516446,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6895945358124554,"acs":298040,"articleLive":2,"columnArticles":2293,"formTitle":"[64]最小路径和","frequency":3.6470982344,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":432196,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2712208001679215,"acs":49101,"articleLive":2,"columnArticles":684,"formTitle":"[65]有效数字","frequency":1.9948205886,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":181037,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.46255287247561877,"acs":418942,"articleLive":2,"columnArticles":3802,"formTitle":"[66]加一","frequency":2.7344757406,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":905717,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5408883596006689,"acs":213467,"articleLive":2,"columnArticles":1937,"formTitle":"[67]二进制求和","frequency":2.9577671175,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":394660,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5221423905943827,"acs":39970,"articleLive":2,"columnArticles":612,"formTitle":"[68]文本左右对齐","frequency":3.3806038039,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":76550,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39066525627394805,"acs":433213,"articleLive":2,"columnArticles":2194,"formTitle":"[69]Sqrt(x)","frequency":3.4559465982,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1108911,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5327747542847859,"acs":655899,"articleLive":2,"columnArticles":3973,"formTitle":"[70]爬楼梯","frequency":4.3031885385,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1231100,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42230793612896056,"acs":102590,"articleLive":2,"columnArticles":931,"formTitle":"[71]简化路径","frequency":3.1763878725,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":242927,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6155345522156802,"acs":198633,"articleLive":2,"columnArticles":1379,"formTitle":"[72]编辑距离","frequency":4.069527752,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":322700,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6094393118057849,"acs":151325,"articleLive":2,"columnArticles":1121,"formTitle":"[73]矩阵置零","frequency":2.6714031371,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":248302,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.46607987779434407,"acs":191000,"articleLive":2,"columnArticles":1911,"formTitle":"[74]搜索二维矩阵","frequency":2.5773801353,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":409801,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5998256817160144,"acs":305559,"articleLive":2,"columnArticles":2104,"formTitle":"[75]颜色分类","frequency":2.4929643388,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":509413,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4309053205237375,"acs":215067,"articleLive":2,"columnArticles":1484,"formTitle":"[76]最小覆盖子串","frequency":3.2810837867,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":499105,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7688217026103993,"acs":258208,"articleLive":2,"columnArticles":1526,"formTitle":"[77]组合","frequency":3.0690250678,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":335849,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8024133592588356,"acs":350775,"articleLive":2,"columnArticles":2300,"formTitle":"[78]子集","frequency":3.1923337828,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":437150,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4599467172730922,"acs":252060,"articleLive":2,"columnArticles":1589,"formTitle":"[79]单词搜索","frequency":2.666628035,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":548020,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6181901514033357,"acs":159158,"articleLive":2,"columnArticles":1416,"formTitle":"[80]删除有序数组中的重复项 II","frequency":2.6139820838,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":257458,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.414273136942724,"acs":135046,"articleLive":2,"columnArticles":1068,"formTitle":"[81]搜索旋转排序数组 II","frequency":2.2311010755,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":325983,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5316865144057841,"acs":205466,"articleLive":2,"columnArticles":1875,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":3.352762362,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":386442,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5374716124148372,"acs":354290,"articleLive":2,"columnArticles":2211,"formTitle":"[83]删除排序链表中的重复元素","frequency":2.7822175035,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":659179,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4348223345888585,"acs":202255,"articleLive":2,"columnArticles":1285,"formTitle":"[84]柱状图中最大的矩形","frequency":3.5331056787,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":465144,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5188462909612958,"acs":107699,"articleLive":2,"columnArticles":760,"formTitle":"[85]最大矩形","frequency":2.4541018615,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":207574,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6329348702162577,"acs":130358,"articleLive":2,"columnArticles":1221,"formTitle":"[86]分隔链表","frequency":2.2311010755,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":205958,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.4848655700008844,"acs":43859,"articleLive":2,"columnArticles":331,"formTitle":"[87]扰乱字符串","frequency":0.4105017363,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":90456,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5194017515823777,"acs":530438,"articleLive":2,"columnArticles":3678,"formTitle":"[88]合并两个有序数组","frequency":4.2304183592,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":1021248,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7129279453112078,"acs":64659,"articleLive":2,"columnArticles":535,"formTitle":"[89]格雷编码","frequency":2.4188123845,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":90695,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6337287244663035,"acs":155524,"articleLive":2,"columnArticles":1353,"formTitle":"[90]子集 II","frequency":2.4839905179,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":245411,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3141449806024149,"acs":180170,"articleLive":2,"columnArticles":1647,"formTitle":"[91]解码方法","frequency":3.1055903029,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":573525,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.549864991305115,"acs":236834,"articleLive":2,"columnArticles":2218,"formTitle":"[92]反转链表 II","frequency":3.8406168514,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":430713,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5479156834985056,"acs":174155,"articleLive":2,"columnArticles":1506,"formTitle":"[93]复原 IP 地址","frequency":3.7886820275,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":317850,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7556865072536549,"acs":645552,"articleLive":2,"columnArticles":2639,"formTitle":"[94]二叉树的中序遍历","frequency":2.9742255046,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":854259,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7078589191988288,"acs":110724,"articleLive":2,"columnArticles":687,"formTitle":"[95]不同的二叉搜索树 II","frequency":2.9589703133,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":156421,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6996726585735396,"acs":187026,"articleLive":2,"columnArticles":1468,"formTitle":"[96]不同的二叉搜索树","frequency":3.3374434349,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":267305,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.454415530280474,"acs":68679,"articleLive":2,"columnArticles":592,"formTitle":"[97]交错字符串","frequency":2.0186233023,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":151137,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.35295251033300923,"acs":397511,"articleLive":2,"columnArticles":2193,"formTitle":"[98]验证二叉搜索树","frequency":3.1806650389,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1126245,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6080521106606248,"acs":81586,"articleLive":2,"columnArticles":668,"formTitle":"[99]恢复二叉搜索树","frequency":1.9625075996,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":134176,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.5992958770736548,"acs":280190,"articleLive":2,"columnArticles":2074,"formTitle":"[100]相同的树","frequency":2.4541018615,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":467532,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5675330301849836,"acs":467658,"articleLive":2,"columnArticles":2546,"formTitle":"[101]对称二叉树","frequency":3.1942031518,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"ac","submitted":824019,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6424588872168473,"acs":451691,"articleLive":2,"columnArticles":2826,"formTitle":"[102]二叉树的层序遍历","frequency":4.1461234479,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":703066,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5719038007351679,"acs":193236,"articleLive":2,"columnArticles":1731,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":3.4579011235,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":337882,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7672692106431036,"acs":579177,"articleLive":2,"columnArticles":2848,"formTitle":"[104]二叉树的最大深度","frequency":3.3806038039,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"ac","submitted":754855,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.706471335915638,"acs":281242,"articleLive":2,"columnArticles":1605,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":3.1425819366,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":398094,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7216747827747542,"acs":151162,"articleLive":2,"columnArticles":1005,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":3.3806038039,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":209460,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.7020875936614214,"acs":177843,"articleLive":2,"columnArticles":1441,"formTitle":"[107]二叉树的层序遍历 II","frequency":2.3970250303,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":253306,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7623155918373175,"acs":213565,"articleLive":2,"columnArticles":1316,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":2.5686434032,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":280153,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7621696076241531,"acs":102367,"articleLive":2,"columnArticles":798,"formTitle":"[109]有序链表转换二叉搜索树","frequency":2.5386831036,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":134310,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5647766991818135,"acs":287294,"articleLive":2,"columnArticles":1625,"formTitle":"[110]平衡二叉树","frequency":2.7968323051,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":508686,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4915265609723367,"acs":307674,"articleLive":2,"columnArticles":2020,"formTitle":"[111]二叉树的最小深度","frequency":2.2440734451,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":625956,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5274075223489453,"acs":305899,"articleLive":2,"columnArticles":1915,"formTitle":"[112]路径总和","frequency":3.1448189072,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"ac","submitted":580005,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6284653095759506,"acs":202034,"articleLive":2,"columnArticles":1420,"formTitle":"[113]路径总和 II","frequency":2.604082973,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":321472,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7269062295459287,"acs":202125,"articleLive":2,"columnArticles":1518,"formTitle":"[114]二叉树展开为链表","frequency":2.1760816999,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":278062,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5206335279702297,"acs":68834,"articleLive":2,"columnArticles":739,"formTitle":"[115]不同的子序列","frequency":2.7904109127,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":132212,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7076275482424684,"acs":188449,"articleLive":2,"columnArticles":1431,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":2.5386831036,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":266311,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6226390267826171,"acs":104104,"articleLive":2,"columnArticles":884,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":1.257384228,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":167198,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7377765173000567,"acs":247133,"articleLive":2,"columnArticles":1987,"formTitle":"[118]杨辉三角","frequency":3.1109282989,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":334970,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6743043320074728,"acs":164949,"articleLive":2,"columnArticles":1363,"formTitle":"[119]杨辉三角 II","frequency":2.0114171027,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":244621,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6831177343130153,"acs":198029,"articleLive":2,"columnArticles":1740,"formTitle":"[120]三角形最小路径和","frequency":2.1465112426,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":289890,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5738936587326154,"acs":634071,"articleLive":2,"columnArticles":3823,"formTitle":"[121]买卖股票的最佳时机","frequency":4.1776987334,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":1104858,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6924625631493027,"acs":520038,"articleLive":2,"columnArticles":2937,"formTitle":"[122]买卖股票的最佳时机 II","frequency":2.8304002473,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":750998,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5422262818994779,"acs":144249,"articleLive":2,"columnArticles":900,"formTitle":"[123]买卖股票的最佳时机 III","frequency":3.100281519,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":266031,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.44631803628601924,"acs":179826,"articleLive":2,"columnArticles":1222,"formTitle":"[124]二叉树中的最大路径和","frequency":3.9516857289,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":402910,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47148583534421795,"acs":307347,"articleLive":2,"columnArticles":2026,"formTitle":"[125]验证回文串","frequency":2.8229563345,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":651869,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3987885156838641,"acs":40225,"articleLive":2,"columnArticles":362,"formTitle":"[126]单词接龙 II","frequency":1.8548769354,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":100868,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.47148256557446927,"acs":132728,"articleLive":2,"columnArticles":713,"formTitle":"[127]单词接龙","frequency":1.5501060475,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":281512,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5453440948991172,"acs":197498,"articleLive":2,"columnArticles":1311,"formTitle":"[128]最长连续序列","frequency":3.8868059056,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":362153,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.686657241999743,"acs":133572,"articleLive":2,"columnArticles":1241,"formTitle":"[129]求根节点到叶节点数字之和","frequency":2.7822175035,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":194525,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.4492846439385932,"acs":144516,"articleLive":2,"columnArticles":1307,"formTitle":"[130]被围绕的区域","frequency":2.3047938061,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":321658,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7236193958052722,"acs":150426,"articleLive":2,"columnArticles":999,"formTitle":"[131]分割回文串","frequency":2.8498107946,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":207880,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49299216358172065,"acs":52656,"articleLive":2,"columnArticles":470,"formTitle":"[132]分割回文串 II","frequency":2.1760816999,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":106809,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6781134201943273,"acs":79422,"articleLive":2,"columnArticles":564,"formTitle":"[133]克隆图","frequency":1.5206748473,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":117122,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5656480480286623,"acs":140197,"articleLive":2,"columnArticles":1060,"formTitle":"[134]加油站","frequency":3.4250481566,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":247852,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4866518087939491,"acs":112018,"articleLive":2,"columnArticles":902,"formTitle":"[135]分发糖果","frequency":4.1500138676,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":230181,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7193034230979609,"acs":565466,"articleLive":2,"columnArticles":2571,"formTitle":"[136]只出现一次的数字","frequency":3.9417366755,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":786130,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7203876406358899,"acs":108530,"articleLive":2,"columnArticles":816,"formTitle":"[137]只出现一次的数字 II","frequency":2.1423630639,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":150655,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6637270245872304,"acs":124257,"articleLive":2,"columnArticles":936,"formTitle":"[138]复制带随机指针的链表","frequency":3.1325788523,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":187211,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5198938745760903,"acs":223976,"articleLive":2,"columnArticles":1402,"formTitle":"[139]单词拆分","frequency":3.4044267434,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":430811,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.5044556507322465,"acs":58420,"articleLive":2,"columnArticles":621,"formTitle":"[140]单词拆分 II","frequency":1.257384228,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":115808,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5132249962432647,"acs":597689,"articleLive":2,"columnArticles":3066,"formTitle":"[141]环形链表","frequency":3.2487185022,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1164575,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5548605864393449,"acs":340028,"articleLive":2,"columnArticles":1971,"formTitle":"[142]环形链表 II","frequency":2.9808881983,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":612817,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6262739520435587,"acs":143547,"articleLive":2,"columnArticles":1206,"formTitle":"[143]重排链表","frequency":3.8462735083,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":229208,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7051023125417014,"acs":471320,"articleLive":2,"columnArticles":2089,"formTitle":"[144]二叉树的前序遍历","frequency":1.9251898366,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":668442,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7526236063455477,"acs":344813,"articleLive":2,"columnArticles":1760,"formTitle":"[145]二叉树的后序遍历","frequency":3.2265446447,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":458148,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5242786908884047,"acs":265425,"articleLive":2,"columnArticles":1552,"formTitle":"[146]LRU 缓存","frequency":4.1653635104,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":506267,"title":"LRU 缓存","titleSlug":"lru-cache"},{"acceptance":0.6840315949341349,"acs":107644,"articleLive":2,"columnArticles":832,"formTitle":"[147]对链表进行插入排序","frequency":2.2895820738,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":157367,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.66633926080297,"acs":234049,"articleLive":2,"columnArticles":1385,"formTitle":"[148]排序链表","frequency":3.2658833589,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":351246,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3516932977040955,"acs":51592,"articleLive":2,"columnArticles":553,"formTitle":"[149]直线上最多的点数","frequency":2.5148554335,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":146696,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5347035613148692,"acs":147845,"articleLive":2,"columnArticles":1163,"formTitle":"[150]逆波兰表达式求值","frequency":2.4839905179,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":276499,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.49087871053851523,"acs":192718,"articleLive":2,"columnArticles":1587,"formTitle":"[151]翻转字符串里的单词","frequency":2.4814633495,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":392598,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42313337244449495,"acs":208441,"articleLive":2,"columnArticles":1383,"formTitle":"[152]乘积最大子数组","frequency":3.734226318,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":492613,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5681054617210954,"acs":235211,"articleLive":2,"columnArticles":1652,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":1.3389229288,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":414027,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5308066961822376,"acs":122171,"articleLive":2,"columnArticles":964,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":1.6449038473,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":230161,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5755656731891571,"acs":317558,"articleLive":2,"columnArticles":1751,"formTitle":"[155]最小栈","frequency":3.2152705681,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":551732,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7227779915352058,"acs":7514,"articleLive":2,"columnArticles":140,"formTitle":"[156]上下翻转二叉树","frequency":0.4105017363,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"","submitted":10396,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5355224397851326,"acs":6181,"articleLive":2,"columnArticles":88,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"","submitted":11542,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5964681570542927,"acs":3175,"articleLive":2,"columnArticles":74,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.0,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"","submitted":5323,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5500440180929541,"acs":18119,"articleLive":2,"columnArticles":215,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":1.3158804347,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"ac","submitted":32941,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6187873877854975,"acs":378076,"articleLive":2,"columnArticles":2189,"formTitle":"[160]相交链表","frequency":2.6122422872,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":610995,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33778205282353413,"acs":8428,"articleLive":2,"columnArticles":116,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.4105017363,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"","submitted":24951,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.496389148223406,"acs":180775,"articleLive":2,"columnArticles":1212,"formTitle":"[162]寻找峰值","frequency":3.3317399355,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":364180,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3336197295147176,"acs":10484,"articleLive":2,"columnArticles":158,"formTitle":"[163]缺失的区间","frequency":1.3787942601,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"","submitted":31425,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6088315296024075,"acs":63120,"articleLive":2,"columnArticles":531,"formTitle":"[164]最大间距","frequency":2.4222824414,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":103674,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5211801613886357,"acs":93199,"articleLive":2,"columnArticles":966,"formTitle":"[165]比较版本号","frequency":3.6907132844,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":178823,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.33132494228047965,"acs":44487,"articleLive":2,"columnArticles":398,"formTitle":"[166]分数到小数","frequency":2.8498107946,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":134270,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5873567306795775,"acs":340170,"articleLive":2,"columnArticles":2234,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":3.262919252,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":579154,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43402580155568204,"acs":91510,"articleLive":2,"columnArticles":812,"formTitle":"[168]Excel表列名称","frequency":1.9948205886,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":210840,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6653069287981985,"acs":431065,"articleLive":2,"columnArticles":2402,"formTitle":"[169]多数元素","frequency":3.1325788523,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":647919,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.4235369774919614,"acs":9879,"articleLive":2,"columnArticles":101,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.9844113355,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"ac","submitted":23325,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7174092151747038,"acs":114939,"articleLive":2,"columnArticles":982,"formTitle":"[171]Excel 表列序号","frequency":2.6315572286,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":160214,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4459593455627169,"acs":97146,"articleLive":2,"columnArticles":634,"formTitle":"[172]阶乘后的零","frequency":2.5686434032,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":217836,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8059050294354959,"acs":80904,"articleLive":2,"columnArticles":681,"formTitle":"[173]二叉搜索树迭代器","frequency":1.6449038473,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":100389,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4804969932377097,"acs":41070,"articleLive":2,"columnArticles":435,"formTitle":"[174]地下城游戏","frequency":2.6494628099,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":85474,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.736189255197366,"acs":332480,"articleLive":2,"columnArticles":1572,"formTitle":"[175]组合两个表","frequency":4.4424851778,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":451623,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3543121753702991,"acs":272313,"articleLive":2,"columnArticles":1103,"formTitle":"[176]第二高的薪水","frequency":4.0686411957,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":768568,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4631606111335349,"acs":139994,"articleLive":2,"columnArticles":547,"formTitle":"[177]第N高的薪水","frequency":3.5026433782,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":302258,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6037781958354083,"acs":130945,"articleLive":2,"columnArticles":710,"formTitle":"[178]分数排名","frequency":2.6776837758,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":216876,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.40978699446373273,"acs":131013,"articleLive":2,"columnArticles":1043,"formTitle":"[179]最大数","frequency":3.3124343166,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":319710,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48485814633751356,"acs":95807,"articleLive":2,"columnArticles":553,"formTitle":"[180]连续出现的数字","frequency":3.4692270059,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":197598,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.6964619399873365,"acs":180392,"articleLive":2,"columnArticles":728,"formTitle":"[181]超过经理收入的员工","frequency":3.2586372504,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":259012,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7943484328685363,"acs":197506,"articleLive":2,"columnArticles":643,"formTitle":"[182]查找重复的电子邮箱","frequency":3.0573780691,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":248639,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6740677390446806,"acs":164728,"articleLive":2,"columnArticles":598,"formTitle":"[183]从不订购的客户","frequency":2.8154195098,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":244379,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.4826037533512064,"acs":112507,"articleLive":2,"columnArticles":732,"formTitle":"[184]部门工资最高的员工","frequency":2.9966155021,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":233125,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.5015990064925455,"acs":77953,"articleLive":2,"columnArticles":686,"formTitle":"[185]部门工资前三高的所有员工","frequency":3.5655760638,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":155409,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7585398828301037,"acs":8416,"articleLive":2,"columnArticles":129,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.9844113355,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"","submitted":11095,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5234006989819177,"acs":82668,"articleLive":2,"columnArticles":604,"formTitle":"[187]重复的DNA序列","frequency":3.2890140424,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":157944,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3989163589661262,"acs":99394,"articleLive":2,"columnArticles":775,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":2.9351868483,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":249160,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4463203511429972,"acs":400635,"articleLive":2,"columnArticles":2008,"formTitle":"[189]轮转数组","frequency":3.7058736514,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":897640,"title":"轮转数组","titleSlug":"rotate-array"},{"acceptance":0.7022421611471658,"acs":145105,"articleLive":2,"columnArticles":910,"formTitle":"[190]颠倒二进制位","frequency":1.8436735917,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":206631,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7510771789250889,"acs":208656,"articleLive":2,"columnArticles":1317,"formTitle":"[191]位1的个数","frequency":1.2861163328,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":277809,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3573539194603877,"acs":23099,"articleLive":2,"columnArticles":181,"formTitle":"[192]统计词频","frequency":2.0784114172,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":64639,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3270509847316562,"acs":27782,"articleLive":2,"columnArticles":148,"formTitle":"[193]有效电话号码","frequency":1.6121462508,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":84947,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34699059561128526,"acs":11069,"articleLive":2,"columnArticles":75,"formTitle":"[194]转置文件","frequency":1.3467470827,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":31900,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.43798489707251476,"acs":38106,"articleLive":2,"columnArticles":152,"formTitle":"[195]第十行","frequency":1.9011386532,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":87003,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6645265040143051,"acs":110746,"articleLive":2,"columnArticles":433,"formTitle":"[196]删除重复的电子邮箱","frequency":2.913123074,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":166654,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5331959187880038,"acs":103472,"articleLive":2,"columnArticles":563,"formTitle":"[197]上升的温度","frequency":3.0622139803,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":194060,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5212566275326642,"acs":440441,"articleLive":2,"columnArticles":3018,"formTitle":"[198]打家劫舍","frequency":3.6629172903,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":844960,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6529171039678472,"acs":160504,"articleLive":2,"columnArticles":1773,"formTitle":"[199]二叉树的右视图","frequency":2.7995489598,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":245826,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5642712718353277,"acs":374517,"articleLive":2,"columnArticles":2355,"formTitle":"[200]岛屿数量","frequency":4.2086580974,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":663718,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5287056624194422,"acs":53735,"articleLive":2,"columnArticles":352,"formTitle":"[201]数字范围按位与","frequency":1.3467470827,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":101635,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6216879182126018,"acs":191856,"articleLive":2,"columnArticles":1547,"formTitle":"[202]快乐数","frequency":2.88094656,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":308605,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5231194537149536,"acs":272110,"articleLive":2,"columnArticles":1887,"formTitle":"[203]移除链表元素","frequency":1.3626179125,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":520168,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.3774034431890569,"acs":180109,"articleLive":2,"columnArticles":772,"formTitle":"[204]计数质数","frequency":2.5593236712,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":477232,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.49934386922746676,"acs":123289,"articleLive":2,"columnArticles":955,"formTitle":"[205]同构字符串","frequency":2.3202572347,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":246902,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7247201725305671,"acs":813223,"articleLive":2,"columnArticles":7808,"formTitle":"[206]反转链表","frequency":3.9007132805,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":1122120,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5406904910984842,"acs":161481,"articleLive":2,"columnArticles":1053,"formTitle":"[207]课程表","frequency":3.0509675168,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":298657,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7188161612940374,"acs":162290,"articleLive":2,"columnArticles":1092,"formTitle":"[208]实现 Trie (前缀树)","frequency":2.7154890301,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":225774,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.47774883328175244,"acs":233097,"articleLive":2,"columnArticles":1625,"formTitle":"[209]长度最小的子数组","frequency":2.900123216,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":487907,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.547082735791074,"acs":101474,"articleLive":2,"columnArticles":764,"formTitle":"[210]课程表 II","frequency":2.1241489512,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":185482,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.511799235708939,"acs":51964,"articleLive":2,"columnArticles":566,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":1.4121084668,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"ac","submitted":101532,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4639820533414573,"acs":67012,"articleLive":2,"columnArticles":603,"formTitle":"[212]单词搜索 II","frequency":1.6789323091,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":144428,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4344603186814679,"acs":192008,"articleLive":2,"columnArticles":1739,"formTitle":"[213]打家劫舍 II","frequency":3.0690250678,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":441946,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.375007066218951,"acs":33169,"articleLive":2,"columnArticles":337,"formTitle":"[214]最短回文串","frequency":2.5565455058,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":88449,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.646471061544019,"acs":495725,"articleLive":2,"columnArticles":2563,"formTitle":"[215]数组中的第K个最大元素","frequency":4.1225716571,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":766817,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7351491801809874,"acs":114870,"articleLive":2,"columnArticles":1163,"formTitle":"[216]组合总和 III","frequency":2.9028454913,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":156254,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5557457314556409,"acs":440289,"articleLive":2,"columnArticles":2039,"formTitle":"[217]存在重复元素","frequency":4.4802255057,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":792249,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5419014028311975,"acs":33955,"articleLive":2,"columnArticles":300,"formTitle":"[218]天际线问题","frequency":3.7137757075,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":62659,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.42213260381342044,"acs":122364,"articleLive":2,"columnArticles":1009,"formTitle":"[219]存在重复元素 II","frequency":2.238213481,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":289871,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28697144952415876,"acs":68872,"articleLive":2,"columnArticles":454,"formTitle":"[220]存在重复元素 III","frequency":2.0630948365,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":239996,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47979674224000096,"acs":156645,"articleLive":2,"columnArticles":1112,"formTitle":"[221]最大正方形","frequency":3.3705691003,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":326482,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7854189475645834,"acs":134869,"articleLive":2,"columnArticles":995,"formTitle":"[222]完全二叉树的节点个数","frequency":2.1465112426,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":171716,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.525500722692546,"acs":43265,"articleLive":2,"columnArticles":534,"formTitle":"[223]矩形面积","frequency":3.2599976653,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":82331,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4176470269185501,"acs":77002,"articleLive":2,"columnArticles":702,"formTitle":"[224]基本计算器","frequency":3.076289374,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":184371,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6746901073232882,"acs":152511,"articleLive":2,"columnArticles":4847,"formTitle":"[225]用队列实现栈","frequency":1.7896647868,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":226046,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7882875694773773,"acs":350732,"articleLive":2,"columnArticles":2100,"formTitle":"[226]翻转二叉树","frequency":3.6078928999,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":444929,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43720842322656783,"acs":94841,"articleLive":2,"columnArticles":758,"formTitle":"[227]基本计算器 II","frequency":2.9654128043,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":216924,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5763703456460466,"acs":62165,"articleLive":2,"columnArticles":705,"formTitle":"[228]汇总区间","frequency":0.4105017363,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":107856,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.5344516244571462,"acs":71624,"articleLive":2,"columnArticles":674,"formTitle":"[229]求众数 II","frequency":2.8830585378,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"ac","submitted":134014,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7523008860927549,"acs":175660,"articleLive":2,"columnArticles":1200,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.7526696758,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":233497,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5046896268809786,"acs":189462,"articleLive":2,"columnArticles":1350,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":375403,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6895643187298655,"acs":182156,"articleLive":2,"columnArticles":1419,"formTitle":"[232]用栈实现队列","frequency":2.4295306007,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":264161,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4774616326636963,"acs":36649,"articleLive":2,"columnArticles":446,"formTitle":"[233]数字 1 的个数","frequency":3.1659876717,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":76758,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.5025594186896817,"acs":347748,"articleLive":2,"columnArticles":2192,"formTitle":"[234]回文链表","frequency":3.1448189072,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":691954,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6681081533509334,"acs":191574,"articleLive":2,"columnArticles":1108,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":2.4775056912,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"ac","submitted":286741,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6835311593426806,"acs":293578,"articleLive":2,"columnArticles":1587,"formTitle":"[236]二叉树的最近公共祖先","frequency":3.4538877134,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":429502,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8569224912693028,"acs":258872,"articleLive":2,"columnArticles":1361,"formTitle":"[237]删除链表中的节点","frequency":2.4541018615,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":302095,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.725628428646577,"acs":154495,"articleLive":2,"columnArticles":974,"formTitle":"[238]除自身以外数组的乘积","frequency":2.5686434032,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":212912,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4970135856544128,"acs":220929,"articleLive":2,"columnArticles":1508,"formTitle":"[239]滑动窗口最大值","frequency":3.4416900602,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":444513,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4984208886507956,"acs":222364,"articleLive":2,"columnArticles":1130,"formTitle":"[240]搜索二维矩阵 II","frequency":3.172809539,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"ac","submitted":446137,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7356677964691938,"acs":35379,"articleLive":2,"columnArticles":326,"formTitle":"[241]为运算表达式设计优先级","frequency":2.5797768961,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":48091,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6477295513612958,"acs":332716,"articleLive":2,"columnArticles":1924,"formTitle":"[242]有效的字母异位词","frequency":2.1760816999,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":513665,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6572860962566844,"acs":9833,"articleLive":2,"columnArticles":119,"formTitle":"[243]最短单词距离","frequency":0.4105017363,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"","submitted":14960,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5605928509154315,"acs":5787,"articleLive":2,"columnArticles":69,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"","submitted":10323,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.5953028430160692,"acs":4816,"articleLive":2,"columnArticles":67,"formTitle":"[245]最短单词距离 III","frequency":0.9844113355,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"","submitted":8090,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4763134592680047,"acs":6455,"articleLive":2,"columnArticles":118,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"","submitted":13552,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5270850461313602,"acs":5770,"articleLive":2,"columnArticles":100,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"","submitted":10947,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4681332901973471,"acs":2894,"articleLive":2,"columnArticles":55,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"","submitted":6182,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6406204272753878,"acs":6567,"articleLive":2,"columnArticles":114,"formTitle":"[249]移位字符串分组","frequency":0.9844113355,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"ac","submitted":10251,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6374231557377049,"acs":4977,"articleLive":2,"columnArticles":85,"formTitle":"[250]统计同值子树","frequency":0.4105017363,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"","submitted":7808,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5505940723332028,"acs":4217,"articleLive":2,"columnArticles":76,"formTitle":"[251]展开二维向量","frequency":0.4378109156,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"","submitted":7659,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5644481190574617,"acs":13654,"articleLive":2,"columnArticles":171,"formTitle":"[252]会议室","frequency":0.4105017363,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"","submitted":24190,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5060057987021952,"acs":36650,"articleLive":2,"columnArticles":389,"formTitle":"[253]会议室 II","frequency":2.9404525126,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"","submitted":72430,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5686497770186925,"acs":5993,"articleLive":2,"columnArticles":85,"formTitle":"[254]因子的组合","frequency":0.9844113355,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"","submitted":10539,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47831135439993366,"acs":5767,"articleLive":2,"columnArticles":71,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"","submitted":12057,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.646798683111395,"acs":13163,"articleLive":2,"columnArticles":210,"formTitle":"[256]粉刷房子","frequency":0.4378109156,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"","submitted":20351,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6870582093894946,"acs":160571,"articleLive":2,"columnArticles":1170,"formTitle":"[257]二叉树的所有路径","frequency":2.6315572286,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":233708,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6916456690336725,"acs":84544,"articleLive":2,"columnArticles":712,"formTitle":"[258]各位相加","frequency":2.2311010755,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":122236,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5608757062146893,"acs":7942,"articleLive":2,"columnArticles":95,"formTitle":"[259]较小的三数之和","frequency":0.4961705308,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"","submitted":14160,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7404050730844686,"acs":80388,"articleLive":2,"columnArticles":716,"formTitle":"[260]只出现一次的数字 III","frequency":3.0746336075,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":108573,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49854525037006786,"acs":9767,"articleLive":2,"columnArticles":135,"formTitle":"[261]以图判树","frequency":1.3787942601,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"","submitted":19591,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43047004286198853,"acs":41880,"articleLive":2,"columnArticles":397,"formTitle":"[262]行程和用户","frequency":2.9174956214,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":97289,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.514008542348237,"acs":113123,"articleLive":2,"columnArticles":876,"formTitle":"[263]丑数","frequency":1.9625075996,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":220080,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5810219916834569,"acs":108428,"articleLive":2,"columnArticles":669,"formTitle":"[264]丑数 II","frequency":2.6890030283,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":186616,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5995735282918285,"acs":7873,"articleLive":2,"columnArticles":174,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"","submitted":13131,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6807486145180339,"acs":7493,"articleLive":2,"columnArticles":114,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"","submitted":11007,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44902566539923955,"acs":3779,"articleLive":2,"columnArticles":81,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"","submitted":8416,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6517402749341913,"acs":200547,"articleLive":2,"columnArticles":1551,"formTitle":"[268]丢失的数字","frequency":2.2598828013,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":307710,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.34536810393522877,"acs":7337,"articleLive":2,"columnArticles":117,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"","submitted":21244,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5643197193685793,"acs":11261,"articleLive":2,"columnArticles":149,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.3118267287,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"","submitted":19955,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5573463268365817,"acs":2974,"articleLive":2,"columnArticles":50,"formTitle":"[271]字符串的编码与解码","frequency":0.4378109156,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"","submitted":5336,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6477997984548203,"acs":3857,"articleLive":2,"columnArticles":87,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"","submitted":5954,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.366515056268412,"acs":29735,"articleLive":2,"columnArticles":360,"formTitle":"[273]整数转换英文表示","frequency":2.5148554335,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":81129,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.44043500519710205,"acs":56780,"articleLive":2,"columnArticles":598,"formTitle":"[274]H 指数","frequency":2.8498107946,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":128918,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.46076655776913145,"acs":53172,"articleLive":2,"columnArticles":441,"formTitle":"[275]H 指数 II","frequency":2.0283208182,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":115399,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.49990189024789067,"acs":7643,"articleLive":2,"columnArticles":144,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"","submitted":15289,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5720623823608497,"acs":8510,"articleLive":2,"columnArticles":98,"formTitle":"[277]搜寻名人","frequency":0.3843222307,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"","submitted":14876,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45238384106827506,"acs":234908,"articleLive":2,"columnArticles":1330,"formTitle":"[278]第一个错误的版本","frequency":3.8467543816,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":519267,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6370220953851268,"acs":226118,"articleLive":2,"columnArticles":1319,"formTitle":"[279]完全平方数","frequency":3.2056306722,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":354961,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6842453662842012,"acs":6202,"articleLive":2,"columnArticles":80,"formTitle":"[280]摆动排序","frequency":0.9844113355,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"ac","submitted":9064,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7571574642126789,"acs":2962,"articleLive":2,"columnArticles":74,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"","submitted":3912,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.4841151562463038,"acs":20465,"articleLive":2,"columnArticles":173,"formTitle":"[282]给表达式添加运算符","frequency":1.4467860052,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"ac","submitted":42273,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6404481111248477,"acs":580205,"articleLive":2,"columnArticles":3777,"formTitle":"[283]移动零","frequency":3.8759532205,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":905936,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7699784336317174,"acs":26063,"articleLive":2,"columnArticles":219,"formTitle":"[284]窥探迭代器","frequency":1.7896647868,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":33849,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6360289009309434,"acs":9155,"articleLive":2,"columnArticles":116,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"","submitted":14394,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5183407336293452,"acs":12958,"articleLive":2,"columnArticles":166,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"ac","submitted":24999,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.65480124728489,"acs":196553,"articleLive":2,"columnArticles":1332,"formTitle":"[287]寻找重复数","frequency":2.5261272227,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":300172,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4463768115942029,"acs":4004,"articleLive":2,"columnArticles":64,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"ac","submitted":8970,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7542460493280165,"acs":56177,"articleLive":2,"columnArticles":860,"formTitle":"[289]生命游戏","frequency":1.5805729889,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":74481,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.4552372176853872,"acs":89918,"articleLive":2,"columnArticles":1194,"formTitle":"[290]单词规律","frequency":2.2066277523,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":197519,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5263453965872867,"acs":2807,"articleLive":2,"columnArticles":62,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"","submitted":5333,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7075216768099255,"acs":120440,"articleLive":2,"columnArticles":801,"formTitle":"[292]Nim 游戏","frequency":2.0784114172,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":170228,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7132479196935676,"acs":5400,"articleLive":2,"columnArticles":89,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"","submitted":7571,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5834907716901613,"acs":4015,"articleLive":2,"columnArticles":59,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"","submitted":6881,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5229201784089383,"acs":70110,"articleLive":2,"columnArticles":550,"formTitle":"[295]数据流的中位数","frequency":3.1325788523,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":134074,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6218239564428312,"acs":2741,"articleLive":2,"columnArticles":52,"formTitle":"[296]最佳的碰头地点","frequency":1.1896627174,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"","submitted":4408,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5641355195388178,"acs":119388,"articleLive":2,"columnArticles":837,"formTitle":"[297]二叉树的序列化与反序列化","frequency":2.9404525126,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":211630,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5838084378563284,"acs":5632,"articleLive":2,"columnArticles":88,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"","submitted":9647,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5642718617771509,"acs":64011,"articleLive":2,"columnArticles":730,"formTitle":"[299]猜数字游戏","frequency":2.4222824414,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"ac","submitted":113440,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5223467427523729,"acs":405690,"articleLive":2,"columnArticles":2228,"formTitle":"[300]最长递增子序列","frequency":3.5331056787,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":776668,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5480038163058553,"acs":55715,"articleLive":2,"columnArticles":400,"formTitle":"[301]删除无效的括号","frequency":2.913123074,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"ac","submitted":101669,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6592765460910152,"acs":2260,"articleLive":2,"columnArticles":44,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"","submitted":3428,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7321890455158552,"acs":138424,"articleLive":2,"columnArticles":846,"formTitle":"[303]区域和检索 - 数组不可变","frequency":1.5805729889,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":189055,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5594552535330316,"acs":70822,"articleLive":2,"columnArticles":628,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":1.4646691714,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":126591,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3952020202020202,"acs":5008,"articleLive":2,"columnArticles":74,"formTitle":"[305]岛屿数量 II","frequency":0.3843222307,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"","submitted":12672,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.33896495877502947,"acs":18418,"articleLive":2,"columnArticles":275,"formTitle":"[306]累加数","frequency":2.2110747734,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":54336,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5300547560404666,"acs":26040,"articleLive":2,"columnArticles":252,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.4105017363,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":49127,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6186104218362283,"acs":2493,"articleLive":2,"columnArticles":52,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"","submitted":4030,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6166429456866076,"acs":134311,"articleLive":2,"columnArticles":1066,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":3.3935261064,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":217810,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3826158862902345,"acs":24523,"articleLive":2,"columnArticles":230,"formTitle":"[310]最小高度树","frequency":1.5805729889,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":64093,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7628942486085343,"acs":4112,"articleLive":2,"columnArticles":50,"formTitle":"[311]稀疏矩阵的乘法","frequency":1.0470983134,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"ac","submitted":5390,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6852634513521049,"acs":61451,"articleLive":2,"columnArticles":418,"formTitle":"[312]戳气球","frequency":2.5995800836,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":89675,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6148024026923787,"acs":43295,"articleLive":2,"columnArticles":375,"formTitle":"[313]超级丑数","frequency":2.5467606919,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":70421,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.551345962113659,"acs":5530,"articleLive":2,"columnArticles":101,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"","submitted":10030,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41786416282293243,"acs":53360,"articleLive":2,"columnArticles":501,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":2.5797768961,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":127697,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4770784265247433,"acs":73326,"articleLive":2,"columnArticles":588,"formTitle":"[316]去除重复字母","frequency":3.0967584037,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":153698,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4739224747712911,"acs":5025,"articleLive":2,"columnArticles":70,"formTitle":"[317]离建筑物最近的距离","frequency":0.4105017363,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"","submitted":10603,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.7367733317846565,"acs":50746,"articleLive":2,"columnArticles":493,"formTitle":"[318]最大单词长度乘积","frequency":2.4222824414,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":68876,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5708943887447708,"acs":48856,"articleLive":2,"columnArticles":444,"formTitle":"[319]灯泡开关","frequency":2.8154195098,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":85578,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.682752832563995,"acs":3254,"articleLive":2,"columnArticles":57,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"","submitted":4766,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42315151515151517,"acs":27928,"articleLive":2,"columnArticles":240,"formTitle":"[321]拼接最大数","frequency":1.4829345194,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":66000,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.44834824895625386,"acs":344075,"articleLive":2,"columnArticles":2002,"formTitle":"[322]零钱兑换","frequency":3.3838932806,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":767428,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6315442704373828,"acs":12461,"articleLive":2,"columnArticles":167,"formTitle":"[323]无向图中连通分量的数目","frequency":1.3787942601,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"","submitted":19731,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3804608769954835,"acs":28051,"articleLive":2,"columnArticles":184,"formTitle":"[324]摆动排序 II","frequency":1.6449038473,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":73729,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5358615004122012,"acs":10400,"articleLive":2,"columnArticles":126,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.3843222307,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"","submitted":19408,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5047189906035805,"acs":145726,"articleLive":2,"columnArticles":618,"formTitle":"[326]3 的幂","frequency":2.5467606919,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":288727,"title":"3 的幂","titleSlug":"power-of-three"},{"acceptance":0.4182219287934172,"acs":25972,"articleLive":2,"columnArticles":217,"formTitle":"[327]区间和的个数","frequency":1.8893488444,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":62101,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6548734186148265,"acs":139194,"articleLive":2,"columnArticles":1153,"formTitle":"[328]奇偶链表","frequency":3.0288590261,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":212551,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4910806803870618,"acs":61610,"articleLive":2,"columnArticles":539,"formTitle":"[329]矩阵中的最长递增路径","frequency":2.3847980707,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":125458,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5319984723661957,"acs":19502,"articleLive":2,"columnArticles":157,"formTitle":"[330]按要求补齐数组","frequency":1.4467860052,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":36658,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.47952788696915216,"acs":47210,"articleLive":2,"columnArticles":524,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.9264156679,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":98451,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.45145034414945917,"acs":44076,"articleLive":2,"columnArticles":361,"formTitle":"[332]重新安排行程","frequency":1.1515773834,"frontendQuestionId":"332","leaf":true,"level":3,"nodeType":"def","questionId":"332","status":"","submitted":97632,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46901939655172414,"acs":5223,"articleLive":2,"columnArticles":90,"formTitle":"[333]最大 BST 子树","frequency":0.4961705308,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"","submitted":11136,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41168121329036,"acs":52498,"articleLive":2,"columnArticles":342,"formTitle":"[334]递增的三元子序列","frequency":2.3047938061,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":127521,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.43017456359102246,"acs":16560,"articleLive":2,"columnArticles":151,"formTitle":"[335]路径交叉","frequency":1.9251898366,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"ac","submitted":38496,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4003193113980286,"acs":23068,"articleLive":2,"columnArticles":200,"formTitle":"[336]回文对","frequency":0.4378109156,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":57624,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6074315652155616,"acs":144347,"articleLive":2,"columnArticles":1013,"formTitle":"[337]打家劫舍 III","frequency":3.2586372504,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":237635,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.786664454092067,"acs":175401,"articleLive":2,"columnArticles":1492,"formTitle":"[338]比特位计数","frequency":2.2678892492,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":222968,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8206469107108271,"acs":4237,"articleLive":2,"columnArticles":66,"formTitle":"[339]嵌套列表权重和","frequency":0.4961705308,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"","submitted":5163,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.49676883642008735,"acs":13760,"articleLive":2,"columnArticles":202,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":1.3787942601,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"","submitted":27699,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7263567238176691,"acs":54354,"articleLive":2,"columnArticles":509,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":1.4646691714,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":74831,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5181100339528234,"acs":92779,"articleLive":2,"columnArticles":809,"formTitle":"[342]4的幂","frequency":1.3158804347,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":179072,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6103719648196667,"acs":125335,"articleLive":2,"columnArticles":1165,"formTitle":"[343]整数拆分","frequency":3.3051456546,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":205342,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7752348902257072,"acs":422948,"articleLive":2,"columnArticles":2224,"formTitle":"[344]反转字符串","frequency":2.9752884524,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":545574,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5399597044996642,"acs":114972,"articleLive":2,"columnArticles":1089,"formTitle":"[345]反转字符串中的元音字母","frequency":2.6890030283,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":212927,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7096992051535145,"acs":13661,"articleLive":2,"columnArticles":149,"formTitle":"[346]数据流中的移动平均值","frequency":0.4378109156,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"ac","submitted":19249,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6238889665436068,"acs":227634,"articleLive":2,"columnArticles":1698,"formTitle":"[347]前 K 个高频元素","frequency":3.2658833589,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":364863,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6011529838795773,"acs":5631,"articleLive":2,"columnArticles":88,"formTitle":"[348]设计井字棋","frequency":0.4378109156,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"","submitted":9367,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7388383769846655,"acs":239558,"articleLive":2,"columnArticles":1673,"formTitle":"[349]两个数组的交集","frequency":3.2946402528,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":324236,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5529293558959785,"acs":285614,"articleLive":2,"columnArticles":1610,"formTitle":"[350]两个数组的交集 II","frequency":3.2658833589,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":516547,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5930539427847566,"acs":5618,"articleLive":2,"columnArticles":103,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"","submitted":9473,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6779896013864818,"acs":21516,"articleLive":2,"columnArticles":354,"formTitle":"[352]将数据流变为多个不相交区间","frequency":1.7896647868,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":31735,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.43124893508263756,"acs":2531,"articleLive":2,"columnArticles":52,"formTitle":"[353]贪吃蛇","frequency":0.3843222307,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"","submitted":5869,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4587848073541848,"acs":75410,"articleLive":2,"columnArticles":588,"formTitle":"[354]俄罗斯套娃信封问题","frequency":2.2066277523,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":164369,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.409002856943767,"acs":29348,"articleLive":2,"columnArticles":489,"formTitle":"[355]设计推特","frequency":1.4121084668,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":71755,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35428106569046164,"acs":1742,"articleLive":2,"columnArticles":45,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"","submitted":4917,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5207565124301178,"acs":26268,"articleLive":2,"columnArticles":420,"formTitle":"[357]计算各个位数不同的数字个数","frequency":1.8216777638,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":50442,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.3530154486036839,"acs":4753,"articleLive":2,"columnArticles":63,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.5602128972,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"","submitted":13464,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7289269467487289,"acs":5448,"articleLive":2,"columnArticles":64,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"","submitted":7474,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6026955201214882,"acs":3175,"articleLive":2,"columnArticles":65,"formTitle":"[360]有序转化数组","frequency":0.4961705308,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"","submitted":5268,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5654347167524992,"acs":3733,"articleLive":2,"columnArticles":71,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"","submitted":6602,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6891219338784216,"acs":3877,"articleLive":2,"columnArticles":72,"formTitle":"[362]敲击计数器","frequency":0.4378109156,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"","submitted":5626,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.48795750042957786,"acs":34077,"articleLive":2,"columnArticles":225,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.4105017363,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":69836,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7323250087935279,"acs":2082,"articleLive":2,"columnArticles":52,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"","submitted":2843,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.36945945386414925,"acs":35692,"articleLive":2,"columnArticles":499,"formTitle":"[365]水壶问题","frequency":2.4541018615,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":96606,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7687588485134498,"acs":4887,"articleLive":2,"columnArticles":128,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.4105017363,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"","submitted":6357,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4477307001795332,"acs":124693,"articleLive":2,"columnArticles":993,"formTitle":"[367]有效的完全平方数","frequency":2.2066277523,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":278500,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4594997084062318,"acs":44123,"articleLive":2,"columnArticles":467,"formTitle":"[368]最大整除子集","frequency":2.1423630639,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":96024,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6195990536670403,"acs":4976,"articleLive":2,"columnArticles":143,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"","submitted":8031,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7429923552966873,"acs":4082,"articleLive":2,"columnArticles":61,"formTitle":"[370]区间加法","frequency":0.4378109156,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"","submitted":5494,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6129352872896111,"acs":84487,"articleLive":2,"columnArticles":529,"formTitle":"[371]两整数之和","frequency":2.750126737,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":137840,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5750063243106501,"acs":36368,"articleLive":2,"columnArticles":375,"formTitle":"[372]超级次方","frequency":1.0580513254,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":63248,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.40687273049331324,"acs":22970,"articleLive":2,"columnArticles":248,"formTitle":"[373]查找和最小的K对数字","frequency":2.0630948365,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":56455,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.518029517351416,"acs":90909,"articleLive":2,"columnArticles":619,"formTitle":"[374]猜数字大小","frequency":0.9548670892,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":175490,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.6015548239187768,"acs":34898,"articleLive":2,"columnArticles":275,"formTitle":"[375]猜数字大小 II","frequency":2.6315572286,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"ac","submitted":58013,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4679341458014979,"acs":86660,"articleLive":2,"columnArticles":911,"formTitle":"[376]摆动序列","frequency":1.6999990246,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":185197,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5136192304956974,"acs":72220,"articleLive":2,"columnArticles":606,"formTitle":"[377]组合总和 Ⅳ","frequency":1.8216777638,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":140610,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6291299559471366,"acs":86830,"articleLive":2,"columnArticles":613,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":2.270909487,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":138016,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6299145299145299,"acs":3685,"articleLive":2,"columnArticles":79,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"","submitted":5850,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5059657020090285,"acs":39565,"articleLive":2,"columnArticles":255,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":2.1178580396,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":78197,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.4388336993975054,"acs":21778,"articleLive":2,"columnArticles":183,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.4663353824,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":49627,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6389199322253867,"acs":17723,"articleLive":2,"columnArticles":141,"formTitle":"[382]链表随机节点","frequency":1.3158804347,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":27739,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6426283606716491,"acs":119178,"articleLive":2,"columnArticles":1280,"formTitle":"[383]赎金信","frequency":2.2598828013,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":185454,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.6071163615552556,"acs":85927,"articleLive":2,"columnArticles":408,"formTitle":"[384]打乱数组","frequency":2.5467606919,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":141533,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4209118150684932,"acs":7866,"articleLive":2,"columnArticles":95,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":18688,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7499240998239116,"acs":24701,"articleLive":2,"columnArticles":263,"formTitle":"[386]字典序排数","frequency":2.4870320677,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":32938,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5391581082247346,"acs":249889,"articleLive":2,"columnArticles":1378,"formTitle":"[387]字符串中的第一个唯一字符","frequency":3.1325788523,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":463480,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5358387634490074,"acs":7072,"articleLive":2,"columnArticles":135,"formTitle":"[388]文件的最长绝对路径","frequency":1.0151262807,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":13198,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.69015433606313,"acs":108798,"articleLive":2,"columnArticles":1086,"formTitle":"[389]找不同","frequency":0.3350511817,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":157643,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.6074431641233261,"acs":27307,"articleLive":2,"columnArticles":365,"formTitle":"[390]消除游戏","frequency":1.6812483581,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"ac","submitted":44954,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.46719806450219253,"acs":21628,"articleLive":2,"columnArticles":197,"formTitle":"[391]完美矩形","frequency":2.1423630639,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":46293,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5168071928966309,"acs":161633,"articleLive":2,"columnArticles":1731,"formTitle":"[392]判断子序列","frequency":2.2598828013,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":312753,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3931218499851764,"acs":11934,"articleLive":2,"columnArticles":143,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":30357,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5548272858976634,"acs":134423,"articleLive":2,"columnArticles":1423,"formTitle":"[394]字符串解码","frequency":3.8040285784,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":242279,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5202851442114039,"acs":55542,"articleLive":2,"columnArticles":453,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":2.6646454415,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":106753,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.43888534354392683,"acs":10316,"articleLive":2,"columnArticles":172,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":23505,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.43176283375680263,"acs":49110,"articleLive":2,"columnArticles":569,"formTitle":"[397]整数替换","frequency":2.9726644677,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":113743,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6652805796862777,"acs":16159,"articleLive":2,"columnArticles":138,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":24289,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5911346001891217,"acs":45635,"articleLive":2,"columnArticles":560,"formTitle":"[399]除法求值","frequency":0.4961705308,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":77199,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4546744022353518,"acs":42633,"articleLive":2,"columnArticles":485,"formTitle":"[400]第 N 位数字","frequency":3.4538877134,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":93766,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6156496706939416,"acs":56460,"articleLive":2,"columnArticles":690,"formTitle":"[401]二进制手表","frequency":0.9844113355,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":91708,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3268109146207046,"acs":87468,"articleLive":2,"columnArticles":645,"formTitle":"[402]移掉 K 位数字","frequency":2.9304997059,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":267641,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45546168808879056,"acs":47767,"articleLive":2,"columnArticles":473,"formTitle":"[403]青蛙过河","frequency":1.9948205886,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":104876,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5901415113743881,"acs":114766,"articleLive":2,"columnArticles":1255,"formTitle":"[404]左叶子之和","frequency":2.9966155021,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":194472,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5592470185818619,"acs":48395,"articleLive":2,"columnArticles":487,"formTitle":"[405]数字转换为十六进制数","frequency":2.5797768961,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":86536,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7399655077495211,"acs":131722,"articleLive":2,"columnArticles":864,"formTitle":"[406]根据身高重建队列","frequency":2.6890030283,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":178011,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.5800875672717322,"acs":25438,"articleLive":2,"columnArticles":253,"formTitle":"[407]接雨水 II","frequency":3.1154463448,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"ac","submitted":43852,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.33327923395277126,"acs":4107,"articleLive":2,"columnArticles":85,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"","submitted":12323,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5558830583908536,"acs":104292,"articleLive":2,"columnArticles":1434,"formTitle":"[409]最长回文串","frequency":2.604082973,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":187615,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5699599465954606,"acs":42690,"articleLive":2,"columnArticles":355,"formTitle":"[410]分割数组的最大值","frequency":2.8830585378,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":74900,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.4977645305514158,"acs":1002,"articleLive":2,"columnArticles":28,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"","submitted":2013,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.7101623017336776,"acs":107814,"articleLive":2,"columnArticles":617,"formTitle":"[412]Fizz Buzz","frequency":2.3617000696,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":151816,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.690066145726232,"acs":80539,"articleLive":2,"columnArticles":1045,"formTitle":"[413]等差数列划分","frequency":2.6466861102,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":116712,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.39402988804478206,"acs":94605,"articleLive":2,"columnArticles":1216,"formTitle":"[414]第三大的数","frequency":2.6890030283,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":240096,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5414837591181185,"acs":165537,"articleLive":2,"columnArticles":1186,"formTitle":"[415]字符串相加","frequency":3.7886820275,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":305710,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5102565364853906,"acs":196933,"articleLive":2,"columnArticles":1132,"formTitle":"[416]分割等和子集","frequency":3.2056306722,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":385949,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4873805478042621,"acs":31264,"articleLive":2,"columnArticles":368,"formTitle":"[417]太平洋大西洋水流问题","frequency":2.3047938061,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":64147,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3687826736370426,"acs":2469,"articleLive":2,"columnArticles":37,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"","submitted":6695,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7903574788334902,"acs":33606,"articleLive":2,"columnArticles":439,"formTitle":"[419]甲板上的战舰","frequency":0.037740328,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":42520,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.21291385982513975,"acs":2971,"articleLive":2,"columnArticles":58,"formTitle":"[420]强密码检验器","frequency":2.099238995,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13954,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6211880587427062,"acs":34812,"articleLive":2,"columnArticles":318,"formTitle":"[421]数组中两个数的最大异或值","frequency":0.9548670892,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":56041,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.43377932906728717,"acs":2237,"articleLive":2,"columnArticles":56,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"","submitted":5157,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.6120155388924022,"acs":33872,"articleLive":2,"columnArticles":394,"formTitle":"[423]从英文中重建数字","frequency":3.0622139803,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":55345,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5329211926241024,"acs":54998,"articleLive":2,"columnArticles":476,"formTitle":"[424]替换后的最长重复字符","frequency":2.4188123845,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":103201,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6208933185677372,"acs":1682,"articleLive":2,"columnArticles":37,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"","submitted":2709,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6762216075769005,"acs":8068,"articleLive":2,"columnArticles":127,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":0.9844113355,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"","submitted":11931,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6182974018794914,"acs":4474,"articleLive":2,"columnArticles":76,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":7236,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6625055728934462,"acs":2972,"articleLive":2,"columnArticles":58,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"","submitted":4486,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.7057821862262003,"acs":66316,"articleLive":2,"columnArticles":535,"formTitle":"[429]N 叉树的层序遍历","frequency":1.5206748473,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":93961,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5890311669485383,"acs":46322,"articleLive":2,"columnArticles":702,"formTitle":"[430]扁平化多级双向链表","frequency":2.1423630639,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":78641,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7295504789977892,"acs":990,"articleLive":2,"columnArticles":33,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"","submitted":1357,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.3840629820735145,"acs":7220,"articleLive":2,"columnArticles":99,"formTitle":"[432]全 O(1) 的数据结构","frequency":1.9948205886,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":18799,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5321765394809838,"acs":17267,"articleLive":2,"columnArticles":245,"formTitle":"[433]最小基因变化","frequency":1.3467470827,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":32446,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3981839833283715,"acs":66875,"articleLive":2,"columnArticles":912,"formTitle":"[434]字符串中的单词数","frequency":3.1154463448,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":167950,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5068324454499015,"acs":111122,"articleLive":2,"columnArticles":974,"formTitle":"[435]无重叠区间","frequency":2.6714031371,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":219248,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.49090998913150874,"acs":9937,"articleLive":2,"columnArticles":170,"formTitle":"[436]寻找右区间","frequency":0.3843222307,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":20242,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5744333827578902,"acs":135595,"articleLive":2,"columnArticles":1093,"formTitle":"[437]路径总和 III","frequency":2.8790868901,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":236050,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5369433541890429,"acs":134478,"articleLive":2,"columnArticles":1157,"formTitle":"[438]找到字符串中所有字母异位词","frequency":2.7154890301,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":250451,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5924630924630925,"acs":3050,"articleLive":2,"columnArticles":72,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"","submitted":5148,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.38279748943256053,"acs":17931,"articleLive":2,"columnArticles":136,"formTitle":"[440]字典序的第K小数字","frequency":3.208444603,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":46842,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.45877536248275236,"acs":81128,"articleLive":2,"columnArticles":780,"formTitle":"[441]排列硬币","frequency":2.5467606919,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":176836,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6979050688543803,"acs":47639,"articleLive":2,"columnArticles":484,"formTitle":"[442]数组中重复的数据","frequency":3.0497912398,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":68260,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4776200961090307,"acs":59436,"articleLive":2,"columnArticles":724,"formTitle":"[443]压缩字符串","frequency":2.8830585378,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":124442,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2567807005588115,"acs":3768,"articleLive":2,"columnArticles":59,"formTitle":"[444]序列重建","frequency":0.4663353824,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"","submitted":14674,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5907218903314088,"acs":88499,"articleLive":2,"columnArticles":1000,"formTitle":"[445]两数相加 II","frequency":1.93130382,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":149815,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5498437629621437,"acs":19884,"articleLive":2,"columnArticles":177,"formTitle":"[446]等差数列划分 II - 子序列","frequency":2.3047938061,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":36163,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6636808901429446,"acs":49865,"articleLive":2,"columnArticles":389,"formTitle":"[447]回旋镖的数量","frequency":2.238213481,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":75134,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6514005219972365,"acs":152743,"articleLive":2,"columnArticles":1196,"formTitle":"[448]找到所有数组中消失的数字","frequency":2.3970250303,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":234484,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5628736613888706,"acs":17135,"articleLive":2,"columnArticles":154,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.4378109156,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"ac","submitted":30442,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.49125585648869124,"acs":74131,"articleLive":2,"columnArticles":725,"formTitle":"[450]删除二叉搜索树中的节点","frequency":2.2031836297,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":150901,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7124282828282829,"acs":88163,"articleLive":2,"columnArticles":1016,"formTitle":"[451]根据字符出现频率排序","frequency":2.6466861102,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":123750,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5077753405949947,"acs":108571,"articleLive":2,"columnArticles":952,"formTitle":"[452]用最少数量的箭引爆气球","frequency":2.4814633495,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":213817,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.6115104871447903,"acs":57844,"articleLive":2,"columnArticles":697,"formTitle":"[453]最小操作次数使数组元素相等","frequency":2.8154195098,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"ac","submitted":94592,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6099375409120663,"acs":89451,"articleLive":2,"columnArticles":563,"formTitle":"[454]四数相加 II","frequency":2.913123074,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":146656,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5756320741714374,"acs":171235,"articleLive":2,"columnArticles":1398,"formTitle":"[455]分发饼干","frequency":3.1629025826,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":297473,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.362867711819623,"acs":59740,"articleLive":2,"columnArticles":475,"formTitle":"[456]132 模式","frequency":1.9948205886,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":164633,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43532124148195706,"acs":29833,"articleLive":2,"columnArticles":340,"formTitle":"[457]环形数组是否存在循环","frequency":2.2474386387,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":68531,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6980900122934844,"acs":23282,"articleLive":2,"columnArticles":213,"formTitle":"[458]可怜的小猪","frequency":2.7428713906,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":33351,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5093820769977354,"acs":88172,"articleLive":2,"columnArticles":704,"formTitle":"[459]重复的子字符串","frequency":2.0283208182,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":173096,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.43451551467855815,"acs":37417,"articleLive":2,"columnArticles":431,"formTitle":"[460]LFU 缓存","frequency":2.3202572347,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":86112,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8131895160028084,"acs":181843,"articleLive":2,"columnArticles":1449,"formTitle":"[461]汉明距离","frequency":1.6999990246,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":223617,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6097285067873304,"acs":15631,"articleLive":2,"columnArticles":153,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":0.9548670892,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":25636,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7049067959541921,"acs":84328,"articleLive":2,"columnArticles":1017,"formTitle":"[463]岛屿的周长","frequency":2.3617000696,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":119630,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3544536271808999,"acs":12352,"articleLive":2,"columnArticles":120,"formTitle":"[464]我能赢吗","frequency":1.0470983134,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":34848,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5371340523882897,"acs":1743,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.8989866308,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"","submitted":3245,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37316528899644846,"acs":11873,"articleLive":2,"columnArticles":186,"formTitle":"[466]统计重复个数","frequency":1.4829345194,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31817,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44246929541047186,"acs":9583,"articleLive":2,"columnArticles":124,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.4105017363,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":21658,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.2534056439010938,"acs":27568,"articleLive":2,"columnArticles":324,"formTitle":"[468]验证IP地址","frequency":2.238213481,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":108790,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.43416082029141934,"acs":1609,"articleLive":2,"columnArticles":22,"formTitle":"[469]凸多边形","frequency":0.7097446311,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"","submitted":3706,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.547982955676795,"acs":68802,"articleLive":2,"columnArticles":355,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":3.0288590261,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":125555,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6040530007794233,"acs":1550,"articleLive":2,"columnArticles":28,"formTitle":"[471]编码最短长度的字符串","frequency":1.7896647868,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"","submitted":2566,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.49829983819149687,"acs":21249,"articleLive":2,"columnArticles":220,"formTitle":"[472]连接词","frequency":1.0580513254,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":42643,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.42158936124453367,"acs":23523,"articleLive":2,"columnArticles":204,"formTitle":"[473]火柴拼正方形","frequency":2.1760816999,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":55796,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6161546788100482,"acs":82537,"articleLive":2,"columnArticles":659,"formTitle":"[474]一和零","frequency":1.9901336659,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":133955,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.40198465308746134,"acs":50029,"articleLive":2,"columnArticles":566,"formTitle":"[475]供暖器","frequency":2.4626569654,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":124455,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7123787976729153,"acs":66123,"articleLive":2,"columnArticles":892,"formTitle":"[476]数字的补数","frequency":2.0784114172,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"ac","submitted":92820,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6040318078252078,"acs":40031,"articleLive":2,"columnArticles":341,"formTitle":"[477]汉明距离总和","frequency":0.3843222307,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":66273,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4451434177872684,"acs":7713,"articleLive":2,"columnArticles":55,"formTitle":"[478]在圆内随机生成点","frequency":1.0804236231,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":17327,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.4322162985529322,"acs":3405,"articleLive":2,"columnArticles":36,"formTitle":"[479]最大回文数乘积","frequency":0.4663353824,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"ac","submitted":7878,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.44751020171069256,"acs":30816,"articleLive":2,"columnArticles":420,"formTitle":"[480]滑动窗口中位数","frequency":2.1098323144,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":68861,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5503040834057341,"acs":6334,"articleLive":2,"columnArticles":109,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":11510,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4725787631271879,"acs":42930,"articleLive":2,"columnArticles":456,"formTitle":"[482]密钥格式化","frequency":1.2861163328,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":90842,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5900292184075968,"acs":16155,"articleLive":2,"columnArticles":122,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"ac","submitted":27380,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.631928181108509,"acs":1619,"articleLive":2,"columnArticles":37,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"","submitted":2562,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6089528846197911,"acs":132879,"articleLive":2,"columnArticles":1076,"formTitle":"[485]最大连续 1 的个数","frequency":2.7097220015,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":218209,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5873322157768425,"acs":48701,"articleLive":2,"columnArticles":419,"formTitle":"[486]预测赢家","frequency":2.270909487,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":82919,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5794354510697145,"acs":7123,"articleLive":2,"columnArticles":133,"formTitle":"[487]最大连续1的个数 II","frequency":0.9548670892,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"","submitted":12293,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.5256097202200583,"acs":17866,"articleLive":2,"columnArticles":174,"formTitle":"[488]祖玛游戏","frequency":2.928344068,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"ac","submitted":33991,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7360425370300038,"acs":1938,"articleLive":2,"columnArticles":28,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"","submitted":2633,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4863273583671333,"acs":7434,"articleLive":2,"columnArticles":91,"formTitle":"[490]迷宫","frequency":0.3843222307,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"","submitted":15286,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5397192534694528,"acs":54136,"articleLive":2,"columnArticles":461,"formTitle":"[491]递增子序列","frequency":2.0784114172,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":100304,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.6052110817941952,"acs":45875,"articleLive":2,"columnArticles":442,"formTitle":"[492]构造矩形","frequency":2.1098323144,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":75800,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.34706804640953276,"acs":27670,"articleLive":2,"columnArticles":278,"formTitle":"[493]翻转对","frequency":1.0470983134,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":79725,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.49144275573749074,"acs":169275,"articleLive":2,"columnArticles":1139,"formTitle":"[494]目标和","frequency":2.6598476584,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":344445,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.6062671167441565,"acs":66633,"articleLive":2,"columnArticles":954,"formTitle":"[495]提莫攻击","frequency":2.6466861102,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"ac","submitted":109907,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.7052978238697563,"acs":147987,"articleLive":2,"columnArticles":1504,"formTitle":"[496]下一个更大元素 I","frequency":2.6315572286,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":209822,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.40618955512572535,"acs":3360,"articleLive":2,"columnArticles":41,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.4663353824,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":8272,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.47919913206430614,"acs":48586,"articleLive":2,"columnArticles":504,"formTitle":"[498]对角线遍历","frequency":2.4541018615,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":101390,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3784871244635193,"acs":2822,"articleLive":2,"columnArticles":51,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"","submitted":7456,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7443397808586762,"acs":53259,"articleLive":2,"columnArticles":776,"formTitle":"[500]键盘行","frequency":2.1423630639,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"ac","submitted":71552,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5178460659199733,"acs":74299,"articleLive":2,"columnArticles":607,"formTitle":"[501]二叉搜索树中的众数","frequency":2.0784114172,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":143477,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4412665835959833,"acs":30101,"articleLive":2,"columnArticles":365,"formTitle":"[502]IPO","frequency":2.270909487,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":68215,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6408681431694419,"acs":114038,"articleLive":2,"columnArticles":1070,"formTitle":"[503]下一个更大元素 II","frequency":2.3764833974,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":177943,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5037719533649402,"acs":33790,"articleLive":2,"columnArticles":361,"formTitle":"[504]七进制数","frequency":0.3350511817,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":67074,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.49198239270554944,"acs":6259,"articleLive":2,"columnArticles":72,"formTitle":"[505]迷宫 II","frequency":0.5274230743,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"","submitted":12722,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.6536088129085341,"acs":57196,"articleLive":2,"columnArticles":737,"formTitle":"[506]相对名次","frequency":2.4541018615,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":87508,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4865448639870077,"acs":59918,"articleLive":2,"columnArticles":450,"formTitle":"[507]完美数","frequency":0.2169505849,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":123150,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6805182627967438,"acs":15967,"articleLive":2,"columnArticles":237,"formTitle":"[508]出现次数最多的子树元素和","frequency":1.3158804347,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":23463,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6705376552079879,"acs":291185,"articleLive":2,"columnArticles":1711,"formTitle":"[509]斐波那契数","frequency":3.0288590261,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"ac","submitted":434256,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6102805308247943,"acs":3633,"articleLive":2,"columnArticles":59,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"","submitted":5953,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7301966056125021,"acs":21727,"articleLive":2,"columnArticles":118,"formTitle":"[511]游戏玩法分析 I","frequency":1.3787942601,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"","submitted":29755,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.538380762364801,"acs":20508,"articleLive":2,"columnArticles":161,"formTitle":"[512]游戏玩法分析 II","frequency":0.4378109156,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"","submitted":38092,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.731230601459609,"acs":61019,"articleLive":2,"columnArticles":684,"formTitle":"[513]找树左下角的值","frequency":0.9548670892,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":83447,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.4988393402565669,"acs":20415,"articleLive":2,"columnArticles":254,"formTitle":"[514]自由之路","frequency":0.4105017363,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":40925,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6494058697208304,"acs":45361,"articleLive":2,"columnArticles":487,"formTitle":"[515]在每个树行中找最大值","frequency":0.8989866308,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":69850,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.658291010143876,"acs":96175,"articleLive":2,"columnArticles":694,"formTitle":"[516]最长回文子序列","frequency":3.1055903029,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":146098,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5090073906795319,"acs":19835,"articleLive":2,"columnArticles":171,"formTitle":"[517]超级洗衣机","frequency":2.8498107946,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":38968,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6645448375514493,"acs":121415,"articleLive":2,"columnArticles":754,"formTitle":"[518]零钱兑换 II","frequency":3.0820630621,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":182704,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.4700796745211053,"acs":19411,"articleLive":2,"columnArticles":190,"formTitle":"[519]随机翻转矩阵","frequency":2.4188123845,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":41293,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5759969839142092,"acs":68751,"articleLive":2,"columnArticles":1053,"formTitle":"[520]检测大写字母","frequency":2.1098323144,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"ac","submitted":119360,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7127845420857597,"acs":26929,"articleLive":2,"columnArticles":273,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.3843222307,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":37780,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3631656804733728,"acs":7365,"articleLive":2,"columnArticles":116,"formTitle":"[522]最长特殊序列 II","frequency":1.3787942601,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":20280,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.27644043219626185,"acs":72635,"articleLive":2,"columnArticles":627,"formTitle":"[523]连续的子数组和","frequency":1.0804236231,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":262751,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.49670836922839545,"acs":77261,"articleLive":2,"columnArticles":795,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":2.5386831036,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":155546,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5373283562191707,"acs":48366,"articleLive":2,"columnArticles":546,"formTitle":"[525]连续数组","frequency":2.5467606919,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":90012,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.734519587888453,"acs":35005,"articleLive":2,"columnArticles":400,"formTitle":"[526]优美的排列","frequency":3.076289374,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":47657,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5771269177126918,"acs":2069,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"","submitted":3585,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.47945244343570464,"acs":33799,"articleLive":2,"columnArticles":268,"formTitle":"[528]按权重随机选择","frequency":2.5211510977,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":70495,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6433453460917112,"acs":41416,"articleLive":2,"columnArticles":483,"formTitle":"[529]扫雷游戏","frequency":1.5805729889,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":64376,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6214126162807136,"acs":87910,"articleLive":2,"columnArticles":704,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.3118267287,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":141468,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6627570694087404,"acs":4125,"articleLive":2,"columnArticles":80,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"","submitted":6224,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37950672201051155,"acs":26789,"articleLive":2,"columnArticles":298,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.3591952806,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":70589,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5260184359203093,"acs":1769,"articleLive":2,"columnArticles":35,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"","submitted":3363,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6753891740745378,"acs":16183,"articleLive":2,"columnArticles":150,"formTitle":"[534]游戏玩法分析 III","frequency":0.4961705308,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"","submitted":23961,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8447417391741688,"acs":16796,"articleLive":2,"columnArticles":109,"formTitle":"[535]TinyURL 的加密与解密","frequency":0.9844113355,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":19883,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5365189777710571,"acs":3548,"articleLive":2,"columnArticles":58,"formTitle":"[536]从字符串生成二叉树","frequency":1.0470983134,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"","submitted":6613,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7133608341927352,"acs":12451,"articleLive":2,"columnArticles":192,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":17454,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7124933465135731,"acs":121810,"articleLive":2,"columnArticles":936,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":1.4646691714,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":170963,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.6011936239329153,"acs":15916,"articleLive":2,"columnArticles":221,"formTitle":"[539]最小时间差","frequency":1.9948205886,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":26474,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5840174637399724,"acs":43608,"articleLive":2,"columnArticles":448,"formTitle":"[540]有序数组中的单一元素","frequency":2.0784114172,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":74669,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6020170226897005,"acs":83392,"articleLive":2,"columnArticles":878,"formTitle":"[541]反转字符串 II","frequency":2.6186371522,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":138521,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4574904115862385,"acs":79919,"articleLive":2,"columnArticles":725,"formTitle":"[542]01 矩阵","frequency":2.7344757406,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":174690,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5572869388124244,"acs":166373,"articleLive":2,"columnArticles":1335,"formTitle":"[543]二叉树的直径","frequency":3.4260229961,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":298541,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7112737920937042,"acs":2429,"articleLive":2,"columnArticles":57,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"","submitted":3415,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.4243286299499317,"acs":3729,"articleLive":2,"columnArticles":80,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"","submitted":8788,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6259121128587644,"acs":15440,"articleLive":2,"columnArticles":124,"formTitle":"[546]移除盒子","frequency":0.5274230743,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":24668,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6190557153613674,"acs":178410,"articleLive":2,"columnArticles":1250,"formTitle":"[547]省份数量","frequency":1.9625075996,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":288197,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3565667011375388,"acs":1724,"articleLive":2,"columnArticles":42,"formTitle":"[548]将数组分割成和相等的子数组","frequency":1.0151262807,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"","submitted":4835,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.4901390907203654,"acs":2361,"articleLive":2,"columnArticles":53,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"","submitted":4817,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4381902168925327,"acs":14324,"articleLive":2,"columnArticles":197,"formTitle":"[550]游戏玩法分析 IV","frequency":1.4467860052,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"","submitted":32689,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5676038226342132,"acs":61354,"articleLive":2,"columnArticles":777,"formTitle":"[551]学生出勤记录 I","frequency":2.3519723664,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":108093,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5771582523134591,"acs":24636,"articleLive":2,"columnArticles":289,"formTitle":"[552]学生出勤记录 II","frequency":2.3202572347,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":42685,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.606492027334852,"acs":6390,"articleLive":2,"columnArticles":99,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":10536,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5043264733395697,"acs":47443,"articleLive":2,"columnArticles":497,"formTitle":"[554]砖墙","frequency":2.1423630639,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":94072,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3446459918080749,"acs":1178,"articleLive":2,"columnArticles":24,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"","submitted":3418,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.3297208009346924,"acs":16368,"articleLive":2,"columnArticles":247,"formTitle":"[556]下一个更大元素 III","frequency":2.1760816999,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":49642,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7437405159332322,"acs":188208,"articleLive":2,"columnArticles":1572,"formTitle":"[557]反转字符串中的单词 III","frequency":3.3184385375,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":253056,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5057021831215379,"acs":3104,"articleLive":2,"columnArticles":42,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":6138,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7401272443592916,"acs":91553,"articleLive":2,"columnArticles":811,"formTitle":"[559]N 叉树的最大深度","frequency":1.93130382,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":123699,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4464625263661018,"acs":171872,"articleLive":2,"columnArticles":1046,"formTitle":"[560]和为 K 的子数组","frequency":3.7646556933,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":384964,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7767131712685722,"acs":95980,"articleLive":2,"columnArticles":795,"formTitle":"[561]数组拆分 I","frequency":1.3158804347,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":123572,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.472565386755704,"acs":4246,"articleLive":2,"columnArticles":70,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.4961705308,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"","submitted":8985,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.654291538361452,"acs":60344,"articleLive":2,"columnArticles":607,"formTitle":"[563]二叉树的坡度","frequency":2.238213481,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":92228,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.182299865617201,"acs":4748,"articleLive":2,"columnArticles":85,"formTitle":"[564]寻找最近的回文数","frequency":1.0804236231,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":26045,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6070588235294118,"acs":15480,"articleLive":2,"columnArticles":153,"formTitle":"[565]数组嵌套","frequency":0.9548670892,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":25500,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6779607214161008,"acs":81158,"articleLive":2,"columnArticles":761,"formTitle":"[566]重塑矩阵","frequency":2.4222824414,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":119709,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4338007906401972,"acs":141118,"articleLive":2,"columnArticles":1272,"formTitle":"[567]字符串的排列","frequency":3.0288590261,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":325306,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5071428571428571,"acs":1278,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"","submitted":2520,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.564380632350695,"acs":11085,"articleLive":2,"columnArticles":168,"formTitle":"[569]员工薪水中位数","frequency":1.9251898366,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"","submitted":19641,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6568837666398643,"acs":14705,"articleLive":2,"columnArticles":120,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.4378109156,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"","submitted":22386,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4767860526814478,"acs":7548,"articleLive":2,"columnArticles":101,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.4663353824,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"","submitted":15831,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4740726787847544,"acs":95638,"articleLive":2,"columnArticles":826,"formTitle":"[572]另一棵树的子树","frequency":2.5686434032,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":201737,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6573134328358209,"acs":1101,"articleLive":2,"columnArticles":35,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"","submitted":1675,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6503834915997078,"acs":14246,"articleLive":2,"columnArticles":121,"formTitle":"[574]当选者","frequency":0.4663353824,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"","submitted":21904,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.7117938311688312,"acs":87693,"articleLive":2,"columnArticles":844,"formTitle":"[575]分糖果","frequency":3.0405006011,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"ac","submitted":123200,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.46855471116727543,"acs":27067,"articleLive":2,"columnArticles":293,"formTitle":"[576]出界的路径数","frequency":2.0283208182,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":57767,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.6995546282550255,"acs":17435,"articleLive":2,"columnArticles":94,"formTitle":"[577]员工奖金","frequency":1.5805729889,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"","submitted":24923,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4851429069362147,"acs":11135,"articleLive":2,"columnArticles":125,"formTitle":"[578]查询回答率最高的问题","frequency":1.0470983134,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"","submitted":22952,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.40975192472198463,"acs":8622,"articleLive":2,"columnArticles":139,"formTitle":"[579]查询员工的累计薪水","frequency":0.4663353824,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"","submitted":21042,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5229947987955106,"acs":11463,"articleLive":2,"columnArticles":87,"formTitle":"[580]统计各专业学生人数","frequency":1.4467860052,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"","submitted":21918,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40621132631291235,"acs":107005,"articleLive":2,"columnArticles":915,"formTitle":"[581]最短无序连续子数组","frequency":2.9966155021,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":263422,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.41853078024337864,"acs":9355,"articleLive":2,"columnArticles":144,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"","submitted":22352,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.627106964330639,"acs":57332,"articleLive":2,"columnArticles":538,"formTitle":"[583]两个字符串的删除操作","frequency":3.1889159108,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":91423,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7743686805797679,"acs":15547,"articleLive":2,"columnArticles":66,"formTitle":"[584]寻找用户推荐人","frequency":0.4663353824,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"","submitted":20077,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5724125320004876,"acs":9391,"articleLive":2,"columnArticles":115,"formTitle":"[585]2016年的投资","frequency":0.4663353824,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"","submitted":16406,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7424099311833761,"acs":16506,"articleLive":2,"columnArticles":93,"formTitle":"[586]订单最多的客户","frequency":1.4121084668,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"","submitted":22233,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3881644934804413,"acs":2322,"articleLive":2,"columnArticles":40,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5982,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.42407088358355893,"acs":1723,"articleLive":2,"columnArticles":31,"formTitle":"[588]设计内存文件系统","frequency":1.6905738841,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"","submitted":4063,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7467197162319114,"acs":95153,"articleLive":2,"columnArticles":611,"formTitle":"[589]N 叉树的前序遍历","frequency":1.4379831315,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":127428,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7637604004676664,"acs":67285,"articleLive":2,"columnArticles":503,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":88097,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3424657534246575,"acs":1950,"articleLive":2,"columnArticles":44,"formTitle":"[591]标签验证器","frequency":1.4121084668,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5694,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5282691264243082,"acs":4868,"articleLive":2,"columnArticles":117,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":9215,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44260700389105057,"acs":9100,"articleLive":2,"columnArticles":147,"formTitle":"[593]有效的正方形","frequency":1.5805729889,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":20560,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5659317803660566,"acs":59862,"articleLive":2,"columnArticles":545,"formTitle":"[594]最长和谐子序列","frequency":2.3519723664,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":105776,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7893019754060159,"acs":110080,"articleLive":2,"columnArticles":252,"formTitle":"[595]大的国家","frequency":1.9625075996,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":139465,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.43300653594771243,"acs":88510,"articleLive":2,"columnArticles":315,"formTitle":"[596]超过5名学生的课","frequency":2.1098323144,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":204408,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4419190954581917,"acs":11569,"articleLive":2,"columnArticles":88,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.4378109156,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"","submitted":26179,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5710728928460279,"acs":42204,"articleLive":2,"columnArticles":495,"formTitle":"[598]范围求和 II","frequency":2.3519723664,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":73903,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5221653878942881,"acs":31850,"articleLive":2,"columnArticles":306,"formTitle":"[599]两个列表的最小索引总和","frequency":0.4663353824,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":60996,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.48197121249085145,"acs":19756,"articleLive":2,"columnArticles":239,"formTitle":"[600]不含连续1的非负整数","frequency":2.3847980707,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40990,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5046881910659,"acs":34233,"articleLive":2,"columnArticles":408,"formTitle":"[601]体育馆的人流量","frequency":1.6449038473,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":67830,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.619888602092107,"acs":9126,"articleLive":2,"columnArticles":98,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":1.1515773834,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"","submitted":14722,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6685052143684821,"acs":14423,"articleLive":2,"columnArticles":126,"formTitle":"[603]连续空余座位","frequency":1.0470983134,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"","submitted":21575,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37545787545787546,"acs":2665,"articleLive":2,"columnArticles":62,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"","submitted":7098,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3323041482479327,"acs":117421,"articleLive":2,"columnArticles":1355,"formTitle":"[605]种花问题","frequency":2.6315572286,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":353354,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5734306676180544,"acs":31342,"articleLive":2,"columnArticles":342,"formTitle":"[606]根据二叉树创建字符串","frequency":0.4105017363,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":54657,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6618401495900657,"acs":13804,"articleLive":2,"columnArticles":96,"formTitle":"[607]销售员","frequency":1.4467860052,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"","submitted":20857,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6210518583810783,"acs":8455,"articleLive":2,"columnArticles":109,"formTitle":"[608]树节点","frequency":1.0470983134,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"","submitted":13614,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.48894740489224586,"acs":7056,"articleLive":2,"columnArticles":110,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":14431,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6643990929705216,"acs":11720,"articleLive":2,"columnArticles":81,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"","submitted":17640,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5325059619409159,"acs":54707,"articleLive":2,"columnArticles":425,"formTitle":"[611]有效三角形的个数","frequency":3.9907854729,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":102735,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.663655982735193,"acs":8303,"articleLive":2,"columnArticles":71,"formTitle":"[612]平面上的最近距离","frequency":1.0470983134,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"","submitted":12511,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8145971563981043,"acs":12891,"articleLive":2,"columnArticles":89,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"","submitted":15825,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.35245558641153424,"acs":9265,"articleLive":2,"columnArticles":75,"formTitle":"[614]二级关注者","frequency":1.3787942601,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"","submitted":26287,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.4240434037692747,"acs":5940,"articleLive":2,"columnArticles":95,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"","submitted":14008,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.4681666460625541,"acs":3787,"articleLive":2,"columnArticles":64,"formTitle":"[616]给字符串添加加粗标签","frequency":1.3467470827,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"","submitted":8089,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.786765378270523,"acs":215093,"articleLive":2,"columnArticles":1416,"formTitle":"[617]合并二叉树","frequency":3.1325788523,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":273389,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6207939966109901,"acs":5129,"articleLive":2,"columnArticles":51,"formTitle":"[618]学生地理信息报告","frequency":0.4105017363,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"","submitted":8262,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4637591691480863,"acs":12771,"articleLive":2,"columnArticles":87,"formTitle":"[619]只出现一次的最大数字","frequency":0.9844113355,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"","submitted":27538,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7728405412329118,"acs":99555,"articleLive":2,"columnArticles":337,"formTitle":"[620]有趣的电影","frequency":1.7587599787,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":128817,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5746962262345722,"acs":84093,"articleLive":2,"columnArticles":545,"formTitle":"[621]任务调度器","frequency":3.076289374,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":146326,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.44052925387188097,"acs":72049,"articleLive":2,"columnArticles":475,"formTitle":"[622]设计循环队列","frequency":2.0784114172,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":163551,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5471250740960285,"acs":11999,"articleLive":2,"columnArticles":203,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":21931,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.42348237004725553,"acs":2330,"articleLive":2,"columnArticles":54,"formTitle":"[624]数组列表中的最大距离","frequency":0.8989866308,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"","submitted":5502,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3446008154675786,"acs":2620,"articleLive":2,"columnArticles":55,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"","submitted":7603,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.684324293975633,"acs":48754,"articleLive":2,"columnArticles":386,"formTitle":"[626]换座位","frequency":0.9264156679,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":71244,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8092823469651467,"acs":90812,"articleLive":2,"columnArticles":371,"formTitle":"[627]变更性别","frequency":0.9548670892,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":112213,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5243850445807923,"acs":84867,"articleLive":2,"columnArticles":809,"formTitle":"[628]三个数的最大乘积","frequency":1.5805729889,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":161841,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.521867254199945,"acs":18949,"articleLive":2,"columnArticles":172,"formTitle":"[629]K个逆序对数组","frequency":2.8498107946,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"ac","submitted":36310,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.46375723989301315,"acs":24101,"articleLive":2,"columnArticles":227,"formTitle":"[630]课程表 III","frequency":1.1896627174,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":51969,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2951822584756564,"acs":1158,"articleLive":2,"columnArticles":36,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"","submitted":3923,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5991008899354721,"acs":19590,"articleLive":2,"columnArticles":249,"formTitle":"[632]最小区间","frequency":0.3843222307,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":32699,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39508020110126885,"acs":99015,"articleLive":2,"columnArticles":809,"formTitle":"[633]平方数之和","frequency":1.257384228,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":250620,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.44021739130434784,"acs":1458,"articleLive":2,"columnArticles":22,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"","submitted":3312,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5533933349549988,"acs":4550,"articleLive":2,"columnArticles":74,"formTitle":"[635]设计日志存储系统","frequency":0.4378109156,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"","submitted":8222,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5581907591435303,"acs":10897,"articleLive":2,"columnArticles":126,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":19522,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6913375817485407,"acs":82666,"articleLive":2,"columnArticles":707,"formTitle":"[637]二叉树的层平均值","frequency":1.2861163328,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":119574,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.6457342782811519,"acs":28792,"articleLive":2,"columnArticles":278,"formTitle":"[638]大礼包","frequency":2.3399529909,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"ac","submitted":44588,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.3761678383289587,"acs":20494,"articleLive":2,"columnArticles":275,"formTitle":"[639]解码方法 II","frequency":2.3399529909,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":54481,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42652128297362113,"acs":11383,"articleLive":2,"columnArticles":227,"formTitle":"[640]求解方程","frequency":0.4105017363,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":26688,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5314446318156267,"acs":23636,"articleLive":2,"columnArticles":269,"formTitle":"[641]设计循环双端队列","frequency":0.9264156679,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":44475,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.49886024899175874,"acs":2845,"articleLive":2,"columnArticles":60,"formTitle":"[642]设计搜索自动补全系统","frequency":0.5274230743,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"","submitted":5703,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.44820581374013785,"acs":68398,"articleLive":2,"columnArticles":618,"formTitle":"[643]子数组最大平均数 I","frequency":1.3158804347,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":152604,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4050469103849887,"acs":1252,"articleLive":2,"columnArticles":26,"formTitle":"[644]子数组最大平均数 II","frequency":1.5206748473,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"","submitted":3091,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.42891032830492254,"acs":73043,"articleLive":2,"columnArticles":739,"formTitle":"[645]错误的集合","frequency":0.8989866308,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":170299,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5806551518761167,"acs":24373,"articleLive":2,"columnArticles":223,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":41975,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6591388450795219,"acs":138754,"articleLive":2,"columnArticles":1012,"formTitle":"[647]回文子串","frequency":2.8498107946,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":210508,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5902350904483529,"acs":23525,"articleLive":2,"columnArticles":310,"formTitle":"[648]单词替换","frequency":1.0151262807,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":39857,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4801301788363671,"acs":30096,"articleLive":2,"columnArticles":318,"formTitle":"[649]Dota2 参议院","frequency":1.3787942601,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":62683,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5677543608650195,"acs":51589,"articleLive":2,"columnArticles":679,"formTitle":"[650]只有两个键的键盘","frequency":2.3047938061,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":90865,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5819884726224784,"acs":4039,"articleLive":2,"columnArticles":67,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"","submitted":6940,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5714177222880403,"acs":37621,"articleLive":2,"columnArticles":269,"formTitle":"[652]寻找重复的子树","frequency":2.7822175035,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":65838,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.6018530238209756,"acs":47550,"articleLive":2,"columnArticles":486,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"ac","submitted":79006,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8097277594259027,"acs":71086,"articleLive":2,"columnArticles":708,"formTitle":"[654]最大二叉树","frequency":2.2311010755,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":87790,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.6002835706268093,"acs":10161,"articleLive":2,"columnArticles":155,"formTitle":"[655]输出二叉树","frequency":1.6449038473,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":16927,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.3102521008403361,"acs":923,"articleLive":2,"columnArticles":27,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"","submitted":2975,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7832396960413176,"acs":84622,"articleLive":2,"columnArticles":651,"formTitle":"[657]机器人能否返回原点","frequency":0.4105017363,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":108041,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45427113046089174,"acs":30259,"articleLive":2,"columnArticles":269,"formTitle":"[658]找到 K 个最接近的元素","frequency":1.5501060475,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":66610,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5420626409791813,"acs":29318,"articleLive":2,"columnArticles":270,"formTitle":"[659]分割数组为连续子序列","frequency":0.3350511817,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":54086,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6386831275720165,"acs":776,"articleLive":2,"columnArticles":26,"formTitle":"[660]移除 9","frequency":0.7982980285,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"","submitted":1215,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5637882130475891,"acs":17889,"articleLive":2,"columnArticles":231,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":31730,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.40938970643161277,"acs":32883,"articleLive":2,"columnArticles":317,"formTitle":"[662]二叉树最大宽度","frequency":2.270909487,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":80322,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4589928057553957,"acs":1914,"articleLive":2,"columnArticles":38,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"","submitted":4170,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6539250527289012,"acs":22633,"articleLive":2,"columnArticles":195,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":34611,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2716473192104431,"acs":78182,"articleLive":2,"columnArticles":982,"formTitle":"[665]非递减数列","frequency":1.8548769354,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":287807,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6164235548352242,"acs":2282,"articleLive":2,"columnArticles":83,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"","submitted":3702,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.623568281938326,"acs":8493,"articleLive":2,"columnArticles":127,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":13620,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5134697184525016,"acs":7605,"articleLive":2,"columnArticles":83,"formTitle":"[668]乘法表中第k小的数","frequency":0.4663353824,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":14811,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6656965185998059,"acs":41857,"articleLive":2,"columnArticles":350,"formTitle":"[669]修剪二叉搜索树","frequency":0.3118267287,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":62877,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.45642374964953525,"acs":21163,"articleLive":2,"columnArticles":317,"formTitle":"[670]最大交换","frequency":2.5467606919,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":46367,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48503729857901934,"acs":56048,"articleLive":2,"columnArticles":704,"formTitle":"[671]二叉树中第二小的节点","frequency":2.5148554335,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":115554,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5465846811923539,"acs":4089,"articleLive":2,"columnArticles":47,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.4378109156,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":7481,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.43668290074932964,"acs":52274,"articleLive":2,"columnArticles":439,"formTitle":"[673]最长递增子序列的个数","frequency":3.3124343166,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":119707,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.5045580082854684,"acs":100845,"articleLive":2,"columnArticles":840,"formTitle":"[674]最长连续递增序列","frequency":2.1098323144,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":199868,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.40461771385314155,"acs":3207,"articleLive":2,"columnArticles":53,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.5274230743,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7926,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.594632768361582,"acs":8420,"articleLive":2,"columnArticles":143,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":14160,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6667439000481223,"acs":37409,"articleLive":2,"columnArticles":561,"formTitle":"[677]键值映射","frequency":1.6449038473,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":56107,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.38637839615273956,"acs":47001,"articleLive":2,"columnArticles":501,"formTitle":"[678]有效的括号字符串","frequency":3.1325788523,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":121645,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5401846347656635,"acs":27443,"articleLive":2,"columnArticles":272,"formTitle":"[679]24 点游戏","frequency":3.352762362,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":50803,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4002601265045183,"acs":94477,"articleLive":2,"columnArticles":885,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":1.5206748473,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":236039,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5023376623376623,"acs":2901,"articleLive":2,"columnArticles":69,"formTitle":"[681]最近时刻","frequency":0.5946753013,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"","submitted":5775,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6939571980018165,"acs":48899,"articleLive":2,"columnArticles":548,"formTitle":"[682]棒球比赛","frequency":0.9844113355,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":70464,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4359944941500344,"acs":2534,"articleLive":2,"columnArticles":54,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"","submitted":5812,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6669660647732317,"acs":64603,"articleLive":2,"columnArticles":650,"formTitle":"[684]冗余连接","frequency":0.9548670892,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":96861,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4282529553728474,"acs":20939,"articleLive":2,"columnArticles":264,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":48894,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.4015981282842291,"acs":42569,"articleLive":2,"columnArticles":568,"formTitle":"[686]重复叠加字符串匹配","frequency":0.6771684607,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":105999,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4437865280656162,"acs":40472,"articleLive":2,"columnArticles":288,"formTitle":"[687]最长同值路径","frequency":1.7587599787,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":91197,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5136145221569675,"acs":8658,"articleLive":2,"columnArticles":114,"formTitle":"[688]“马”在棋盘上的概率","frequency":1.6449038473,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":16857,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.5624100465641315,"acs":19929,"articleLive":2,"columnArticles":266,"formTitle":"[689]三个无重叠子数组的最大和","frequency":1.93130382,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":35435,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6492426459003848,"acs":57693,"articleLive":2,"columnArticles":589,"formTitle":"[690]员工的重要性","frequency":0.9844113355,"frontendQuestionId":"690","leaf":true,"level":2,"nodeType":"def","questionId":"690","status":"ac","submitted":88862,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.48777607180819654,"acs":4130,"articleLive":2,"columnArticles":53,"formTitle":"[691]贴纸拼词","frequency":1.0804236231,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":8467,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5741865233909298,"acs":72243,"articleLive":2,"columnArticles":792,"formTitle":"[692]前K个高频单词","frequency":1.8548769354,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":125818,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6090347741306468,"acs":28110,"articleLive":2,"columnArticles":319,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":46155,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5387504267668146,"acs":4734,"articleLive":2,"columnArticles":90,"formTitle":"[694]不同岛屿的数量","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"","submitted":8787,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6682623348967363,"acs":151884,"articleLive":2,"columnArticles":1504,"formTitle":"[695]岛屿的最大面积","frequency":3.2312538599,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":227282,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6338306502871803,"acs":54846,"articleLive":2,"columnArticles":494,"formTitle":"[696]计数二进制子串","frequency":1.5805729889,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":86531,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6040431663392556,"acs":69799,"articleLive":2,"columnArticles":886,"formTitle":"[697]数组的度","frequency":0.4105017363,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":115553,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.4500638435109982,"acs":34190,"articleLive":2,"columnArticles":243,"formTitle":"[698]划分为k个相等的子集","frequency":2.7246476517,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":75967,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.48286903618315724,"acs":3016,"articleLive":2,"columnArticles":45,"formTitle":"[699]掉落的方块","frequency":0.5274230743,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":6246,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7742498682904716,"acs":126387,"articleLive":2,"columnArticles":825,"formTitle":"[700]二叉搜索树中的搜索","frequency":1.9625075996,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"ac","submitted":163238,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7215962441314554,"acs":89146,"articleLive":2,"columnArticles":659,"formTitle":"[701]二叉搜索树中的插入操作","frequency":1.2027656303,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"ac","submitted":123540,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7433494558645707,"acs":4918,"articleLive":2,"columnArticles":86,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"","submitted":6616,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5139961505594467,"acs":64359,"articleLive":2,"columnArticles":595,"formTitle":"[703]数据流中的第 K 大元素","frequency":1.6121462508,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":125213,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5481759724234286,"acs":382936,"articleLive":2,"columnArticles":1834,"formTitle":"[704]二分查找","frequency":4.7050942177,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":698564,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6425594162796641,"acs":72917,"articleLive":2,"columnArticles":458,"formTitle":"[705]设计哈希集合","frequency":2.6776837758,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":113479,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6416003976143141,"acs":64545,"articleLive":2,"columnArticles":421,"formTitle":"[706]设计哈希映射","frequency":1.3158804347,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":100600,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3260482739852205,"acs":77875,"articleLive":2,"columnArticles":522,"formTitle":"[707]设计链表","frequency":2.5686434032,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":238845,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.35052994509002683,"acs":2745,"articleLive":2,"columnArticles":57,"formTitle":"[708]循环有序列表的插入","frequency":0.5602128972,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"","submitted":7831,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.772982062780269,"acs":99288,"articleLive":2,"columnArticles":721,"formTitle":"[709]转换成小写字母","frequency":0.7308870677,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":128448,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3627398878063183,"acs":6143,"articleLive":2,"columnArticles":70,"formTitle":"[710]黑名单中的随机数","frequency":0.4105017363,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":16935,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5549335199440167,"acs":793,"articleLive":2,"columnArticles":27,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"","submitted":1429,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6760224538893344,"acs":16860,"articleLive":2,"columnArticles":195,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.9264156679,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":24940,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.42729575408921133,"acs":29859,"articleLive":2,"columnArticles":260,"formTitle":"[713]乘积小于K的子数组","frequency":2.2852809919,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":69879,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7277296394030698,"acs":112793,"articleLive":2,"columnArticles":767,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":2.0114171027,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":154993,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.4097433066519459,"acs":2969,"articleLive":2,"columnArticles":51,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":7246,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4660556003223207,"acs":4627,"articleLive":2,"columnArticles":84,"formTitle":"[716]最大栈","frequency":0.4663353824,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"ac","submitted":9928,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5116820978064998,"acs":32938,"articleLive":2,"columnArticles":404,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":64372,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5649205890150146,"acs":93761,"articleLive":2,"columnArticles":635,"formTitle":"[718]最长重复子数组","frequency":2.7076878266,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":165972,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.37676430414326906,"acs":9930,"articleLive":2,"columnArticles":94,"formTitle":"[719]找出第 k 小的距离对","frequency":2.2110747734,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":26356,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48457475793268223,"acs":23121,"articleLive":2,"columnArticles":312,"formTitle":"[720]词典中最长的单词","frequency":1.2861163328,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":47714,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.471687008239886,"acs":30454,"articleLive":2,"columnArticles":348,"formTitle":"[721]账户合并","frequency":0.9844113355,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":64564,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3220899470899471,"acs":5357,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":1.9251898366,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":16632,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.723091976516634,"acs":1478,"articleLive":2,"columnArticles":42,"formTitle":"[723]粉碎糖果","frequency":0.7526696758,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"","submitted":2044,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4707533794251769,"acs":150409,"articleLive":2,"columnArticles":931,"formTitle":"[724]寻找数组的中心下标","frequency":1.9011386532,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"ac","submitted":319507,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6084530366850271,"acs":50703,"articleLive":2,"columnArticles":653,"formTitle":"[725]分隔链表","frequency":2.5148554335,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":83331,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5524222348102357,"acs":22430,"articleLive":2,"columnArticles":408,"formTitle":"[726]原子的数量","frequency":2.2066277523,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":40603,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4076693968726731,"acs":3285,"articleLive":2,"columnArticles":55,"formTitle":"[727]最小窗口子序列","frequency":2.04207241,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"","submitted":8058,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7579292128895933,"acs":35869,"articleLive":2,"columnArticles":327,"formTitle":"[728]自除数","frequency":0.4105017363,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":47325,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5201523325928277,"acs":9834,"articleLive":2,"columnArticles":121,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":18906,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4960350337318026,"acs":4191,"articleLive":2,"columnArticles":52,"formTitle":"[730]统计不同回文子序列","frequency":1.4829345194,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8449,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5035095415661329,"acs":4591,"articleLive":2,"columnArticles":50,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":9118,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.617979341510652,"acs":3829,"articleLive":2,"columnArticles":59,"formTitle":"[732]我的日程安排表 III","frequency":1.4121084668,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":6196,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5794989997390624,"acs":79950,"articleLive":2,"columnArticles":670,"formTitle":"[733]图像渲染","frequency":2.7904109127,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":137964,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.47629039026437264,"acs":2270,"articleLive":2,"columnArticles":41,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"","submitted":4766,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.41066876529058527,"acs":24004,"articleLive":2,"columnArticles":302,"formTitle":"[735]行星碰撞","frequency":2.7428713906,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":58451,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.46913229018492175,"acs":1649,"articleLive":2,"columnArticles":48,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3515,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4683768244139761,"acs":4236,"articleLive":2,"columnArticles":75,"formTitle":"[737]句子相似性 II","frequency":0.5274230743,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"","submitted":9044,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5014639664618592,"acs":45215,"articleLive":2,"columnArticles":620,"formTitle":"[738]单调递增的数字","frequency":1.8548769354,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":90166,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6834369552585706,"acs":235239,"articleLive":2,"columnArticles":1656,"formTitle":"[739]每日温度","frequency":3.4765295065,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":344200,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.628210246174318,"acs":61373,"articleLive":2,"columnArticles":679,"formTitle":"[740]删除并获得点数","frequency":2.7076878266,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":97695,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.37049952053003227,"acs":4250,"articleLive":2,"columnArticles":49,"formTitle":"[741]摘樱桃","frequency":1.9160955579,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":11471,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.49001967950520103,"acs":1743,"articleLive":2,"columnArticles":49,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"","submitted":3557,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5264751880445846,"acs":63624,"articleLive":2,"columnArticles":564,"formTitle":"[743]网络延迟时间","frequency":2.6315572286,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":120849,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4591602857289686,"acs":44674,"articleLive":2,"columnArticles":400,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.3118267287,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":97295,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.40225052553480894,"acs":3253,"articleLive":2,"columnArticles":59,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":8087,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5991730085676915,"acs":158960,"articleLive":2,"columnArticles":1484,"formTitle":"[746]使用最小花费爬楼梯","frequency":2.2942362756,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":265299,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.42033542976939203,"acs":47318,"articleLive":2,"columnArticles":432,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":112572,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6820291719545905,"acs":39231,"articleLive":2,"columnArticles":496,"formTitle":"[748]最短补全词","frequency":0.8118741262,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":57521,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5046548956661316,"acs":1572,"articleLive":2,"columnArticles":37,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":3115,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7190635451505016,"acs":2150,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.8469457526,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"","submitted":2990,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.49425675675675673,"acs":1463,"articleLive":2,"columnArticles":28,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"","submitted":2960,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.530373130682968,"acs":76003,"articleLive":2,"columnArticles":638,"formTitle":"[752]打开转盘锁","frequency":1.257384228,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":143301,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.598261154855643,"acs":3647,"articleLive":2,"columnArticles":49,"formTitle":"[753]破解保险箱","frequency":1.0470983134,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":6096,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4331738599348534,"acs":8511,"articleLive":2,"columnArticles":100,"formTitle":"[754]到达终点数字","frequency":0.4961705308,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":19648,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.49822190611664297,"acs":1401,"articleLive":2,"columnArticles":32,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"","submitted":2812,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5562337515541992,"acs":4921,"articleLive":2,"columnArticles":73,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8847,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4239638767940655,"acs":2629,"articleLive":2,"columnArticles":40,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":6201,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4645061728395062,"acs":3612,"articleLive":2,"columnArticles":71,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"","submitted":7776,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6728658536585366,"acs":2207,"articleLive":2,"columnArticles":51,"formTitle":"[759]员工空闲时间","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"","submitted":3280,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8350863266521135,"acs":4208,"articleLive":2,"columnArticles":96,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"","submitted":5039,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5948759007205765,"acs":2229,"articleLive":2,"columnArticles":36,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3747,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.7024185459003603,"acs":18907,"articleLive":2,"columnArticles":166,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":26917,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7634352744030163,"acs":91116,"articleLive":2,"columnArticles":1066,"formTitle":"[763]划分字母区间","frequency":2.7272586192,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":119350,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4990467646069306,"acs":4450,"articleLive":2,"columnArticles":60,"formTitle":"[764]最大加号标志","frequency":0.4961705308,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8917,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6642204253823167,"acs":30230,"articleLive":2,"columnArticles":454,"formTitle":"[765]情侣牵手","frequency":1.6121462508,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":45512,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7062606885270281,"acs":56991,"articleLive":2,"columnArticles":653,"formTitle":"[766]托普利茨矩阵","frequency":0.3843222307,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":80694,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47781178709403765,"acs":41680,"articleLive":2,"columnArticles":504,"formTitle":"[767]重构字符串","frequency":2.5933116496,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":87231,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5136020976728941,"acs":6268,"articleLive":2,"columnArticles":91,"formTitle":"[768]最多能完成排序的块 II","frequency":0.3843222307,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":12204,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5845175766641735,"acs":14067,"articleLive":2,"columnArticles":170,"formTitle":"[769]最多能完成排序的块","frequency":0.4105017363,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":24066,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5640468953538862,"acs":1299,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2303,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8513523018075777,"acs":157358,"articleLive":2,"columnArticles":1171,"formTitle":"[771]宝石与石头","frequency":0.4105017363,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":184833,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.49757615223211055,"acs":6877,"articleLive":2,"columnArticles":131,"formTitle":"[772]基本计算器 III","frequency":1.0151262807,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"","submitted":13821,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7096179334985305,"acs":24628,"articleLive":2,"columnArticles":350,"formTitle":"[773]滑动谜题","frequency":0.9844113355,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":34706,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5955491049830672,"acs":1231,"articleLive":2,"columnArticles":23,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.6692532698,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"","submitted":2067,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4572769953051643,"acs":5357,"articleLive":2,"columnArticles":85,"formTitle":"[775]全局倒置与局部倒置","frequency":0.4961705308,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11715,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5701859628074385,"acs":1901,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"","submitted":3334,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.32434346736406233,"acs":5953,"articleLive":2,"columnArticles":66,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":1.1515773834,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":18354,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5929904173405103,"acs":24567,"articleLive":2,"columnArticles":357,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":41429,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.43678212190824545,"acs":19584,"articleLive":2,"columnArticles":243,"formTitle":"[779]第K个语法符号","frequency":1.6121462508,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":44837,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.28819642711477284,"acs":3533,"articleLive":2,"columnArticles":55,"formTitle":"[780]到达终点","frequency":0.5274230743,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":12259,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6131898007661784,"acs":44658,"articleLive":2,"columnArticles":683,"formTitle":"[781]森林中的兔子","frequency":1.9948205886,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":72829,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4162826420890937,"acs":1626,"articleLive":2,"columnArticles":34,"formTitle":"[782]变为棋盘","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3906,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.596610337889865,"acs":72058,"articleLive":2,"columnArticles":698,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.3350511817,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":120779,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6904898349024423,"acs":50606,"articleLive":2,"columnArticles":585,"formTitle":"[784]字母大小写全排列","frequency":1.9625075996,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":73290,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5168561553768634,"acs":44415,"articleLive":2,"columnArticles":442,"formTitle":"[785]判断二分图","frequency":1.8216777638,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":85933,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.6747739819185535,"acs":25302,"articleLive":2,"columnArticles":259,"formTitle":"[786]第 K 个最小的素数分数","frequency":2.1423630639,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":37497,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.38883430026401905,"acs":45508,"articleLive":2,"columnArticles":429,"formTitle":"[787]K 站中转内最便宜的航班","frequency":2.7714007404,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":117037,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.609107303877367,"acs":18914,"articleLive":2,"columnArticles":197,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":31052,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6903589477776338,"acs":21310,"articleLive":2,"columnArticles":301,"formTitle":"[789]逃脱阻碍者","frequency":2.3764833974,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30868,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4535600425079702,"acs":4268,"articleLive":2,"columnArticles":74,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.4378109156,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":9410,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6966928251121076,"acs":12429,"articleLive":2,"columnArticles":218,"formTitle":"[791]自定义字符串排序","frequency":0.9844113355,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":17840,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.46535633484162897,"acs":9873,"articleLive":2,"columnArticles":107,"formTitle":"[792]匹配子序列的单词数","frequency":1.4467860052,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":21216,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.39550310732490745,"acs":5664,"articleLive":2,"columnArticles":72,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":14321,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3895594406550296,"acs":28499,"articleLive":2,"columnArticles":462,"formTitle":"[794]有效的井字游戏","frequency":0.075284288,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":73157,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5297965980730344,"acs":8908,"articleLive":2,"columnArticles":101,"formTitle":"[795]区间子数组个数","frequency":1.8548769354,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":16814,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.540018948755973,"acs":26219,"articleLive":2,"columnArticles":331,"formTitle":"[796]旋转字符串","frequency":2.2066277523,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":48552,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7898707066253012,"acs":50156,"articleLive":2,"columnArticles":605,"formTitle":"[797]所有可能的路径","frequency":2.2031836297,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":63499,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4715372907153729,"acs":1549,"articleLive":2,"columnArticles":38,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":3285,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.41434888033090855,"acs":5810,"articleLive":2,"columnArticles":75,"formTitle":"[799]香槟塔","frequency":1.3787942601,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":14022,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7027027027027027,"acs":1586,"articleLive":2,"columnArticles":39,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"","submitted":2257,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4207686017988553,"acs":7719,"articleLive":2,"columnArticles":93,"formTitle":"[801]使序列递增的最小交换次数","frequency":1.6449038473,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":18345,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.577807991806897,"acs":32723,"articleLive":2,"columnArticles":344,"formTitle":"[802]找到最终的安全状态","frequency":2.4870320677,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":56633,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.47992351816443596,"acs":12550,"articleLive":2,"columnArticles":128,"formTitle":"[803]打砖块","frequency":1.5601432692,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":26150,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7739677177177177,"acs":41237,"articleLive":2,"columnArticles":424,"formTitle":"[804]唯一摩尔斯密码词","frequency":0.9548670892,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":53280,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2982943276477588,"acs":3008,"articleLive":2,"columnArticles":45,"formTitle":"[805]数组的均值分割","frequency":0.4961705308,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":10084,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6546736575664437,"acs":14484,"articleLive":2,"columnArticles":170,"formTitle":"[806]写字符串需要的行数","frequency":0.4105017363,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":22124,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8891088308960168,"acs":44018,"articleLive":2,"columnArticles":619,"formTitle":"[807]保持城市天际线","frequency":1.2003675476,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":49508,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.48383122882660917,"acs":4713,"articleLive":2,"columnArticles":43,"formTitle":"[808]分汤","frequency":0.5602128972,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9741,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.42112020542449047,"acs":5248,"articleLive":2,"columnArticles":100,"formTitle":"[809]情感丰富的文字","frequency":0.3843222307,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":12462,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7305044381900845,"acs":16871,"articleLive":2,"columnArticles":135,"formTitle":"[810]黑板异或游戏","frequency":0.4663353824,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":23095,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7062276121013336,"acs":16364,"articleLive":2,"columnArticles":209,"formTitle":"[811]子域名访问计数","frequency":0.9264156679,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":23171,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.633097793840013,"acs":11737,"articleLive":2,"columnArticles":111,"formTitle":"[812]最大三角形面积","frequency":0.4378109156,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":18539,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5541968162083937,"acs":7659,"articleLive":2,"columnArticles":91,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":13820,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.699683758753106,"acs":24780,"articleLive":2,"columnArticles":383,"formTitle":"[814]二叉树剪枝","frequency":1.3467470827,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":35416,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4327675734325351,"acs":27920,"articleLive":2,"columnArticles":326,"formTitle":"[815]公交路线","frequency":2.7714007404,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":64515,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5134955458050791,"acs":3862,"articleLive":2,"columnArticles":70,"formTitle":"[816]模糊坐标","frequency":0.5274230743,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":7521,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5925771302133345,"acs":14194,"articleLive":2,"columnArticles":177,"formTitle":"[817]链表组件","frequency":0.4663353824,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":23953,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.4340430325560437,"acs":3853,"articleLive":2,"columnArticles":48,"formTitle":"[818]赛车","frequency":0.5602128972,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8877,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42224284719867206,"acs":23657,"articleLive":2,"columnArticles":267,"formTitle":"[819]最常见的单词","frequency":0.3843222307,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":56027,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5097231612283386,"acs":57299,"articleLive":2,"columnArticles":629,"formTitle":"[820]单词的压缩编码","frequency":0.3843222307,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":112412,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6943471862789872,"acs":27367,"articleLive":2,"columnArticles":372,"formTitle":"[821]字符的最短距离","frequency":1.2861163328,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":39414,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5086415764819899,"acs":3149,"articleLive":2,"columnArticles":43,"formTitle":"[822]翻转卡片游戏","frequency":0.6309637533,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":6191,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4273743016759777,"acs":3213,"articleLive":2,"columnArticles":56,"formTitle":"[823]带因子的二叉树","frequency":0.4663353824,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":7518,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6175264481891175,"acs":17920,"articleLive":2,"columnArticles":250,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":29019,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.4542882711238128,"acs":31474,"articleLive":2,"columnArticles":312,"formTitle":"[825]适龄的朋友","frequency":1.237851267,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"ac","submitted":69282,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3812770420873214,"acs":8724,"articleLive":2,"columnArticles":128,"formTitle":"[826]安排工作以达到最大收益","frequency":1.5805729889,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":22881,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3924459630097304,"acs":10567,"articleLive":2,"columnArticles":204,"formTitle":"[827]最大人工岛","frequency":1.0470983134,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":26926,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.5030251864359082,"acs":3575,"articleLive":2,"columnArticles":57,"formTitle":"[828]统计子串中的唯一字符","frequency":0.4378109156,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":7107,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.367877673927496,"acs":9407,"articleLive":2,"columnArticles":111,"formTitle":"[829]连续整数求和","frequency":0.9844113355,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":25571,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5429367991636088,"acs":52970,"articleLive":2,"columnArticles":596,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":97562,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.40745877639081524,"acs":7932,"articleLive":2,"columnArticles":79,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":19467,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7955498896965751,"acs":87991,"articleLive":2,"columnArticles":963,"formTitle":"[832]翻转图像","frequency":0.4105017363,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":110604,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4382135922330097,"acs":5642,"articleLive":2,"columnArticles":84,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":12875,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.526840490797546,"acs":13740,"articleLive":2,"columnArticles":134,"formTitle":"[834]树中距离之和","frequency":1.1515773834,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":26080,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5759109311740891,"acs":4552,"articleLive":2,"columnArticles":52,"formTitle":"[835]图像重叠","frequency":0.4961705308,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7904,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4811356405349067,"acs":39469,"articleLive":2,"columnArticles":676,"formTitle":"[836]矩形重叠","frequency":1.8216777638,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":82033,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39578778457526825,"acs":19732,"articleLive":2,"columnArticles":247,"formTitle":"[837]新 21 点","frequency":1.1515773834,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":49855,"title":"新 21 点","titleSlug":"new-21-game"},{"acceptance":0.5012800819252432,"acs":7832,"articleLive":2,"columnArticles":139,"formTitle":"[838]推多米诺","frequency":2.4188123845,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":15624,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5751369304276891,"acs":19741,"articleLive":2,"columnArticles":277,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":34324,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3605210110094588,"acs":9300,"articleLive":2,"columnArticles":118,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25796,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6594815030585494,"acs":58864,"articleLive":2,"columnArticles":583,"formTitle":"[841]钥匙和房间","frequency":1.3158804347,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":89258,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.4875516935389355,"acs":29120,"articleLive":2,"columnArticles":325,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":1.8216777638,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":59727,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.38618445751470404,"acs":3086,"articleLive":2,"columnArticles":37,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7991,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5071850393700787,"acs":103060,"articleLive":2,"columnArticles":1101,"formTitle":"[844]比较含退格的字符串","frequency":1.1515773834,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":203200,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4219688650603966,"acs":39195,"articleLive":2,"columnArticles":575,"formTitle":"[845]数组中的最长山脉","frequency":1.8548769354,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":92886,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5729714150079686,"acs":33795,"articleLive":2,"columnArticles":480,"formTitle":"[846]一手顺子","frequency":0.7600787636,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":58982,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6790900460602651,"acs":19314,"articleLive":2,"columnArticles":161,"formTitle":"[847]访问所有节点的最短路径","frequency":2.9610364297,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":28441,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44856399251175744,"acs":9824,"articleLive":2,"columnArticles":108,"formTitle":"[848]字母移位","frequency":1.6449038473,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":21901,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42817580388737886,"acs":16698,"articleLive":2,"columnArticles":201,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":38998,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4489347311464322,"acs":2655,"articleLive":2,"columnArticles":45,"formTitle":"[850]矩形面积 II","frequency":2.1368609868,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5914,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.6287270285728496,"acs":25283,"articleLive":2,"columnArticles":272,"formTitle":"[851]喧闹和富有","frequency":0.9208502039,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":40213,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7138486787071486,"acs":89603,"articleLive":2,"columnArticles":773,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":125521,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38977757729275825,"acs":11233,"articleLive":2,"columnArticles":141,"formTitle":"[853]车队","frequency":1.6121462508,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":28819,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.36365078106415033,"acs":4586,"articleLive":2,"columnArticles":75,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12611,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4131403931886282,"acs":5653,"articleLive":2,"columnArticles":65,"formTitle":"[855]考场就座","frequency":0.4663353824,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":13683,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6297565242746757,"acs":17278,"articleLive":2,"columnArticles":235,"formTitle":"[856]括号的分数","frequency":2.6646454415,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":27436,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.47199541612949436,"acs":3295,"articleLive":2,"columnArticles":52,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.3843222307,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6981,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.555316091954023,"acs":3092,"articleLive":2,"columnArticles":52,"formTitle":"[858]镜面反射","frequency":1.8719480226,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5568,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.34580548332489836,"acs":59445,"articleLive":2,"columnArticles":753,"formTitle":"[859]亲密字符串","frequency":2.3847980707,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":171903,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5856132286660896,"acs":98099,"articleLive":2,"columnArticles":848,"formTitle":"[860]柠檬水找零","frequency":1.1767676322,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":167515,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8092922472221522,"acs":32120,"articleLive":2,"columnArticles":454,"formTitle":"[861]翻转矩阵后的得分","frequency":1.0804236231,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":39689,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.19673226636372748,"acs":17664,"articleLive":2,"columnArticles":139,"formTitle":"[862]和至少为 K 的最短子数组","frequency":2.1760816999,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":89787,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6062410709986035,"acs":37767,"articleLive":2,"columnArticles":585,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":2.6166649206,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":62297,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.4627489207631249,"acs":3323,"articleLive":2,"columnArticles":47,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.5602128972,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":7181,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6647098065376918,"acs":9964,"articleLive":2,"columnArticles":143,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.4105017363,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":14990,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22764615168933128,"acs":8119,"articleLive":2,"columnArticles":96,"formTitle":"[866]回文素数","frequency":1.0470983134,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":35665,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6687130425298192,"acs":85834,"articleLive":2,"columnArticles":770,"formTitle":"[867]转置矩阵","frequency":1.3467470827,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":128357,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6265767725097868,"acs":17286,"articleLive":2,"columnArticles":252,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":27588,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.6424869452973734,"acs":32851,"articleLive":2,"columnArticles":470,"formTitle":"[869]重新排序得到 2 的幂","frequency":1.8548769354,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"ac","submitted":51131,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4387225652467182,"acs":16911,"articleLive":2,"columnArticles":219,"formTitle":"[870]优势洗牌","frequency":1.5805729889,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":38546,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3469923824533754,"acs":10568,"articleLive":2,"columnArticles":135,"formTitle":"[871]最低加油次数","frequency":1.8548769354,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":30456,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6519449794824554,"acs":62279,"articleLive":2,"columnArticles":747,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":95528,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5198560398658832,"acs":16900,"articleLive":2,"columnArticles":127,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":1.8893488444,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":32509,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4196459697098811,"acs":21668,"articleLive":2,"columnArticles":243,"formTitle":"[874]模拟行走机器人","frequency":1.3787942601,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":51634,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.4824250743536948,"acs":52717,"articleLive":2,"columnArticles":414,"formTitle":"[875]爱吃香蕉的珂珂","frequency":1.6186003845,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":109275,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7059410128163839,"acs":181933,"articleLive":2,"columnArticles":1885,"formTitle":"[876]链表的中间结点","frequency":2.3764833974,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":257717,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7582159624413145,"acs":71383,"articleLive":2,"columnArticles":500,"formTitle":"[877]石子游戏","frequency":1.257384228,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":94146,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.28580814717477004,"acs":4785,"articleLive":2,"columnArticles":67,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":16742,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5527054905177342,"acs":22237,"articleLive":2,"columnArticles":188,"formTitle":"[879]盈利计划","frequency":1.8893488444,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":40233,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.25534062916447925,"acs":6323,"articleLive":2,"columnArticles":83,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":24763,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5380377698227262,"acs":50200,"articleLive":2,"columnArticles":609,"formTitle":"[881]救生艇","frequency":3.5678555268,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":93302,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4931377188831046,"acs":2084,"articleLive":2,"columnArticles":35,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":4226,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6937304828248859,"acs":11552,"articleLive":2,"columnArticles":124,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":16652,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6625254841997962,"acs":20798,"articleLive":2,"columnArticles":271,"formTitle":"[884]两句话中的不常见单词","frequency":1.0151262807,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":31392,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.697642915199133,"acs":5150,"articleLive":2,"columnArticles":77,"formTitle":"[885]螺旋矩阵 III","frequency":1.0151262807,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":7382,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.44098374606416474,"acs":10364,"articleLive":2,"columnArticles":138,"formTitle":"[886]可能的二分法","frequency":1.8548769354,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":23502,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2906897532036325,"acs":54193,"articleLive":2,"columnArticles":355,"formTitle":"[887]鸡蛋掉落","frequency":2.6646454415,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":186429,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6411227926451848,"acs":56347,"articleLive":2,"columnArticles":480,"formTitle":"[888]公平的糖果交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":87888,"title":"公平的糖果交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6747190337159541,"acs":16870,"articleLive":2,"columnArticles":168,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":1.8216777638,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":25003,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7279817236489681,"acs":9241,"articleLive":2,"columnArticles":133,"formTitle":"[890]查找和替换模式","frequency":0.4961705308,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12694,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.33152173913043476,"acs":2989,"articleLive":2,"columnArticles":40,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":9016,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6385367688546173,"acs":33951,"articleLive":2,"columnArticles":693,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":53170,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7246756650504521,"acs":11060,"articleLive":2,"columnArticles":112,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":15262,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.775677623191619,"acs":13994,"articleLive":2,"columnArticles":132,"formTitle":"[894]所有可能的满二叉树","frequency":0.4378109156,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":18041,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5593526382665686,"acs":8364,"articleLive":2,"columnArticles":95,"formTitle":"[895]最大频率栈","frequency":2.1423630639,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":14953,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5845448963204384,"acs":61877,"articleLive":2,"columnArticles":737,"formTitle":"[896]单调数列","frequency":0.3591952806,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":105855,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7428048864655946,"acs":64575,"articleLive":2,"columnArticles":742,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":86934,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3427227251071939,"acs":5755,"articleLive":2,"columnArticles":41,"formTitle":"[898]子数组按位或操作","frequency":0.4105017363,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":16792,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5411354342073611,"acs":4499,"articleLive":2,"columnArticles":53,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":8314,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.499328678839957,"acs":3719,"articleLive":2,"columnArticles":60,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":7448,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5504153388015255,"acs":21071,"articleLive":2,"columnArticles":254,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":38282,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.34004080118694363,"acs":3667,"articleLive":2,"columnArticles":83,"formTitle":"[902]最大为 N 的数字组合","frequency":1.0804236231,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10784,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5374934452018878,"acs":3075,"articleLive":2,"columnArticles":45,"formTitle":"[903]DI 序列的有效排列","frequency":0.9548670892,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5721,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4481565875969246,"acs":27338,"articleLive":2,"columnArticles":387,"formTitle":"[904]水果成篮","frequency":2.3617000696,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":61001,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.6999384138135535,"acs":61372,"articleLive":2,"columnArticles":652,"formTitle":"[905]按奇偶排序数组","frequency":1.3787942601,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":87682,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.28864037669217185,"acs":2452,"articleLive":2,"columnArticles":44,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":8495,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.32310537917754073,"acs":12752,"articleLive":2,"columnArticles":138,"formTitle":"[907]子数组的最小值之和","frequency":1.9625075996,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":39467,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6982510930668332,"acs":22358,"articleLive":2,"columnArticles":208,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":32020,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.45918480061857947,"acs":16628,"articleLive":2,"columnArticles":199,"formTitle":"[909]蛇梯棋","frequency":0.4961705308,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":36212,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.32144334635715927,"acs":6993,"articleLive":2,"columnArticles":71,"formTitle":"[910]最小差值 II","frequency":0.4378109156,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":21755,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.5427005920141076,"acs":25851,"articleLive":2,"columnArticles":320,"formTitle":"[911]在线选举","frequency":0.9631935319,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":47634,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5573192165612469,"acs":264774,"articleLive":2,"columnArticles":1198,"formTitle":"[912]排序数组","frequency":3.9842176068,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":475085,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.40533177661023545,"acs":2083,"articleLive":2,"columnArticles":35,"formTitle":"[913]猫和老鼠","frequency":0.7526696758,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":5139,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.38881943479804293,"acs":50384,"articleLive":2,"columnArticles":633,"formTitle":"[914]卡牌分组","frequency":0.9844113355,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":129582,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46881790023577274,"acs":10141,"articleLive":2,"columnArticles":126,"formTitle":"[915]分割数组","frequency":0.4378109156,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":21631,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4467035136202132,"acs":6789,"articleLive":2,"columnArticles":82,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":15198,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5694872259467295,"acs":31430,"articleLive":2,"columnArticles":465,"formTitle":"[917]仅仅反转字母","frequency":1.3467470827,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":55190,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.36222029757365015,"acs":28021,"articleLive":2,"columnArticles":282,"formTitle":"[918]环形子数组的最大和","frequency":2.4541018615,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":77359,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6453372495541803,"acs":6152,"articleLive":2,"columnArticles":109,"formTitle":"[919]完全二叉树插入器","frequency":0.4663353824,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":9533,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.4886198547215496,"acs":2018,"articleLive":2,"columnArticles":22,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":4130,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7443951908664732,"acs":23342,"articleLive":2,"columnArticles":343,"formTitle":"[921]使括号有效的最少添加","frequency":0.9844113355,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":31357,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7140427900074202,"acs":92380,"articleLive":2,"columnArticles":862,"formTitle":"[922]按奇偶排序数组 II","frequency":1.3158804347,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":129376,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3443023788905303,"acs":6759,"articleLive":2,"columnArticles":88,"formTitle":"[923]三数之和的多种可能","frequency":1.0804236231,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":19631,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35878413189077796,"acs":6964,"articleLive":2,"columnArticles":99,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.5274230743,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":19410,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3867987044413834,"acs":51949,"articleLive":2,"columnArticles":694,"formTitle":"[925]长按键入","frequency":1.3467470827,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":134305,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.534211790542859,"acs":7784,"articleLive":2,"columnArticles":147,"formTitle":"[926]将字符串翻转到单调递增","frequency":1.0804236231,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":14571,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.34182055586644283,"acs":3665,"articleLive":2,"columnArticles":77,"formTitle":"[927]三等分","frequency":0.7982980285,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10722,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.42380106571936055,"acs":2386,"articleLive":2,"columnArticles":46,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5630,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6447932893948473,"acs":26904,"articleLive":2,"columnArticles":240,"formTitle":"[929]独特的电子邮件地址","frequency":0.3843222307,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":41725,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5456402321083172,"acs":35262,"articleLive":2,"columnArticles":356,"formTitle":"[930]和相同的二元子数组","frequency":2.7428713906,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":64625,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6711207658693071,"acs":26569,"articleLive":2,"columnArticles":336,"formTitle":"[931]下降路径最小和","frequency":0.9548670892,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":39589,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6381954473557527,"acs":9280,"articleLive":2,"columnArticles":89,"formTitle":"[932]漂亮数组","frequency":0.9844113355,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":14541,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7278073113894553,"acs":39977,"articleLive":2,"columnArticles":346,"formTitle":"[933]最近的请求次数","frequency":1.9948205886,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":54928,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47116724427453643,"acs":26375,"articleLive":2,"columnArticles":293,"formTitle":"[934]最短的桥","frequency":0.4105017363,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":55978,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.48065454545454545,"acs":6609,"articleLive":2,"columnArticles":88,"formTitle":"[935]骑士拨号器","frequency":0.9844113355,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":13750,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.3791599724581134,"acs":1652,"articleLive":2,"columnArticles":28,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4357,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.587586330612611,"acs":13102,"articleLive":2,"columnArticles":137,"formTitle":"[937]重新排列日志文件","frequency":0.9844113355,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":22298,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8201720220707562,"acs":101078,"articleLive":2,"columnArticles":838,"formTitle":"[938]二叉搜索树的范围和","frequency":0.9844113355,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":123240,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4577129468672058,"acs":6056,"articleLive":2,"columnArticles":65,"formTitle":"[939]最小面积矩形","frequency":0.9844113355,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":13231,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.4254828709959463,"acs":5353,"articleLive":2,"columnArticles":67,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":12581,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3929639705067763,"acs":63848,"articleLive":2,"columnArticles":637,"formTitle":"[941]有效的山脉数组","frequency":1.3467470827,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":162478,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.732452392578125,"acs":24001,"articleLive":2,"columnArticles":227,"formTitle":"[942]增减字符串匹配","frequency":0.4105017363,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":32768,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.45714915179554966,"acs":2075,"articleLive":2,"columnArticles":46,"formTitle":"[943]最短超级串","frequency":0.6692532698,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":4539,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6868179563492064,"acs":22154,"articleLive":2,"columnArticles":190,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":32256,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4854466954500166,"acs":36542,"articleLive":2,"columnArticles":548,"formTitle":"[945]使数组唯一的最小增量","frequency":0.4105017363,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":75275,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6282315454062666,"acs":29574,"articleLive":2,"columnArticles":340,"formTitle":"[946]验证栈序列","frequency":1.7587599787,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":47075,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6129128031790984,"acs":26837,"articleLive":2,"columnArticles":345,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":43786,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.39369171695008226,"acs":7177,"articleLive":2,"columnArticles":103,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":18230,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.37331976423695035,"acs":8804,"articleLive":2,"columnArticles":126,"formTitle":"[949]给定数字能组成的最大时间","frequency":1.6449038473,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":23583,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7772964899178492,"acs":10408,"articleLive":2,"columnArticles":161,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.9264156679,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":13390,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6631724137931034,"acs":12020,"articleLive":2,"columnArticles":183,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":18125,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3635209479475243,"acs":3436,"articleLive":2,"columnArticles":66,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":9452,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.551243850045042,"acs":15910,"articleLive":2,"columnArticles":187,"formTitle":"[953]验证外星语词典","frequency":0.4105017363,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":28862,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.30552755715034474,"acs":7578,"articleLive":2,"columnArticles":109,"formTitle":"[954]二倍数对数组","frequency":1.3787942601,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":24803,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3334930981595092,"acs":3479,"articleLive":2,"columnArticles":56,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":10432,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4416494845360825,"acs":4284,"articleLive":2,"columnArticles":55,"formTitle":"[956]最高的广告牌","frequency":0.4961705308,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9700,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.3614478360352466,"acs":14849,"articleLive":2,"columnArticles":148,"formTitle":"[957]N 天后的牢房","frequency":2.2474386387,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":41082,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5379444677844403,"acs":28170,"articleLive":2,"columnArticles":272,"formTitle":"[958]二叉树的完全性检验","frequency":1.8893488444,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":52366,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.744325940140975,"acs":20169,"articleLive":2,"columnArticles":309,"formTitle":"[959]由斜杠划分区域","frequency":0.9844113355,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":27097,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5606815203145479,"acs":2139,"articleLive":2,"columnArticles":35,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3815,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6775827978250124,"acs":38381,"articleLive":2,"columnArticles":331,"formTitle":"[961]在长度 2N 的数组中找出重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":56644,"title":"在长度 2N 的数组中找出重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4470556210870157,"acs":14781,"articleLive":2,"columnArticles":149,"formTitle":"[962]最大宽度坡","frequency":1.0804236231,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":33063,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5140169332079022,"acs":2732,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":1.6449038473,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5315,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.44074902179988823,"acs":1577,"articleLive":2,"columnArticles":29,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3578,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6846386464553668,"acs":35771,"articleLive":2,"columnArticles":423,"formTitle":"[965]单值二叉树","frequency":1.3467470827,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":52248,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.41047276337014516,"acs":3308,"articleLive":2,"columnArticles":54,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":8059,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.47189594912049504,"acs":8236,"articleLive":2,"columnArticles":167,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":17453,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.5029013539651838,"acs":27820,"articleLive":2,"columnArticles":358,"formTitle":"[968]监控二叉树","frequency":1.3158804347,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"ac","submitted":55319,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6478599976718017,"acs":16696,"articleLive":2,"columnArticles":208,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":25771,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41270125865098434,"acs":11509,"articleLive":2,"columnArticles":130,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":27887,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4448959786498453,"acs":7335,"articleLive":2,"columnArticles":113,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":16487,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.40601503759398494,"acs":1404,"articleLive":2,"columnArticles":32,"formTitle":"[972]相等的有理数","frequency":0.7097446311,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3458,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6432139096627879,"acs":71472,"articleLive":2,"columnArticles":662,"formTitle":"[973]最接近原点的 K 个点","frequency":1.3158804347,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":111117,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.46684026555938724,"acs":39800,"articleLive":2,"columnArticles":401,"formTitle":"[974]和可被 K 整除的子数组","frequency":2.1760816999,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":85254,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.45288099084544964,"acs":3364,"articleLive":2,"columnArticles":52,"formTitle":"[975]奇偶跳","frequency":0.4663353824,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":7428,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5979849459832757,"acs":55850,"articleLive":2,"columnArticles":523,"formTitle":"[976]三角形的最大周长","frequency":1.5501060475,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":93397,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7015912509758868,"acs":221070,"articleLive":2,"columnArticles":1648,"formTitle":"[977]有序数组的平方","frequency":3.0690250678,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":315098,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47323591883785715,"acs":44337,"articleLive":2,"columnArticles":607,"formTitle":"[978]最长湍流子数组","frequency":0.4378109156,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":93689,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7151505621511125,"acs":9096,"articleLive":2,"columnArticles":144,"formTitle":"[979]在二叉树中分配硬币","frequency":1.3467470827,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":12719,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7352229853922801,"acs":15200,"articleLive":2,"columnArticles":229,"formTitle":"[980]不同路径 III","frequency":2.238213481,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":20674,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5304998688946628,"acs":22255,"articleLive":2,"columnArticles":323,"formTitle":"[981]基于时间的键值存储","frequency":2.5565455058,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":41951,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5496900619876025,"acs":2749,"articleLive":2,"columnArticles":32,"formTitle":"[982]按位与为零的三元组","frequency":0.4961705308,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":5001,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6336235387433665,"acs":33551,"articleLive":2,"columnArticles":464,"formTitle":"[983]最低票价","frequency":1.3787942601,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":52951,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.420187587657784,"acs":9587,"articleLive":2,"columnArticles":155,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":1.6121462508,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":22816,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6018414876331468,"acs":16668,"articleLive":2,"columnArticles":192,"formTitle":"[985]查询后的偶数和","frequency":0.4663353824,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27695,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6827298775722844,"acs":31452,"articleLive":2,"columnArticles":294,"formTitle":"[986]区间列表的交集","frequency":1.6999990246,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":46068,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5330483464976998,"acs":24565,"articleLive":2,"columnArticles":426,"formTitle":"[987]二叉树的垂序遍历","frequency":2.5797768961,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":46084,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.5019071679793927,"acs":10132,"articleLive":2,"columnArticles":124,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.9844113355,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":20187,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.46949428204058347,"acs":55136,"articleLive":2,"columnArticles":623,"formTitle":"[989]数组形式的整数加法","frequency":0.3843222307,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":117437,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5082538283260583,"acs":35746,"articleLive":2,"columnArticles":531,"formTitle":"[990]等式方程的可满足性","frequency":0.4105017363,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":70331,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5209827732279018,"acs":9224,"articleLive":2,"columnArticles":114,"formTitle":"[991]坏了的计算器","frequency":0.4105017363,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":17705,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.4559768816108775,"acs":24615,"articleLive":2,"columnArticles":282,"formTitle":"[992]K 个不同整数的子数组","frequency":0.9844113355,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":53983,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5572403097525961,"acs":53178,"articleLive":2,"columnArticles":840,"formTitle":"[993]二叉树的堂兄弟节点","frequency":1.3158804347,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":95431,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5106302568308647,"acs":63503,"articleLive":2,"columnArticles":1510,"formTitle":"[994]腐烂的橘子","frequency":1.93130382,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":124362,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5340548654996247,"acs":22057,"articleLive":2,"columnArticles":256,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.4663353824,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":41301,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49323610230395265,"acs":4667,"articleLive":2,"columnArticles":95,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":9462,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.535557208994709,"acs":64781,"articleLive":2,"columnArticles":692,"formTitle":"[997]找到小镇的法官","frequency":1.1191701404,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":120960,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6184843165687247,"acs":8104,"articleLive":2,"columnArticles":122,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":13103,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6912689070030873,"acs":31123,"articleLive":2,"columnArticles":580,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":45023,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.41228163049232397,"acs":3894,"articleLive":2,"columnArticles":44,"formTitle":"[1000]合并石头的最低成本","frequency":1.5206748473,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":9445,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2986537707489217,"acs":2285,"articleLive":2,"columnArticles":59,"formTitle":"[1001]网格照明","frequency":0.5946753013,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7651,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7291859052247873,"acs":60012,"articleLive":2,"columnArticles":634,"formTitle":"[1002]查找共用字符","frequency":1.7896647868,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":82300,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5799055661490965,"acs":12773,"articleLive":2,"columnArticles":194,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":22026,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5956957503894049,"acs":73046,"articleLive":2,"columnArticles":762,"formTitle":"[1004]最大连续1的个数 III","frequency":2.5467606919,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":122623,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5206441457803608,"acs":64500,"articleLive":2,"columnArticles":1024,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":2.0186233023,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":123885,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6268395969308606,"acs":44851,"articleLive":2,"columnArticles":612,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":71551,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46676390914773913,"acs":6720,"articleLive":2,"columnArticles":91,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":14397,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7217225609756097,"acs":18938,"articleLive":2,"columnArticles":243,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":1.257384228,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":26240,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5887741847268749,"acs":17224,"articleLive":2,"columnArticles":246,"formTitle":"[1009]十进制整数的反码","frequency":0.9844113355,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":29254,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.4568743654522702,"acs":19350,"articleLive":2,"columnArticles":260,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.4105017363,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":42353,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6254423110389233,"acs":64692,"articleLive":2,"columnArticles":617,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":1.6121462508,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":103434,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3399045445113094,"acs":3276,"articleLive":2,"columnArticles":68,"formTitle":"[1012]至少有 1 位重复的数字","frequency":1.2296200904,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9638,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39416099681626454,"acs":48779,"articleLive":2,"columnArticles":942,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":1.8548769354,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":123754,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5574346973625957,"acs":44068,"articleLive":2,"columnArticles":505,"formTitle":"[1014]最佳观光组合","frequency":0.8989866308,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":79055,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.36002457505631785,"acs":5274,"articleLive":2,"columnArticles":44,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.5946753013,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":14649,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5839216099462649,"acs":5542,"articleLive":2,"columnArticles":90,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.4663353824,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":9491,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5624535868112283,"acs":3787,"articleLive":2,"columnArticles":58,"formTitle":"[1017]负二进制转换","frequency":0.4663353824,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6733,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5156512146353796,"acs":44873,"articleLive":2,"columnArticles":385,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":87022,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.6002819782710862,"acs":21714,"articleLive":2,"columnArticles":291,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.4663353824,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":36173,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5523681458239952,"acs":11091,"articleLive":2,"columnArticles":170,"formTitle":"[1020]飞地的数量","frequency":0.8989866308,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":20079,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7832884167560638,"acs":59873,"articleLive":2,"columnArticles":680,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":76438,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7082918078532988,"acs":21321,"articleLive":2,"columnArticles":288,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.4105017363,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":30102,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5677878204178397,"acs":7664,"articleLive":2,"columnArticles":177,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":13498,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5555273471589737,"acs":35011,"articleLive":2,"columnArticles":402,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":63023,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7090017138349096,"acs":78188,"articleLive":2,"columnArticles":666,"formTitle":"[1025]除数博弈","frequency":0.9844113355,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":110279,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6768277416124187,"acs":10813,"articleLive":2,"columnArticles":188,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":15976,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4350037397157816,"acs":14540,"articleLive":2,"columnArticles":134,"formTitle":"[1027]最长等差数列","frequency":1.6121462508,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":33425,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7321137223591488,"acs":21090,"articleLive":2,"columnArticles":441,"formTitle":"[1028]从先序遍历还原二叉树","frequency":1.6449038473,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":28807,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.660627616612945,"acs":17831,"articleLive":2,"columnArticles":195,"formTitle":"[1029]两地调度","frequency":0.3591952806,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":26991,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7096834901625321,"acs":41481,"articleLive":2,"columnArticles":456,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.4378109156,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":58450,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5738229956229316,"acs":5375,"articleLive":2,"columnArticles":88,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":9367,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.41128917883988086,"acs":2900,"articleLive":2,"columnArticles":47,"formTitle":"[1032]字符流","frequency":1.0804236231,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":7051,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.3937456807187284,"acs":11395,"articleLive":2,"columnArticles":172,"formTitle":"[1033]移动石子直到连续","frequency":0.4378109156,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28940,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.5606173810460087,"acs":28513,"articleLive":2,"columnArticles":460,"formTitle":"[1034]边界着色","frequency":1.1598872202,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":50860,"title":"边界着色","titleSlug":"coloring-a-border"},{"acceptance":0.6407390208305692,"acs":38634,"articleLive":2,"columnArticles":413,"formTitle":"[1035]不相交的线","frequency":0.3843222307,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":60296,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.30225869215802387,"acs":3573,"articleLive":2,"columnArticles":60,"formTitle":"[1036]逃离大迷宫","frequency":1.1152097392,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":11821,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.4395396698727372,"acs":10465,"articleLive":2,"columnArticles":135,"formTitle":"[1037]有效的回旋镖","frequency":1.3467470827,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":23809,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7959440519435943,"acs":27827,"articleLive":2,"columnArticles":346,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.8989866308,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":34961,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5588711542910016,"acs":4832,"articleLive":2,"columnArticles":65,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8646,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5232470941132359,"acs":2791,"articleLive":2,"columnArticles":32,"formTitle":"[1040]移动石子直到连续 II","frequency":0.5602128972,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5334,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.48794525804182387,"acs":7630,"articleLive":2,"columnArticles":125,"formTitle":"[1041]困于环中的机器人","frequency":1.3787942601,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":15637,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5350827649128904,"acs":12316,"articleLive":2,"columnArticles":160,"formTitle":"[1042]不邻接植花","frequency":0.4105017363,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":23017,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6929568050797894,"acs":8294,"articleLive":2,"columnArticles":104,"formTitle":"[1043]分隔数组以得到最大和","frequency":1.4121084668,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11969,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.3474680040927923,"acs":20715,"articleLive":2,"columnArticles":185,"formTitle":"[1044]最长重复子串","frequency":2.3794682069,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"ac","submitted":59617,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6409682668836453,"acs":9453,"articleLive":2,"columnArticles":117,"formTitle":"[1045]买下所有产品的客户","frequency":0.4105017363,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"","submitted":14748,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6590444962176777,"acs":68739,"articleLive":2,"columnArticles":959,"formTitle":"[1046]最后一块石头的重量","frequency":0.9548670892,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":104301,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7245655889912318,"acs":117839,"articleLive":2,"columnArticles":1040,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":2.5386831036,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":162634,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4645492059522321,"acs":11145,"articleLive":2,"columnArticles":159,"formTitle":"[1048]最长字符串链","frequency":2.6139820838,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":23991,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6520972194169528,"acs":48428,"articleLive":2,"columnArticles":446,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.9264156679,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":74265,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7607698266102604,"acs":12768,"articleLive":2,"columnArticles":60,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":1.3467470827,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"","submitted":16783,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7563402217624771,"acs":32537,"articleLive":2,"columnArticles":385,"formTitle":"[1051]高度检查器","frequency":0.9264156679,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":43019,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5801201541862969,"acs":50116,"articleLive":2,"columnArticles":777,"formTitle":"[1052]爱生气的书店老板","frequency":1.0470983134,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":86389,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.460142243295303,"acs":6211,"articleLive":2,"columnArticles":98,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":13498,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.3823318385650224,"acs":8526,"articleLive":2,"columnArticles":114,"formTitle":"[1054]距离相等的条形码","frequency":0.4105017363,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":22300,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5945468594767634,"acs":5386,"articleLive":2,"columnArticles":100,"formTitle":"[1055]形成字符串的最短路径","frequency":1.0151262807,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"","submitted":9059,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4173539319316994,"acs":3593,"articleLive":2,"columnArticles":70,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"","submitted":8609,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4725403817914831,"acs":3218,"articleLive":2,"columnArticles":42,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"","submitted":6810,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3459946432919406,"acs":1421,"articleLive":2,"columnArticles":37,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"","submitted":4107,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.3660159716060337,"acs":2475,"articleLive":2,"columnArticles":40,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"","submitted":6762,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5295356629966491,"acs":5531,"articleLive":2,"columnArticles":81,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"","submitted":10445,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6062293729372937,"acs":2939,"articleLive":2,"columnArticles":65,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"","submitted":4848,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5479511769834351,"acs":3771,"articleLive":2,"columnArticles":53,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"","submitted":6882,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7091167080525009,"acs":1999,"articleLive":2,"columnArticles":43,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"","submitted":2819,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6468710089399745,"acs":5065,"articleLive":2,"columnArticles":72,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"","submitted":7830,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5444398511781728,"acs":2634,"articleLive":2,"columnArticles":73,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"","submitted":4838,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.47913978494623655,"acs":2228,"articleLive":2,"columnArticles":43,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"","submitted":4650,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4187708432586946,"acs":879,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"","submitted":2099,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8674049866860324,"acs":14333,"articleLive":2,"columnArticles":69,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"","submitted":16524,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8185055772073646,"acs":12181,"articleLive":2,"columnArticles":60,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"","submitted":14882,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.4794445056761821,"acs":8700,"articleLive":2,"columnArticles":76,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"","submitted":18146,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5875334633307995,"acs":35554,"articleLive":2,"columnArticles":683,"formTitle":"[1071]字符串的最大公因子","frequency":0.9548670892,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":60514,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5896934116112198,"acs":3616,"articleLive":2,"columnArticles":61,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":6132,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.3421086759175204,"acs":2638,"articleLive":2,"columnArticles":56,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7711,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6687276967105961,"acs":18927,"articleLive":2,"columnArticles":195,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":28303,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6940991757163417,"acs":10610,"articleLive":2,"columnArticles":78,"formTitle":"[1075]项目员工 I","frequency":0.4378109156,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"","submitted":15286,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4939476766887934,"acs":11385,"articleLive":2,"columnArticles":94,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"","submitted":23049,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7233635097493036,"acs":8310,"articleLive":2,"columnArticles":91,"formTitle":"[1077]项目员工 III","frequency":0.4378109156,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"","submitted":11488,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6575640158271316,"acs":32074,"articleLive":2,"columnArticles":444,"formTitle":"[1078]Bigram 分词","frequency":0.4961705308,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":48777,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7353704933872819,"acs":12177,"articleLive":2,"columnArticles":204,"formTitle":"[1079]活字印刷","frequency":0.4105017363,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":16559,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4966108875238297,"acs":4689,"articleLive":2,"columnArticles":102,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":9442,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5723030110037859,"acs":16175,"articleLive":2,"columnArticles":165,"formTitle":"[1081]不同字符的最小子序列","frequency":1.5805729889,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":28263,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7604354625285697,"acs":12643,"articleLive":2,"columnArticles":99,"formTitle":"[1082]销售分析 I ","frequency":1.1152097392,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"","submitted":16626,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5284752263301075,"acs":11850,"articleLive":2,"columnArticles":110,"formTitle":"[1083]销售分析 II","frequency":1.0470983134,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"","submitted":22423,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5358711566617862,"acs":11346,"articleLive":2,"columnArticles":105,"formTitle":"[1084]销售分析III","frequency":0.4663353824,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"","submitted":21173,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7722188326215171,"acs":3797,"articleLive":2,"columnArticles":76,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"","submitted":4917,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6858017604286261,"acs":5376,"articleLive":2,"columnArticles":86,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"","submitted":7839,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5390560309136075,"acs":1953,"articleLive":2,"columnArticles":56,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"","submitted":3623,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.4571778140293638,"acs":1121,"articleLive":2,"columnArticles":36,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"","submitted":2452,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5837529183426626,"acs":20753,"articleLive":2,"columnArticles":308,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":35551,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5521245711269465,"acs":4184,"articleLive":2,"columnArticles":87,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7578,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3805094745609773,"acs":32892,"articleLive":2,"columnArticles":330,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":2.4541018615,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":86442,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.49504273504273505,"acs":2896,"articleLive":2,"columnArticles":57,"formTitle":"[1092]最短公共超序列","frequency":1.7896647868,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5850,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.37107095802747975,"acs":3943,"articleLive":2,"columnArticles":63,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":10626,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.5900642985528193,"acs":31844,"articleLive":2,"columnArticles":442,"formTitle":"[1094]拼车","frequency":2.1760816999,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":53967,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.37228606773401224,"acs":20765,"articleLive":2,"columnArticles":398,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":55777,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5503231763619575,"acs":1788,"articleLive":2,"columnArticles":49,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3249,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5220017899761337,"acs":6999,"articleLive":2,"columnArticles":123,"formTitle":"[1097]游戏玩法分析 V","frequency":2.0014230159,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"","submitted":13408,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4752787344580001,"acs":8142,"articleLive":2,"columnArticles":108,"formTitle":"[1098]小众书籍","frequency":0.5274230743,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"","submitted":17131,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5870084727351728,"acs":5404,"articleLive":2,"columnArticles":100,"formTitle":"[1099]小于 K 的两数之和","frequency":0.4378109156,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"","submitted":9206,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6994163424124513,"acs":5752,"articleLive":2,"columnArticles":116,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":1.0151262807,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"","submitted":8224,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.674496644295302,"acs":2613,"articleLive":2,"columnArticles":64,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"","submitted":3874,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.37491961414791,"acs":5830,"articleLive":2,"columnArticles":70,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"","submitted":15550,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6373704584512299,"acs":36717,"articleLive":2,"columnArticles":1120,"formTitle":"[1103]分糖果 II","frequency":1.3467470827,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":57607,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7605937711225498,"acs":29257,"articleLive":2,"columnArticles":688,"formTitle":"[1104]二叉树寻路","frequency":2.2066277523,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":38466,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5626680455015511,"acs":5441,"articleLive":2,"columnArticles":71,"formTitle":"[1105]填充书架","frequency":1.1152097392,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9670,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5821802663907927,"acs":4502,"articleLive":2,"columnArticles":131,"formTitle":"[1106]解析布尔表达式","frequency":0.7526696758,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7733,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41280280609448644,"acs":7532,"articleLive":2,"columnArticles":99,"formTitle":"[1107]每日新用户统计","frequency":1.0804236231,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"","submitted":18246,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8389896825301277,"acs":69689,"articleLive":2,"columnArticles":707,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":83063,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5845391149761288,"acs":63789,"articleLive":2,"columnArticles":627,"formTitle":"[1109]航班预订统计","frequency":2.4870320677,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":109127,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6308986770743575,"acs":12447,"articleLive":2,"columnArticles":225,"formTitle":"[1110]删点成林","frequency":0.9548670892,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":19729,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7713174647975664,"acs":24595,"articleLive":2,"columnArticles":406,"formTitle":"[1111]有效括号的嵌套深度","frequency":1.0804236231,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31887,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6456881870258554,"acs":8341,"articleLive":2,"columnArticles":96,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"","submitted":12918,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5403491551566991,"acs":7707,"articleLive":2,"columnArticles":53,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"","submitted":14263,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6532069912808058,"acs":82033,"articleLive":2,"columnArticles":602,"formTitle":"[1114]按序打印","frequency":3.2067308066,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":125585,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5616223885708694,"acs":45916,"articleLive":2,"columnArticles":494,"formTitle":"[1115]交替打印 FooBar","frequency":0.9548670892,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":81756,"title":"交替打印 FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5212177121771218,"acs":24295,"articleLive":2,"columnArticles":383,"formTitle":"[1116]打印零与奇偶数","frequency":2.4188123845,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":46612,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5235986944799206,"acs":18449,"articleLive":2,"columnArticles":261,"formTitle":"[1117]H2O 生成","frequency":1.8216777638,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":35235,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6349403578528827,"acs":2555,"articleLive":2,"columnArticles":43,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"","submitted":4024,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8656221753540223,"acs":8619,"articleLive":2,"columnArticles":152,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"","submitted":9957,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6159357359965263,"acs":2837,"articleLive":2,"columnArticles":52,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"","submitted":4606,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5715705765407555,"acs":1150,"articleLive":2,"columnArticles":20,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"","submitted":2012,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7069581056466302,"acs":67921,"articleLive":2,"columnArticles":903,"formTitle":"[1122]数组的相对排序","frequency":1.7587599787,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":96075,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7050548402479733,"acs":8871,"articleLive":2,"columnArticles":116,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.3843222307,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":12582,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3220962447326147,"acs":13835,"articleLive":2,"columnArticles":149,"formTitle":"[1124]表现良好的最长时间段","frequency":0.4663353824,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":42953,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.49450045829514205,"acs":3237,"articleLive":2,"columnArticles":52,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6546,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6907941686206545,"acs":6776,"articleLive":2,"columnArticles":99,"formTitle":"[1126]查询活跃业务","frequency":0.4105017363,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"","submitted":9809,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4251575877316775,"acs":4519,"articleLive":2,"columnArticles":78,"formTitle":"[1127]用户购买平台","frequency":1.0804236231,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"","submitted":10629,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5445996622105173,"acs":38049,"articleLive":2,"columnArticles":489,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":1.0151262807,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":69866,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.38475750577367207,"acs":6664,"articleLive":2,"columnArticles":124,"formTitle":"[1129]颜色交替的最短路径","frequency":0.4961705308,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":17320,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6328101865561149,"acs":6411,"articleLive":2,"columnArticles":114,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.4105017363,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":10131,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.45793739519284515,"acs":3277,"articleLive":2,"columnArticles":49,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":7156,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.39208287088420274,"acs":5299,"articleLive":2,"columnArticles":56,"formTitle":"[1132]报告的记录 II","frequency":0.5274230743,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"","submitted":13515,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.644385571632362,"acs":3162,"articleLive":2,"columnArticles":68,"formTitle":"[1133]最大唯一数","frequency":0.5602128972,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"","submitted":4907,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7725173210161663,"acs":3345,"articleLive":2,"columnArticles":56,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"","submitted":4330,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5420964805825242,"acs":7147,"articleLive":2,"columnArticles":80,"formTitle":"[1135]最低成本联通所有城市","frequency":0.4378109156,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"","submitted":13184,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5751946213729653,"acs":3251,"articleLive":2,"columnArticles":56,"formTitle":"[1136]平行课程","frequency":0.4663353824,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"","submitted":5652,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6093706681452731,"acs":96712,"articleLive":2,"columnArticles":988,"formTitle":"[1137]第 N 个泰波那契数","frequency":2.074985583,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":158708,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4357493114798146,"acs":6487,"articleLive":2,"columnArticles":145,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14887,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4819521623580575,"acs":9974,"articleLive":2,"columnArticles":158,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":1.6449038473,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":20695,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6516619871388462,"acs":7195,"articleLive":2,"columnArticles":99,"formTitle":"[1140]石子游戏 II","frequency":0.9844113355,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":11041,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5083368166829223,"acs":10945,"articleLive":2,"columnArticles":70,"formTitle":"[1141]查询近30天活跃用户数","frequency":1.0151262807,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"","submitted":21531,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3721846572943523,"acs":7651,"articleLive":2,"columnArticles":52,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"","submitted":20557,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6385929898103292,"acs":184941,"articleLive":2,"columnArticles":1221,"formTitle":"[1143]最长公共子序列","frequency":3.2890140424,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":289607,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4431993334721933,"acs":10639,"articleLive":2,"columnArticles":148,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.4961705308,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":24005,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4701467533337801,"acs":7016,"articleLive":2,"columnArticles":110,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14923,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2912881144990666,"acs":4681,"articleLive":2,"columnArticles":67,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":16070,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5631325910931174,"acs":4451,"articleLive":2,"columnArticles":91,"formTitle":"[1147]段式回文","frequency":2.0630948365,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7904,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.712407422817675,"acs":8561,"articleLive":2,"columnArticles":38,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"","submitted":12017,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.4430867214693031,"acs":5983,"articleLive":2,"columnArticles":50,"formTitle":"[1149]文章浏览 II","frequency":0.4378109156,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"","submitted":13503,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6004461664905483,"acs":5114,"articleLive":2,"columnArticles":90,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.4663353824,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"","submitted":8517,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.49794114693180674,"acs":4958,"articleLive":2,"columnArticles":75,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.4105017363,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"","submitted":9957,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.39277537522258965,"acs":1544,"articleLive":2,"columnArticles":37,"formTitle":"[1152]用户网站访问行为分析","frequency":0.5946753013,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"","submitted":3931,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3700671704450042,"acs":1763,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"","submitted":4764,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.648799988454489,"acs":44956,"articleLive":2,"columnArticles":532,"formTitle":"[1154]一年中的第几天","frequency":1.2816305117,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":69291,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4804795436313397,"acs":10781,"articleLive":2,"columnArticles":137,"formTitle":"[1155]掷骰子的N种方法","frequency":1.4829345194,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":22438,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4295661917720506,"acs":5367,"articleLive":2,"columnArticles":98,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.4105017363,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":12494,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.32288964278587107,"acs":3236,"articleLive":2,"columnArticles":50,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":10022,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5529732183386291,"acs":6091,"articleLive":2,"columnArticles":64,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"","submitted":11015,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.4951445218782132,"acs":4334,"articleLive":2,"columnArticles":89,"formTitle":"[1159]市场分析 II","frequency":1.0151262807,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"","submitted":8753,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6869769786590489,"acs":61323,"articleLive":2,"columnArticles":930,"formTitle":"[1160]拼写单词","frequency":1.5805729889,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":89265,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6324800718535983,"acs":11267,"articleLive":2,"columnArticles":185,"formTitle":"[1161]最大层内元素和","frequency":0.9844113355,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":17814,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.47113262114147436,"acs":39912,"articleLive":2,"columnArticles":506,"formTitle":"[1162]地图分析","frequency":0.3843222307,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":84715,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.26788721447385466,"acs":6204,"articleLive":2,"columnArticles":106,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":23159,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6105393558223747,"acs":6407,"articleLive":2,"columnArticles":92,"formTitle":"[1164]指定日期的产品价格","frequency":1.3787942601,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"","submitted":10494,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8354390062639346,"acs":7869,"articleLive":2,"columnArticles":120,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"","submitted":9419,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4766050054406964,"acs":3066,"articleLive":2,"columnArticles":55,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"","submitted":6433,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.44938782548715295,"acs":2606,"articleLive":2,"columnArticles":40,"formTitle":"[1167]连接棒材的最低费用","frequency":0.5274230743,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"","submitted":5799,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5692357935989549,"acs":1743,"articleLive":2,"columnArticles":32,"formTitle":"[1168]水资源分配优化","frequency":1.0151262807,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"","submitted":3062,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3228036441880694,"acs":7051,"articleLive":2,"columnArticles":83,"formTitle":"[1169]查询无效交易","frequency":0.4378109156,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":21843,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6164096290794705,"acs":14109,"articleLive":2,"columnArticles":224,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.4105017363,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22889,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47667929727867725,"acs":13838,"articleLive":2,"columnArticles":166,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":2.0283208182,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":29030,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2629318953465149,"acs":2633,"articleLive":2,"columnArticles":59,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":10014,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7545156683189111,"acs":8981,"articleLive":2,"columnArticles":81,"formTitle":"[1173]即时食物配送 I","frequency":0.4105017363,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"","submitted":11903,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6225895316804407,"acs":5424,"articleLive":2,"columnArticles":68,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"","submitted":8712,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.49151488779760055,"acs":7907,"articleLive":2,"columnArticles":123,"formTitle":"[1175]质数排列","frequency":0.9844113355,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":16087,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4550154090863903,"acs":4577,"articleLive":2,"columnArticles":70,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"","submitted":10059,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26955242698045806,"acs":6414,"articleLive":2,"columnArticles":98,"formTitle":"[1177]构建回文串检测","frequency":1.1152097392,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23795,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4625888698210346,"acs":18869,"articleLive":2,"columnArticles":186,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40790,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6370813213765617,"acs":33248,"articleLive":2,"columnArticles":199,"formTitle":"[1179]重新格式化部门表","frequency":2.4541018615,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":52188,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.773896624970498,"acs":3279,"articleLive":2,"columnArticles":76,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"","submitted":4237,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.37336877718704686,"acs":1545,"articleLive":2,"columnArticles":31,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"","submitted":4138,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.420976549951815,"acs":2621,"articleLive":2,"columnArticles":46,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"","submitted":6226,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5892080069625761,"acs":677,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"","submitted":1149,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5837049884373967,"acs":14135,"articleLive":2,"columnArticles":276,"formTitle":"[1184]公交站间的距离","frequency":0.4105017363,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":24216,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.3980990495247624,"acs":7958,"articleLive":2,"columnArticles":116,"formTitle":"[1186]删除一次得到子数组最大和","frequency":1.0470983134,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":19990,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.44466755912539047,"acs":1993,"articleLive":2,"columnArticles":35,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4482,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6983479105928085,"acs":3593,"articleLive":2,"columnArticles":68,"formTitle":"[1188]设计有限阻塞队列","frequency":1.3158804347,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"","submitted":5145,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6457528957528957,"acs":22077,"articleLive":2,"columnArticles":346,"formTitle":"[1189]“气球” 的最大数量","frequency":0.9844113355,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":34188,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6505737202695928,"acs":46719,"articleLive":2,"columnArticles":628,"formTitle":"[1190]反转每对括号间的子串","frequency":1.9251898366,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":71812,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2663303693570451,"acs":6230,"articleLive":2,"columnArticles":96,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":23392,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.5032519458364432,"acs":4720,"articleLive":2,"columnArticles":54,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":9379,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6047530924320639,"acs":6209,"articleLive":2,"columnArticles":76,"formTitle":"[1193]每月交易 I","frequency":0.4663353824,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"","submitted":10267,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5124675324675325,"acs":3946,"articleLive":2,"columnArticles":67,"formTitle":"[1194]锦标赛优胜者","frequency":0.3843222307,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"","submitted":7700,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6381801809527893,"acs":14883,"articleLive":2,"columnArticles":284,"formTitle":"[1195]交替打印字符串","frequency":1.9625075996,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":23321,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6857667584940312,"acs":3734,"articleLive":2,"columnArticles":62,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.5274230743,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"","submitted":5445,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.3751517315244556,"acs":5254,"articleLive":2,"columnArticles":63,"formTitle":"[1197]进击的骑士","frequency":0.4378109156,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"","submitted":14005,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7396641993139556,"acs":4097,"articleLive":2,"columnArticles":64,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"","submitted":5539,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43855693348365277,"acs":778,"articleLive":2,"columnArticles":20,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"","submitted":1774,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6845336396926833,"acs":19067,"articleLive":2,"columnArticles":270,"formTitle":"[1200]最小绝对差","frequency":1.3158804347,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":27854,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.2494411469976104,"acs":6472,"articleLive":2,"columnArticles":90,"formTitle":"[1201]丑数 III","frequency":1.8548769354,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":25946,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5033967639431681,"acs":27565,"articleLive":2,"columnArticles":303,"formTitle":"[1202]交换字符串中的元素","frequency":0.5274230743,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":54758,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6180907040841894,"acs":12334,"articleLive":2,"columnArticles":146,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19955,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7314869844288601,"acs":6154,"articleLive":2,"columnArticles":85,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"","submitted":8413,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4684957728505344,"acs":5874,"articleLive":2,"columnArticles":88,"formTitle":"[1205]每月交易II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"","submitted":12538,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6145656534485419,"acs":7966,"articleLive":2,"columnArticles":99,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":12962,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.729786198463858,"acs":61475,"articleLive":2,"columnArticles":860,"formTitle":"[1207]独一无二的出现次数","frequency":1.6121462508,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":84237,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4970290970823957,"acs":50357,"articleLive":2,"columnArticles":634,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":101316,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5236034462222575,"acs":13188,"articleLive":2,"columnArticles":166,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.5274230743,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":25187,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.45345983968591524,"acs":2772,"articleLive":2,"columnArticles":57,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.7097446311,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":6113,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.659730623437374,"acs":8180,"articleLive":2,"columnArticles":65,"formTitle":"[1211]查询结果的质量和占比","frequency":0.4105017363,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"","submitted":12399,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5147369387567716,"acs":5606,"articleLive":2,"columnArticles":106,"formTitle":"[1212]查询球队积分","frequency":0.4105017363,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"","submitted":10891,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.776629766297663,"acs":6314,"articleLive":2,"columnArticles":137,"formTitle":"[1213]三个有序数组的交集","frequency":0.4663353824,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"","submitted":8130,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6391538061383735,"acs":3686,"articleLive":2,"columnArticles":75,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.5602128972,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"","submitted":5767,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4130875202593193,"acs":2039,"articleLive":2,"columnArticles":43,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"","submitted":4936,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5403624382207578,"acs":1640,"articleLive":2,"columnArticles":39,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"","submitted":3035,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6954191616766467,"acs":23227,"articleLive":2,"columnArticles":372,"formTitle":"[1217]玩筹码","frequency":0.9264156679,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":33400,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.5147290681271264,"acs":37218,"articleLive":2,"columnArticles":359,"formTitle":"[1218]最长定差子序列","frequency":2.7822175035,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"ac","submitted":72306,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6291464597478177,"acs":12973,"articleLive":2,"columnArticles":186,"formTitle":"[1219]黄金矿工","frequency":1.3158804347,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":20620,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5308831036242981,"acs":4160,"articleLive":2,"columnArticles":79,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7836,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8438780641778748,"acs":78868,"articleLive":2,"columnArticles":1138,"formTitle":"[1221]分割平衡字符串","frequency":2.4541018615,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":93459,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.67610504701178,"acs":6256,"articleLive":2,"columnArticles":137,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.5274230743,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":9253,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.47497294372294374,"acs":3511,"articleLive":2,"columnArticles":60,"formTitle":"[1223]掷骰子模拟","frequency":0.7097446311,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7392,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3265741728922092,"acs":4896,"articleLive":2,"columnArticles":71,"formTitle":"[1224]最大相等频率","frequency":1.2716254257,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14992,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5396526772793053,"acs":3729,"articleLive":2,"columnArticles":86,"formTitle":"[1225]报告系统状态的连续日期","frequency":1.0470983134,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"","submitted":6910,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5940542828919516,"acs":12629,"articleLive":2,"columnArticles":140,"formTitle":"[1226]哲学家进餐","frequency":2.1423630639,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":21259,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6647326720319421,"acs":10655,"articleLive":2,"columnArticles":167,"formTitle":"[1227]飞机座位分配概率","frequency":1.3467470827,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":16029,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5377295492487479,"acs":3221,"articleLive":2,"columnArticles":57,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"","submitted":5990,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.43536256563076486,"acs":3068,"articleLive":2,"columnArticles":57,"formTitle":"[1229]安排会议日程","frequency":0.4105017363,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"","submitted":7047,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.5031829504566842,"acs":3636,"articleLive":2,"columnArticles":71,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"","submitted":7226,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5701294697903823,"acs":3699,"articleLive":2,"columnArticles":50,"formTitle":"[1231]分享巧克力","frequency":0.4378109156,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"","submitted":6488,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4687093098958333,"acs":34557,"articleLive":2,"columnArticles":428,"formTitle":"[1232]缀点成线","frequency":0.4378109156,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":73728,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48694626915950817,"acs":8673,"articleLive":2,"columnArticles":129,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":17811,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.347273427612392,"acs":6311,"articleLive":2,"columnArticles":97,"formTitle":"[1234]替换子串得到平衡字符串","frequency":1.6449038473,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":18173,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4680240146175933,"acs":7172,"articleLive":2,"columnArticles":124,"formTitle":"[1235]规划兼职工作","frequency":1.829863125,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":15324,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5711050724637681,"acs":1261,"articleLive":2,"columnArticles":33,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"","submitted":2208,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7121201775349949,"acs":10429,"articleLive":2,"columnArticles":139,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14645,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6623897353648757,"acs":3304,"articleLive":2,"columnArticles":78,"formTitle":"[1238]循环码排列","frequency":0.6309637533,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4988,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49146724878839054,"acs":35797,"articleLive":2,"columnArticles":393,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":72837,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4960673129687214,"acs":2712,"articleLive":2,"columnArticles":41,"formTitle":"[1240]铺瓷砖","frequency":1.4646691714,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5467,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5925551625400034,"acs":7036,"articleLive":2,"columnArticles":69,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"","submitted":11874,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.46982167352537724,"acs":1370,"articleLive":2,"columnArticles":21,"formTitle":"[1242]多线程网页爬虫","frequency":0.9548670892,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"","submitted":2916,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5382026920031671,"acs":2719,"articleLive":2,"columnArticles":62,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"","submitted":5052,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.62564332065339,"acs":2796,"articleLive":2,"columnArticles":46,"formTitle":"[1244]力扣排行榜","frequency":0.5946753013,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"","submitted":4469,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5124731759656652,"acs":3821,"articleLive":2,"columnArticles":69,"formTitle":"[1245]树的直径","frequency":0.4961705308,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"","submitted":7456,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4822649912517894,"acs":3032,"articleLive":2,"columnArticles":44,"formTitle":"[1246]删除回文子数组","frequency":0.8989866308,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"","submitted":6287,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6217289415440698,"acs":9551,"articleLive":2,"columnArticles":163,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":15362,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5630585292951474,"acs":36922,"articleLive":2,"columnArticles":498,"formTitle":"[1248]统计「优美子数组」","frequency":1.3467470827,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":65574,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5793015200653032,"acs":26258,"articleLive":2,"columnArticles":365,"formTitle":"[1249]移除无效的括号","frequency":0.9844113355,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":45327,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5660631741140215,"acs":2939,"articleLive":2,"columnArticles":41,"formTitle":"[1250]检查「好数组」","frequency":0.5274230743,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":5192,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7712516585581601,"acs":8719,"articleLive":2,"columnArticles":101,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"","submitted":11305,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.748757016840417,"acs":18674,"articleLive":2,"columnArticles":329,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24940,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.395504816268284,"acs":5543,"articleLive":2,"columnArticles":85,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":14015,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.6056910569105691,"acs":17135,"articleLive":2,"columnArticles":266,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.3843222307,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":28290,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6882416396979504,"acs":3190,"articleLive":2,"columnArticles":70,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4635,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6662546353522868,"acs":1617,"articleLive":2,"columnArticles":40,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"","submitted":2427,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5645067133683596,"acs":1934,"articleLive":2,"columnArticles":44,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"","submitted":3426,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5545796737766625,"acs":1326,"articleLive":2,"columnArticles":48,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"","submitted":2391,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.483341045812124,"acs":2089,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"","submitted":4322,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.603464524525423,"acs":13447,"articleLive":2,"columnArticles":266,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":22283,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7304355370466771,"acs":8419,"articleLive":2,"columnArticles":114,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":11526,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5294139438393717,"acs":14291,"articleLive":2,"columnArticles":208,"formTitle":"[1262]可被三整除的最大和","frequency":1.3787942601,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":26994,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4259940652818991,"acs":3589,"articleLive":2,"columnArticles":66,"formTitle":"[1263]推箱子","frequency":1.2296200904,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":8425,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5669666490206459,"acs":5355,"articleLive":2,"columnArticles":91,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"","submitted":9445,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9180606747944429,"acs":3238,"articleLive":2,"columnArticles":76,"formTitle":"[1265]逆序打印不可变链表","frequency":0.5274230743,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"","submitted":3527,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8246502978195833,"acs":30597,"articleLive":2,"columnArticles":462,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":37103,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6092711154887959,"acs":9897,"articleLive":2,"columnArticles":156,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":16244,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5875621239863981,"acs":8985,"articleLive":2,"columnArticles":153,"formTitle":"[1268]搜索推荐系统","frequency":0.9844113355,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":15292,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4908938529478129,"acs":30458,"articleLive":2,"columnArticles":324,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":62046,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8040381518642388,"acs":6491,"articleLive":2,"columnArticles":88,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"","submitted":8073,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5071542130365659,"acs":2552,"articleLive":2,"columnArticles":46,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"","submitted":5032,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5238819592333435,"acs":1722,"articleLive":2,"columnArticles":34,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"","submitted":3287,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.541544477028348,"acs":1662,"articleLive":2,"columnArticles":49,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"","submitted":3069,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6096413874191652,"acs":1037,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"","submitted":1701,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5456381769978538,"acs":8644,"articleLive":2,"columnArticles":176,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.3591952806,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15842,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5039375873997203,"acs":6847,"articleLive":2,"columnArticles":104,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13587,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7281429483088705,"acs":20538,"articleLive":2,"columnArticles":250,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":1.3158804347,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":28206,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.6035162170354653,"acs":3982,"articleLive":2,"columnArticles":61,"formTitle":"[1278]分割回文串 III","frequency":1.5206748473,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6598,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6251840942562592,"acs":1698,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"","submitted":2716,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5044874822862542,"acs":7476,"articleLive":2,"columnArticles":76,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"","submitted":14819,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.831493390496606,"acs":46547,"articleLive":2,"columnArticles":633,"formTitle":"[1281]整数的各位积和之差","frequency":0.9844113355,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":55980,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8106922126081583,"acs":13117,"articleLive":2,"columnArticles":247,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":16180,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.4218456783309416,"acs":7643,"articleLive":2,"columnArticles":104,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.4378109156,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":18118,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6682005328166626,"acs":2759,"articleLive":2,"columnArticles":63,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.7097446311,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":4129,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8127914723517655,"acs":4880,"articleLive":2,"columnArticles":66,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"","submitted":6004,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.650853889943074,"acs":5145,"articleLive":2,"columnArticles":104,"formTitle":"[1286]字母组合迭代器","frequency":0.5946753013,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7905,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.602145437297041,"acs":16503,"articleLive":2,"columnArticles":228,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":1.3467470827,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":27407,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5644417794101113,"acs":15061,"articleLive":2,"columnArticles":181,"formTitle":"[1288]删除被覆盖区间","frequency":1.4121084668,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":26683,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6209439528023599,"acs":7578,"articleLive":2,"columnArticles":111,"formTitle":"[1289]下降路径最小和  II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":12204,"title":"下降路径最小和  II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.807530727525618,"acs":56897,"articleLive":2,"columnArticles":736,"formTitle":"[1290]二进制链表转整数","frequency":0.3591952806,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":70458,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5208131655372701,"acs":7532,"articleLive":2,"columnArticles":171,"formTitle":"[1291]顺次数","frequency":0.4378109156,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":14462,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.47736685315701516,"acs":6570,"articleLive":2,"columnArticles":101,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":13763,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.3652445890153885,"acs":14597,"articleLive":2,"columnArticles":130,"formTitle":"[1293]网格中的最短路径","frequency":2.6139820838,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":39965,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6543735627288987,"acs":7683,"articleLive":2,"columnArticles":81,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"","submitted":11741,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8080608885556896,"acs":49581,"articleLive":2,"columnArticles":663,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.3843222307,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":61358,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.47924965962382127,"acs":9504,"articleLive":2,"columnArticles":149,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.3591952806,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":19831,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.4620859385393109,"acs":6947,"articleLive":2,"columnArticles":96,"formTitle":"[1297]子串的最大出现次数","frequency":1.0470983134,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":15034,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5906857509079256,"acs":2765,"articleLive":2,"columnArticles":96,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4681,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7875768972130208,"acs":31622,"articleLive":2,"columnArticles":449,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":40151,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.46489584894350366,"acs":24818,"articleLive":2,"columnArticles":376,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.4105017363,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":53384,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.36116581331232767,"acs":3668,"articleLive":2,"columnArticles":88,"formTitle":"[1301]最大得分的路径数目","frequency":0.4105017363,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":10156,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8208608887341919,"acs":21225,"articleLive":2,"columnArticles":314,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.9844113355,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":25857,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8234841358077483,"acs":9629,"articleLive":2,"columnArticles":90,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"","submitted":11693,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7228415867254343,"acs":22304,"articleLive":2,"columnArticles":400,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":30856,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.747254809948381,"acs":15924,"articleLive":2,"columnArticles":239,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.4378109156,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":21310,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5762986022096075,"acs":18883,"articleLive":2,"columnArticles":290,"formTitle":"[1306]跳跃游戏 III","frequency":0.9548670892,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":32766,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33015101544870684,"acs":1902,"articleLive":2,"columnArticles":58,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5761,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7523587953987334,"acs":5821,"articleLive":2,"columnArticles":63,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"","submitted":7737,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7544425087108014,"acs":17322,"articleLive":2,"columnArticles":300,"formTitle":"[1309]解码字母到整数映射","frequency":0.4378109156,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":22960,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7145508959351441,"acs":37724,"articleLive":2,"columnArticles":508,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":52794,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.38362124951292376,"acs":5907,"articleLive":2,"columnArticles":91,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":15398,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6697133125177406,"acs":11797,"articleLive":2,"columnArticles":156,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.3843222307,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":17615,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8327559127864006,"acs":36055,"articleLive":2,"columnArticles":554,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":43296,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7491891317062795,"acs":14090,"articleLive":2,"columnArticles":225,"formTitle":"[1314]矩阵区域和","frequency":1.4121084668,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":18807,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8114793467819404,"acs":13516,"articleLive":2,"columnArticles":282,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":16656,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.44354123558971326,"acs":3001,"articleLive":2,"columnArticles":64,"formTitle":"[1316]不同的循环子字符串","frequency":0.6692532698,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6766,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6172931469172588,"acs":10773,"articleLive":2,"columnArticles":205,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":17452,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6576506200566351,"acs":6735,"articleLive":2,"columnArticles":123,"formTitle":"[1318]或运算的最小翻转次数","frequency":1.1152097392,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":10241,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6186414922311286,"acs":32569,"articleLive":2,"columnArticles":524,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":52646,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5929203539823009,"acs":2613,"articleLive":2,"columnArticles":62,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4407,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6190776209677419,"acs":4913,"articleLive":2,"columnArticles":90,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.4663353824,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"","submitted":7936,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5949622166246852,"acs":5905,"articleLive":2,"columnArticles":68,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"","submitted":9925,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7535702905477825,"acs":26014,"articleLive":2,"columnArticles":505,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.3843222307,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":34521,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5897387885029491,"acs":6299,"articleLive":2,"columnArticles":128,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10681,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7291450777202072,"acs":11258,"articleLive":2,"columnArticles":196,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":15440,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47392780006170937,"acs":6144,"articleLive":2,"columnArticles":97,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12964,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6898047722342733,"acs":6042,"articleLive":2,"columnArticles":58,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"","submitted":8759,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.4665481218048455,"acs":6297,"articleLive":2,"columnArticles":125,"formTitle":"[1328]破坏回文串","frequency":0.4105017363,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":13497,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7713069656389494,"acs":7430,"articleLive":2,"columnArticles":168,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.9264156679,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9633,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.38492555831265507,"acs":1241,"articleLive":2,"columnArticles":32,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":1.0804236231,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3224,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5328651105143566,"acs":12898,"articleLive":2,"columnArticles":222,"formTitle":"[1331]数组序号转换","frequency":1.3467470827,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":24205,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.692448854754299,"acs":10188,"articleLive":2,"columnArticles":141,"formTitle":"[1332]删除回文子序列","frequency":0.4105017363,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":14713,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5492331427534259,"acs":6052,"articleLive":2,"columnArticles":127,"formTitle":"[1333]餐厅过滤器","frequency":1.1152097392,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":11019,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4996437336711266,"acs":6311,"articleLive":2,"columnArticles":98,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":1.3787942601,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":12631,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5904139433551199,"acs":3794,"articleLive":2,"columnArticles":61,"formTitle":"[1335]工作计划的最低难度","frequency":0.5274230743,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":6426,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4338567433856743,"acs":2017,"articleLive":2,"columnArticles":50,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"","submitted":4649,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7046537706756378,"acs":40216,"articleLive":2,"columnArticles":646,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":2.1423630639,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":57072,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6406831472620946,"acs":9641,"articleLive":2,"columnArticles":144,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":15048,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.40235834195958414,"acs":8940,"articleLive":2,"columnArticles":143,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.4378109156,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":22219,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.574284304047384,"acs":4654,"articleLive":2,"columnArticles":100,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":8104,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.43524541691306917,"acs":3680,"articleLive":2,"columnArticles":52,"formTitle":"[1341]电影评分","frequency":0.4378109156,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"","submitted":8455,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8188656536783512,"acs":43544,"articleLive":2,"columnArticles":653,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.4105017363,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":53176,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5487995395494162,"acs":13349,"articleLive":2,"columnArticles":227,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":24324,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.596882558452029,"acs":6663,"articleLive":2,"columnArticles":125,"formTitle":"[1344]时钟指针的夹角","frequency":1.0151262807,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":11163,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.36380085215665675,"acs":6233,"articleLive":2,"columnArticles":115,"formTitle":"[1345]跳跃游戏 IV","frequency":0.4961705308,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":17133,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43319190020071646,"acs":17050,"articleLive":2,"columnArticles":292,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":39359,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7446203094433577,"acs":8374,"articleLive":2,"columnArticles":130,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":11246,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3118652894714001,"acs":3593,"articleLive":2,"columnArticles":58,"formTitle":"[1348]推文计数","frequency":1.4121084668,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":11521,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5058683702273065,"acs":3405,"articleLive":2,"columnArticles":99,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6731,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8460889929742389,"acs":9032,"articleLive":2,"columnArticles":89,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"","submitted":10675,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7535034914519624,"acs":31293,"articleLive":2,"columnArticles":568,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.4105017363,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":41530,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.45033937355999754,"acs":7232,"articleLive":2,"columnArticles":80,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":16059,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.2866267004842057,"acs":12431,"articleLive":2,"columnArticles":163,"formTitle":"[1353]最多可以参加的会议数目","frequency":1.8216777638,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":43370,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.281478736217919,"acs":3038,"articleLive":2,"columnArticles":75,"formTitle":"[1354]多次求和构造目标数组","frequency":0.7097446311,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10793,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6639876352395673,"acs":4296,"articleLive":2,"columnArticles":63,"formTitle":"[1355]活动参与者","frequency":0.4378109156,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"","submitted":6470,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7307279431211786,"acs":46969,"articleLive":2,"columnArticles":526,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":1.0151262807,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":64277,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5338529548627269,"acs":4589,"articleLive":2,"columnArticles":46,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.4105017363,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":8596,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4965756060023086,"acs":6453,"articleLive":2,"columnArticles":121,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":12995,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.554337899543379,"acs":3035,"articleLive":2,"columnArticles":74,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5475,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5070598457695232,"acs":9337,"articleLive":2,"columnArticles":151,"formTitle":"[1360]日期之间隔几天","frequency":1.3467470827,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":18414,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.40097282955829605,"acs":8161,"articleLive":2,"columnArticles":214,"formTitle":"[1361]验证二叉树","frequency":0.4105017363,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":20353,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5312157721796276,"acs":5820,"articleLive":2,"columnArticles":75,"formTitle":"[1362]最接近的因数","frequency":0.4961705308,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10956,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3681090289608177,"acs":5402,"articleLive":2,"columnArticles":102,"formTitle":"[1363]形成三的最大倍数","frequency":0.4961705308,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":14675,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6836427939876216,"acs":3866,"articleLive":2,"columnArticles":73,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"","submitted":5655,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8243973089142217,"acs":88227,"articleLive":2,"columnArticles":1117,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.4378109156,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":107020,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5407874700891886,"acs":7458,"articleLive":2,"columnArticles":144,"formTitle":"[1366]通过投票对团队排名","frequency":0.4105017363,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13791,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4196314207293164,"acs":16053,"articleLive":2,"columnArticles":235,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":38255,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5367009750812568,"acs":3963,"articleLive":2,"columnArticles":96,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.4378109156,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":7384,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6040388041971887,"acs":3051,"articleLive":2,"columnArticles":44,"formTitle":"[1369]获取最近第二次的活动","frequency":0.4378109156,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"","submitted":5051,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7904283747671876,"acs":48805,"articleLive":2,"columnArticles":583,"formTitle":"[1370]上升下降字符串","frequency":0.4105017363,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":61745,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5810306198655714,"acs":21784,"articleLive":2,"columnArticles":280,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":1.0151262807,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":37492,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5191009917258377,"acs":8846,"articleLive":2,"columnArticles":172,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":17041,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.4059114154459565,"acs":9366,"articleLive":2,"columnArticles":195,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":1.4467860052,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":23074,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7408905177134673,"acs":17588,"articleLive":2,"columnArticles":233,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":23739,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5796170158077368,"acs":9020,"articleLive":2,"columnArticles":179,"formTitle":"[1375]二进制字符串前缀一致的次数","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15562,"title":"二进制字符串前缀一致的次数","titleSlug":"number-of-times-binary-string-is-prefix-aligned"},{"acceptance":0.5074484339190222,"acs":7971,"articleLive":2,"columnArticles":162,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":15708,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32781359906213364,"acs":4474,"articleLive":2,"columnArticles":136,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.5602128972,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":13648,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8650368385800402,"acs":7749,"articleLive":2,"columnArticles":64,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"","submitted":8958,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8387417725394153,"acs":10959,"articleLive":2,"columnArticles":171,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":13066,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7274534984879241,"acs":17560,"articleLive":2,"columnArticles":268,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":24139,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7309948180627527,"acs":12837,"articleLive":2,"columnArticles":176,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.4378109156,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":17561,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.7031152824108102,"acs":12436,"articleLive":2,"columnArticles":190,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":17687,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.3263288009888752,"acs":4752,"articleLive":2,"columnArticles":92,"formTitle":"[1383]最大的团队表现值","frequency":1.2296200904,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14562,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5493981945837513,"acs":2191,"articleLive":2,"columnArticles":50,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"","submitted":3988,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.6989018271324434,"acs":14765,"articleLive":2,"columnArticles":222,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":21126,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3177297504064263,"acs":6645,"articleLive":2,"columnArticles":135,"formTitle":"[1386]安排电影院座位","frequency":1.3787942601,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20914,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6947354284179426,"acs":10346,"articleLive":2,"columnArticles":190,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14892,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5487082246977957,"acs":4630,"articleLive":2,"columnArticles":57,"formTitle":"[1388]3n 块披萨","frequency":0.4663353824,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":8438,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8307298335467349,"acs":29196,"articleLive":2,"columnArticles":496,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.4105017363,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":35145,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3648606489184692,"acs":7017,"articleLive":2,"columnArticles":124,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":19232,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.4020291693088142,"acs":6974,"articleLive":2,"columnArticles":210,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.5274230743,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":17347,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.4120923207627319,"acs":8731,"articleLive":2,"columnArticles":159,"formTitle":"[1392]最长快乐前缀","frequency":1.0470983134,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":21187,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8569242540168325,"acs":4480,"articleLive":2,"columnArticles":66,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"","submitted":5228,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6655852440491379,"acs":18259,"articleLive":2,"columnArticles":299,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":27433,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7388751850024667,"acs":14977,"articleLive":2,"columnArticles":214,"formTitle":"[1395]统计作战单位数","frequency":0.4105017363,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":20270,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4072247970285639,"acs":12389,"articleLive":2,"columnArticles":170,"formTitle":"[1396]设计地铁系统","frequency":0.4105017363,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":30423,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.38605619146722164,"acs":1113,"articleLive":2,"columnArticles":38,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2883,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7594717811664833,"acs":4831,"articleLive":2,"columnArticles":76,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"","submitted":6361,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.67046818727491,"acs":10053,"articleLive":2,"columnArticles":162,"formTitle":"[1399]统计最大组的数目","frequency":0.4105017363,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14994,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6074565684169432,"acs":6224,"articleLive":2,"columnArticles":105,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":10246,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.4192865779927449,"acs":4161,"articleLive":2,"columnArticles":96,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9924,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.754345904537419,"acs":10241,"articleLive":2,"columnArticles":186,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":13576,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6895467160037003,"acs":22362,"articleLive":2,"columnArticles":375,"formTitle":"[1403]非递增顺序的最小子序列","frequency":1.0151262807,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":32430,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4945857795172864,"acs":7582,"articleLive":2,"columnArticles":161,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":15330,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5098960080509896,"acs":6080,"articleLive":2,"columnArticles":147,"formTitle":"[1405]最长快乐字符串","frequency":1.3626179125,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11924,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5686339158149247,"acs":5174,"articleLive":2,"columnArticles":85,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":9099,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6704045273527562,"acs":6397,"articleLive":2,"columnArticles":71,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"","submitted":9542,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.615001946619371,"acs":14217,"articleLive":2,"columnArticles":215,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":23117,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8072437659998104,"acs":8514,"articleLive":2,"columnArticles":140,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10547,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.47521505043628937,"acs":7679,"articleLive":2,"columnArticles":121,"formTitle":"[1410]HTML 实体解析器","frequency":0.5602128972,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":16159,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5517666392769104,"acs":8058,"articleLive":2,"columnArticles":146,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":1.1515773834,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14604,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5489331687533063,"acs":3113,"articleLive":2,"columnArticles":73,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"","submitted":5671,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6962439394824465,"acs":11919,"articleLive":2,"columnArticles":247,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.3843222307,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":17119,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.60535533587608,"acs":7777,"articleLive":2,"columnArticles":155,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":1.3467470827,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12847,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.686214700383745,"acs":6974,"articleLive":2,"columnArticles":188,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.4378109156,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":10163,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.41135444273957317,"acs":2949,"articleLive":2,"columnArticles":55,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":7169,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5210378148063608,"acs":13696,"articleLive":2,"columnArticles":191,"formTitle":"[1417]重新格式化字符串","frequency":0.4105017363,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":26286,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7315247119927066,"acs":26479,"articleLive":2,"columnArticles":420,"formTitle":"[1418]点菜展示表","frequency":1.3787942601,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":36197,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.42154817039035064,"acs":8283,"articleLive":2,"columnArticles":161,"formTitle":"[1419]数青蛙","frequency":1.3787942601,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":19649,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.6032045240339302,"acs":2560,"articleLive":2,"columnArticles":47,"formTitle":"[1420]生成数组","frequency":0.8989866308,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4244,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7415207271115052,"acs":3345,"articleLive":2,"columnArticles":41,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":1,"nodeType":"def","questionId":"1551","status":"","submitted":4511,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5409343984507383,"acs":11173,"articleLive":2,"columnArticles":209,"formTitle":"[1422]分割字符串的最大得分","frequency":0.4105017363,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":20655,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.554648697758934,"acs":36629,"articleLive":2,"columnArticles":535,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":66040,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.4022187534842234,"acs":7215,"articleLive":2,"columnArticles":158,"formTitle":"[1424]对角线遍历 II","frequency":1.0151262807,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":17938,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.4449865194505071,"acs":3466,"articleLive":2,"columnArticles":76,"formTitle":"[1425]带限制的子序列和","frequency":0.4663353824,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7789,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.6993970714900948,"acs":1624,"articleLive":2,"columnArticles":55,"formTitle":"[1426]数元素","frequency":1.3158804347,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"","submitted":2322,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6429897864438254,"acs":1385,"articleLive":2,"columnArticles":53,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"","submitted":2154,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5989330746847721,"acs":1235,"articleLive":2,"columnArticles":23,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"","submitted":2062,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.49797421731123387,"acs":1352,"articleLive":2,"columnArticles":51,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"","submitted":2715,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5695410292072323,"acs":819,"articleLive":2,"columnArticles":31,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"","submitted":1438,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8460855690691801,"acs":80071,"articleLive":2,"columnArticles":1052,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":94637,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39656031904287137,"acs":4773,"articleLive":2,"columnArticles":104,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":12036,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6409164639091647,"acs":6322,"articleLive":2,"columnArticles":115,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9864,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.46994342291371993,"acs":2658,"articleLive":2,"columnArticles":46,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5656,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6220472440944882,"acs":4582,"articleLive":2,"columnArticles":51,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"","submitted":7366,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8225291110479978,"acs":46338,"articleLive":2,"columnArticles":659,"formTitle":"[1436]旅行终点站","frequency":0.9548670892,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":56336,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5827698343054767,"acs":11290,"articleLive":2,"columnArticles":191,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":19373,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4824761743641798,"acs":34223,"articleLive":2,"columnArticles":483,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":0.9844113355,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":70932,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5415278934221482,"acs":5203,"articleLive":2,"columnArticles":71,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":1.0151262807,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":9608,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.7031578947368421,"acs":3006,"articleLive":2,"columnArticles":42,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"","submitted":4275,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.64928522804629,"acs":19076,"articleLive":2,"columnArticles":384,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":29380,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7914615228974169,"acs":35205,"articleLive":2,"columnArticles":379,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":44481,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4120276594258574,"acs":5899,"articleLive":2,"columnArticles":146,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":14317,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5296021321149819,"acs":2782,"articleLive":2,"columnArticles":64,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":5253,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8569771936606108,"acs":4434,"articleLive":2,"columnArticles":56,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"","submitted":5174,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.6106230896969989,"acs":50744,"articleLive":2,"columnArticles":686,"formTitle":"[1446]连续字符","frequency":1.6186003845,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":83102,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6137440758293838,"acs":6475,"articleLive":2,"columnArticles":84,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":10550,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7139950403764227,"acs":11229,"articleLive":2,"columnArticles":181,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.9844113355,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":15727,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6272394744699911,"acs":16805,"articleLive":2,"columnArticles":207,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26792,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8028508913057468,"acs":24951,"articleLive":2,"columnArticles":353,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"ac","submitted":31078,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5254295532646048,"acs":10703,"articleLive":2,"columnArticles":164,"formTitle":"[1451]重新排列句子中的单词","frequency":0.4105017363,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":20370,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.5012602650622002,"acs":6165,"articleLive":2,"columnArticles":92,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":12299,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.3675377097939239,"acs":1730,"articleLive":2,"columnArticles":35,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.9548670892,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4707,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.393541518807665,"acs":5545,"articleLive":2,"columnArticles":87,"formTitle":"[1454]活跃用户","frequency":1.1515773834,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"","submitted":14090,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.627675803356134,"acs":12755,"articleLive":2,"columnArticles":225,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":20321,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5257010955694894,"acs":15259,"articleLive":2,"columnArticles":228,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.4105017363,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":29026,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6299277144347567,"acs":8453,"articleLive":2,"columnArticles":147,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":13419,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4433839810643659,"acs":5807,"articleLive":2,"columnArticles":92,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":13097,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.6003721795766457,"acs":2581,"articleLive":2,"columnArticles":51,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"","submitted":4299,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.742085364187127,"acs":16291,"articleLive":2,"columnArticles":330,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":21953,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5071018193424832,"acs":6355,"articleLive":2,"columnArticles":91,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":12532,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.4367726920093095,"acs":7319,"articleLive":2,"columnArticles":146,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":16757,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.595243106714376,"acs":2828,"articleLive":2,"columnArticles":69,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4751,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7672579553148273,"acs":28331,"articleLive":2,"columnArticles":402,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.9844113355,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":36925,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3138075313807531,"acs":6750,"articleLive":2,"columnArticles":85,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.4378109156,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":21510,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.48305145222293583,"acs":6769,"articleLive":2,"columnArticles":127,"formTitle":"[1466]重新规划路线","frequency":0.4663353824,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":14013,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6178343949044586,"acs":1746,"articleLive":2,"columnArticles":50,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2826,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7009286618826509,"acs":3321,"articleLive":2,"columnArticles":56,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"","submitted":4738,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.8008968609865471,"acs":2679,"articleLive":2,"columnArticles":98,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"","submitted":3345,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8421689846694008,"acs":55648,"articleLive":2,"columnArticles":750,"formTitle":"[1470]重新排列数组","frequency":0.4105017363,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":66077,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5465975280579628,"acs":7695,"articleLive":2,"columnArticles":111,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.5274230743,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":14078,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6206625638339662,"acs":9480,"articleLive":2,"columnArticles":154,"formTitle":"[1472]设计浏览器历史记录","frequency":1.2861163328,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":15274,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6726758874662784,"acs":15709,"articleLive":2,"columnArticles":168,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23353,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7149035262807718,"acs":2149,"articleLive":2,"columnArticles":73,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"","submitted":3006,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7213889724526193,"acs":16786,"articleLive":2,"columnArticles":258,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":23269,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8642734364670105,"acs":13073,"articleLive":2,"columnArticles":123,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":15126,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.29095969598030297,"acs":5436,"articleLive":2,"columnArticles":105,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.9844113355,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":18683,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5858424725822532,"acs":2938,"articleLive":2,"columnArticles":63,"formTitle":"[1478]安排邮筒","frequency":0.5602128972,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":5015,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5637566810893357,"acs":2215,"articleLive":2,"columnArticles":44,"formTitle":"[1479]周内每天的销售情况","frequency":0.4663353824,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"","submitted":3929,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8692209199251453,"acs":132378,"articleLive":2,"columnArticles":1347,"formTitle":"[1480]一维数组的动态和","frequency":1.8216777638,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":152295,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5167202418078012,"acs":10770,"articleLive":2,"columnArticles":154,"formTitle":"[1481]不同整数的最少数目","frequency":1.3467470827,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":20843,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5874915248025508,"acs":32060,"articleLive":2,"columnArticles":418,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":54571,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.30303801765105226,"acs":3571,"articleLive":2,"columnArticles":78,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11784,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8136200716845878,"acs":908,"articleLive":2,"columnArticles":27,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"","submitted":1116,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.656832298136646,"acs":4230,"articleLive":2,"columnArticles":49,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"","submitted":6440,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8585889789226053,"acs":72264,"articleLive":2,"columnArticles":705,"formTitle":"[1486]数组异或操作","frequency":0.3591952806,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":84166,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.3132805833527267,"acs":8077,"articleLive":2,"columnArticles":108,"formTitle":"[1487]保证文件名唯一","frequency":1.0804236231,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":25782,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.24427988514432522,"acs":8082,"articleLive":2,"columnArticles":122,"formTitle":"[1488]避免洪水泛滥","frequency":3.1154463448,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":33085,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6890240336822409,"acs":11783,"articleLive":2,"columnArticles":129,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.5602128972,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":17101,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8522652659225214,"acs":1298,"articleLive":2,"columnArticles":32,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"","submitted":1523,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6721569889013994,"acs":20894,"articleLive":2,"columnArticles":309,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":31085,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6518235440724433,"acs":7846,"articleLive":2,"columnArticles":92,"formTitle":"[1492]n 的第 k 个因子","frequency":1.3158804347,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":12037,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5751833344149523,"acs":8863,"articleLive":2,"columnArticles":167,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":0.9264156679,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":15409,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3730704569769219,"acs":2441,"articleLive":2,"columnArticles":39,"formTitle":"[1494]并行课程 II","frequency":1.1896627174,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6543,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5411547911547911,"acs":4405,"articleLive":2,"columnArticles":42,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"","submitted":8140,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.535624399395964,"acs":11705,"articleLive":2,"columnArticles":177,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":21853,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39422738472368885,"acs":8960,"articleLive":2,"columnArticles":119,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.9844113355,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":22728,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33544151307071435,"acs":5569,"articleLive":2,"columnArticles":75,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":16602,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.37806109568290835,"acs":2995,"articleLive":2,"columnArticles":66,"formTitle":"[1499]满足不等式的最大值","frequency":0.5274230743,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7922,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.3032333236236528,"acs":1041,"articleLive":2,"columnArticles":33,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"","submitted":3433,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5967273686988651,"acs":4522,"articleLive":2,"columnArticles":65,"formTitle":"[1501]可以放心投资的国家","frequency":0.4663353824,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"","submitted":7578,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7162612104613071,"acs":26675,"articleLive":2,"columnArticles":314,"formTitle":"[1502]判断能否形成等差数列","frequency":1.5805729889,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":37242,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.516457453577833,"acs":8928,"articleLive":2,"columnArticles":92,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.4105017363,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":17287,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.600272335274983,"acs":7935,"articleLive":2,"columnArticles":139,"formTitle":"[1504]统计全 1 子矩形","frequency":0.9844113355,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":13219,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.36397370653095845,"acs":3433,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9432,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8374512353706112,"acs":644,"articleLive":2,"columnArticles":18,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"","submitted":769,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5880097788643183,"acs":10583,"articleLive":2,"columnArticles":139,"formTitle":"[1507]转变日期格式","frequency":0.3843222307,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":17998,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5536436376150735,"acs":6435,"articleLive":2,"columnArticles":58,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":11623,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5520062329567589,"acs":5668,"articleLive":2,"columnArticles":84,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.4961705308,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":10268,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.581102698091074,"acs":5449,"articleLive":2,"columnArticles":67,"formTitle":"[1510]石子游戏 IV","frequency":1.0151262807,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":9377,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6824960185319241,"acs":4714,"articleLive":2,"columnArticles":65,"formTitle":"[1511]消费者下单频率","frequency":0.4378109156,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"","submitted":6907,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8482445259035221,"acs":60859,"articleLive":2,"columnArticles":779,"formTitle":"[1512]好数对的数目","frequency":1.3787942601,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":71747,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.38267915255362955,"acs":11524,"articleLive":2,"columnArticles":165,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":30114,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.33895434462444773,"acs":9206,"articleLive":2,"columnArticles":160,"formTitle":"[1514]概率最大的路径","frequency":0.9548670892,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":27160,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34501126818274946,"acs":3368,"articleLive":2,"columnArticles":62,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9762,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.585812356979405,"acs":256,"articleLive":2,"columnArticles":14,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"","submitted":437,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.6587908269631688,"acs":3792,"articleLive":2,"columnArticles":39,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"","submitted":5756,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.7031800269693518,"acs":53711,"articleLive":2,"columnArticles":802,"formTitle":"[1518]换酒问题","frequency":0.179210257,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":76383,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.3017630391436667,"acs":5751,"articleLive":2,"columnArticles":127,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.4663353824,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":19058,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.3359003978950071,"acs":2617,"articleLive":2,"columnArticles":74,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7791,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.39398240136247514,"acs":2776,"articleLive":2,"columnArticles":55,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":7046,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7098591549295775,"acs":1008,"articleLive":2,"columnArticles":34,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"","submitted":1420,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5747695913909754,"acs":10789,"articleLive":2,"columnArticles":183,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":18771,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.43522674508590004,"acs":5624,"articleLive":2,"columnArticles":112,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.4105017363,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":12922,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.659009009009009,"acs":5852,"articleLive":2,"columnArticles":117,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8880,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6217937056576315,"acs":3418,"articleLive":2,"columnArticles":56,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5497,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.4917791411042945,"acs":4008,"articleLive":2,"columnArticles":42,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"","submitted":8150,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7854168756897763,"acs":31313,"articleLive":2,"columnArticles":383,"formTitle":"[1528]重新排列字符串","frequency":1.3467470827,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":39868,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6937845510234574,"acs":9287,"articleLive":2,"columnArticles":139,"formTitle":"[1529]最少的后缀翻转次数","frequency":0.4378109156,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":13386,"title":"最少的后缀翻转次数","titleSlug":"minimum-suffix-flips"},{"acceptance":0.5711158368776582,"acs":9131,"articleLive":2,"columnArticles":152,"formTitle":"[1530]好叶子节点对的数量","frequency":1.4829345194,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15988,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3437757625721352,"acs":2085,"articleLive":2,"columnArticles":36,"formTitle":"[1531]压缩字符串 II","frequency":2.3047938061,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":6065,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6185105969278631,"acs":3181,"articleLive":2,"columnArticles":52,"formTitle":"[1532]最近的三笔订单","frequency":1.5601432692,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"","submitted":5143,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6046511627906976,"acs":364,"articleLive":2,"columnArticles":21,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"","submitted":602,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.786081472201823,"acs":18197,"articleLive":2,"columnArticles":170,"formTitle":"[1534]统计好三元组","frequency":1.0151262807,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":23149,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4551169055775435,"acs":13684,"articleLive":2,"columnArticles":187,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.4105017363,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":30067,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.44452562363010123,"acs":4259,"articleLive":2,"columnArticles":84,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.7097446311,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9581,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.36892975011786894,"acs":4695,"articleLive":2,"columnArticles":98,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12726,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.6033755274261603,"acs":143,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"","submitted":237,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5399413975789504,"acs":18243,"articleLive":2,"columnArticles":265,"formTitle":"[1539]第 k 个缺失的正整数","frequency":1.0151262807,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":33787,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3191784274193548,"acs":5066,"articleLive":2,"columnArticles":91,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15872,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4672027646706985,"acs":7030,"articleLive":2,"columnArticles":107,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":15047,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.3882714243930974,"acs":2655,"articleLive":2,"columnArticles":51,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6838,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5544929925803792,"acs":3363,"articleLive":2,"columnArticles":46,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"","submitted":6065,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5506085509206283,"acs":21172,"articleLive":2,"columnArticles":337,"formTitle":"[1544]整理字符串","frequency":1.3787942601,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":38452,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5553271425533424,"acs":7834,"articleLive":2,"columnArticles":104,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":1.0151262807,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":14107,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.41836734693877553,"acs":5453,"articleLive":2,"columnArticles":82,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":13034,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5392884566163296,"acs":4214,"articleLive":2,"columnArticles":73,"formTitle":"[1547]切棍子的最小成本","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7814,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.712707182320442,"acs":387,"articleLive":2,"columnArticles":16,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"","submitted":543,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6676342525399129,"acs":2760,"articleLive":2,"columnArticles":53,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"","submitted":4134,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.65589130944015,"acs":22400,"articleLive":2,"columnArticles":302,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":34152,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8176323468111714,"acs":11769,"articleLive":2,"columnArticles":165,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":14394,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5140068583487206,"acs":9743,"articleLive":2,"columnArticles":130,"formTitle":"[1552]两球之间的磁力","frequency":0.9844113355,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":18955,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29854503720706377,"acs":8064,"articleLive":2,"columnArticles":126,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":1.3787942601,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":27011,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7056277056277056,"acs":652,"articleLive":2,"columnArticles":22,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"","submitted":924,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.44155324259407525,"acs":3309,"articleLive":2,"columnArticles":62,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"","submitted":7494,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5751169227832394,"acs":12051,"articleLive":2,"columnArticles":185,"formTitle":"[1556]千位分隔数","frequency":2.1423630639,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":20954,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7765113137453563,"acs":9197,"articleLive":2,"columnArticles":130,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":1.2861163328,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":11844,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6242568370986921,"acs":4725,"articleLive":2,"columnArticles":77,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.5274230743,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7569,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.3770491803278688,"acs":4140,"articleLive":2,"columnArticles":75,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":10980,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5714375827919006,"acs":9059,"articleLive":2,"columnArticles":93,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15853,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7785964035964036,"acs":12470,"articleLive":2,"columnArticles":186,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":1.0151262807,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":16016,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3109738784781374,"acs":4381,"articleLive":2,"columnArticles":89,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":14088,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3831091591179431,"acs":4187,"articleLive":2,"columnArticles":67,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10929,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5506512301013025,"acs":761,"articleLive":2,"columnArticles":28,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"","submitted":1382,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7314308053166536,"acs":3742,"articleLive":2,"columnArticles":46,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"","submitted":5116,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.44452047583956206,"acs":8445,"articleLive":2,"columnArticles":126,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.0,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":18998,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.4094935689468719,"acs":17797,"articleLive":2,"columnArticles":266,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":1.7896647868,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":43461,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.4589477211796247,"acs":2739,"articleLive":2,"columnArticles":51,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5968,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.4734905864531487,"acs":2188,"articleLive":2,"columnArticles":47,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4621,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8967817896389325,"acs":2285,"articleLive":2,"columnArticles":40,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.4105017363,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"","submitted":2548,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7602409638554217,"acs":3786,"articleLive":2,"columnArticles":46,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"","submitted":4980,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8012478065899785,"acs":20548,"articleLive":2,"columnArticles":341,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.9844113355,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":25645,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2986150635553026,"acs":4722,"articleLive":2,"columnArticles":67,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15813,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3319467554076539,"acs":5187,"articleLive":2,"columnArticles":90,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.4663353824,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":15626,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5944853815070121,"acs":5002,"articleLive":2,"columnArticles":72,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":8414,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47680550248376,"acs":18717,"articleLive":2,"columnArticles":267,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":39255,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.328592629235716,"acs":5314,"articleLive":2,"columnArticles":85,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.6309637533,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":16172,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5858000307802801,"acs":11419,"articleLive":2,"columnArticles":213,"formTitle":"[1578]使绳子变成彩色的最短时间","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":19493,"title":"使绳子变成彩色的最短时间","titleSlug":"minimum-time-to-make-rope-colorful"},{"acceptance":0.6195935974571462,"acs":16374,"articleLive":2,"columnArticles":298,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":26427,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.5970149253731343,"acs":320,"articleLive":2,"columnArticles":23,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"","submitted":536,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8079918032786885,"acs":3943,"articleLive":2,"columnArticles":55,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"","submitted":4880,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6698546042003231,"acs":10366,"articleLive":2,"columnArticles":124,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.4378109156,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":15475,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6852253816655813,"acs":18941,"articleLive":2,"columnArticles":246,"formTitle":"[1583]统计不开心的朋友","frequency":2.6139820838,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27642,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6631772824769188,"acs":28445,"articleLive":2,"columnArticles":362,"formTitle":"[1584]连接所有点的最小费用","frequency":1.6789323091,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":42892,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4309829435554774,"acs":2451,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5687,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6294200848656294,"acs":445,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"","submitted":707,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8323378839590444,"acs":3902,"articleLive":2,"columnArticles":44,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"","submitted":4688,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8389935250604144,"acs":45481,"articleLive":2,"columnArticles":723,"formTitle":"[1588]所有奇数长度子数组的和","frequency":2.1098323144,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":54209,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2976864121481269,"acs":4156,"articleLive":2,"columnArticles":60,"formTitle":"[1589]所有排列中的最大和","frequency":0.4378109156,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13961,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.27062462179788876,"acs":4025,"articleLive":2,"columnArticles":61,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.4961705308,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":14873,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5861098076020648,"acs":1249,"articleLive":2,"columnArticles":37,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":2131,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4449593189288216,"acs":8258,"articleLive":2,"columnArticles":131,"formTitle":"[1592]重新排列单词间的空格","frequency":0.4378109156,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":18559,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5416975537435137,"acs":5846,"articleLive":2,"columnArticles":95,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.9844113355,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10792,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3146339724855656,"acs":4414,"articleLive":2,"columnArticles":103,"formTitle":"[1594]矩阵的最大非负积","frequency":0.4961705308,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":14029,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4691242075604602,"acs":1998,"articleLive":2,"columnArticles":40,"formTitle":"[1595]连通两组点的最小成本","frequency":0.8469457526,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4259,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.755826859045505,"acs":2724,"articleLive":2,"columnArticles":47,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"","submitted":3604,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6639511201629328,"acs":326,"articleLive":2,"columnArticles":22,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"","submitted":491,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6732234223990904,"acs":11842,"articleLive":2,"columnArticles":158,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":17590,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.42122999157540014,"acs":4000,"articleLive":2,"columnArticles":71,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9496,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6756418284283031,"acs":17264,"articleLive":2,"columnArticles":210,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":25552,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.490343347639485,"acs":2285,"articleLive":2,"columnArticles":41,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4660,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7495867768595041,"acs":907,"articleLive":2,"columnArticles":36,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"","submitted":1210,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8437741354157727,"acs":58995,"articleLive":2,"columnArticles":470,"formTitle":"[1603]设计停车系统","frequency":1.2861163328,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":69918,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4152790392572409,"acs":4115,"articleLive":2,"columnArticles":71,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":1.1515773834,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9909,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7405743309240086,"acs":3791,"articleLive":2,"columnArticles":75,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":5119,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3501564945226917,"acs":1790,"articleLive":2,"columnArticles":38,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":5112,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5403520425107937,"acs":3254,"articleLive":2,"columnArticles":44,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"","submitted":6022,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.638622415539534,"acs":10718,"articleLive":2,"columnArticles":179,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":16783,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5933890793179486,"acs":27179,"articleLive":2,"columnArticles":433,"formTitle":"[1609]奇偶树","frequency":0.5194707461,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"ac","submitted":45803,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.44664520921020057,"acs":16236,"articleLive":2,"columnArticles":154,"formTitle":"[1610]可见点的最大数目","frequency":0.7638118524,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":36351,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.607993430057487,"acs":2221,"articleLive":2,"columnArticles":58,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3653,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7297297297297297,"acs":513,"articleLive":2,"columnArticles":23,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"","submitted":703,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7337278106508875,"acs":1984,"articleLive":2,"columnArticles":38,"formTitle":"[1613]找到遗失的ID","frequency":0.5274230743,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"","submitted":2704,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8211633109619687,"acs":18353,"articleLive":2,"columnArticles":303,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":22350,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.5038569424964937,"acs":5748,"articleLive":2,"columnArticles":70,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":11408,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.2774874637107416,"acs":5257,"articleLive":2,"columnArticles":97,"formTitle":"[1616]分割两个字符串得到回文串","frequency":1.4467860052,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18945,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6264815441923468,"acs":1850,"articleLive":2,"columnArticles":35,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2953,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5770440251572327,"acs":367,"articleLive":2,"columnArticles":18,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"","submitted":636,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6723653782623059,"acs":8141,"articleLive":2,"columnArticles":139,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":12108,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3736685129953132,"acs":2631,"articleLive":2,"columnArticles":44,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":7041,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.44239738805970147,"acs":1897,"articleLive":2,"columnArticles":37,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4288,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.15483835855012518,"acs":2845,"articleLive":2,"columnArticles":61,"formTitle":"[1622]奇妙序列","frequency":1.8893488444,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":18374,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.784857261067439,"acs":3794,"articleLive":2,"columnArticles":48,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"","submitted":4834,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6207271523805021,"acs":13129,"articleLive":2,"columnArticles":227,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.9844113355,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":21151,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5478818084727661,"acs":3078,"articleLive":2,"columnArticles":69,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5618,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.391320648608117,"acs":4175,"articleLive":2,"columnArticles":87,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.4961705308,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10669,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.38477643188275756,"acs":2573,"articleLive":2,"columnArticles":40,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6687,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8333333333333334,"acs":475,"articleLive":2,"columnArticles":21,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"","submitted":570,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5234392865309856,"acs":9156,"articleLive":2,"columnArticles":108,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":17492,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7622678396871945,"acs":7798,"articleLive":2,"columnArticles":125,"formTitle":"[1630]等差子数组","frequency":1.3467470827,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":10230,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.49375394321766564,"acs":27391,"articleLive":2,"columnArticles":315,"formTitle":"[1631]最小体力消耗路径","frequency":1.4829345194,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":55475,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3257060399917543,"acs":1580,"articleLive":2,"columnArticles":29,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4851,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.657075873827792,"acs":3083,"articleLive":2,"columnArticles":32,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"","submitted":4692,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5309187279151943,"acs":601,"articleLive":2,"columnArticles":30,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"","submitted":1132,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5480427046263345,"acs":1386,"articleLive":2,"columnArticles":38,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"","submitted":2529,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7051859032057052,"acs":10185,"articleLive":2,"columnArticles":201,"formTitle":"[1636]按照频率将数组升序排序","frequency":1.3158804347,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":14443,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.807447528774543,"acs":5963,"articleLive":2,"columnArticles":82,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":7385,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7153739612188366,"acs":3099,"articleLive":2,"columnArticles":52,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.5274230743,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":4332,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4005805515239477,"acs":1380,"articleLive":2,"columnArticles":33,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3445,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.654541015625,"acs":13405,"articleLive":2,"columnArticles":229,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":20480,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7733817376322915,"acs":12569,"articleLive":2,"columnArticles":291,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":1.0151262807,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":16252,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.452190847127556,"acs":6966,"articleLive":2,"columnArticles":112,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":15405,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4571155682903534,"acs":2393,"articleLive":2,"columnArticles":49,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":5235,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5595681310498883,"acs":1503,"articleLive":2,"columnArticles":29,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"","submitted":2686,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.42067510548523207,"acs":997,"articleLive":2,"columnArticles":28,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"","submitted":2370,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5338073653570445,"acs":36861,"articleLive":2,"columnArticles":369,"formTitle":"[1646]获取生成数组中的最大值","frequency":2.4222824414,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":69053,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5190005205622071,"acs":7976,"articleLive":2,"columnArticles":121,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":1.0151262807,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":15368,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.28180675685665707,"acs":3812,"articleLive":2,"columnArticles":94,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.9844113355,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":13527,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4749604638903532,"acs":2703,"articleLive":2,"columnArticles":68,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5691,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.8009105960264901,"acs":1935,"articleLive":2,"columnArticles":36,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.4105017363,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"","submitted":2416,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6614929785661493,"acs":895,"articleLive":2,"columnArticles":25,"formTitle":"[1651]Hopper Company Queries III","frequency":0.6309637533,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"","submitted":1353,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6511183171198137,"acs":7831,"articleLive":2,"columnArticles":195,"formTitle":"[1652]拆炸弹","frequency":0.4105017363,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":12027,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5154508611955421,"acs":4070,"articleLive":2,"columnArticles":93,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7896,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.28105654147750725,"acs":4086,"articleLive":2,"columnArticles":55,"formTitle":"[1654]到家的最少跳跃次数","frequency":1.3787942601,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":14538,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.37963891675025074,"acs":2271,"articleLive":2,"columnArticles":35,"formTitle":"[1655]分配重复整数","frequency":0.7097446311,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5982,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7820441476534966,"acs":8432,"articleLive":2,"columnArticles":100,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10782,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46547705168394826,"acs":5791,"articleLive":2,"columnArticles":83,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.4105017363,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":12441,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.3067572946327424,"acs":10019,"articleLive":2,"columnArticles":161,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.9844113355,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":32661,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.40679919331604725,"acs":1412,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":1.1515773834,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3471,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7417974322396577,"acs":520,"articleLive":2,"columnArticles":25,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"","submitted":701,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7351274787535411,"acs":3114,"articleLive":2,"columnArticles":61,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.9548670892,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"","submitted":4236,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8125160203595884,"acs":22189,"articleLive":2,"columnArticles":317,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":27309,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5731932415163993,"acs":8074,"articleLive":2,"columnArticles":136,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.4663353824,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":14086,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5500435161009574,"acs":5688,"articleLive":2,"columnArticles":110,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":10341,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6587866361114462,"acs":5462,"articleLive":2,"columnArticles":88,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":8291,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.711943793911007,"acs":304,"articleLive":2,"columnArticles":14,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"","submitted":427,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6039345816544205,"acs":2548,"articleLive":2,"columnArticles":35,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"","submitted":4219,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4452230787199252,"acs":7624,"articleLive":2,"columnArticles":145,"formTitle":"[1668]最大重复子字符串","frequency":0.3843222307,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":17124,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7533308950310883,"acs":14418,"articleLive":2,"columnArticles":267,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":19139,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5273256440659696,"acs":4892,"articleLive":2,"columnArticles":86,"formTitle":"[1670]设计前中后队列","frequency":0.4961705308,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":9277,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46829576574678744,"acs":2223,"articleLive":2,"columnArticles":46,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.5946753013,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4747,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8490747920115678,"acs":40517,"articleLive":2,"columnArticles":469,"formTitle":"[1672]最富有客户的资产总量","frequency":0.3350511817,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":47719,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.3613497475865734,"acs":8160,"articleLive":2,"columnArticles":178,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":22582,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3707880813143971,"acs":2663,"articleLive":2,"columnArticles":56,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.4961705308,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":7182,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4337109614206981,"acs":2833,"articleLive":2,"columnArticles":47,"formTitle":"[1675]数组的最小偏移量","frequency":0.6309637533,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":6532,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7691208005718371,"acs":1076,"articleLive":2,"columnArticles":27,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"","submitted":1399,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.37717756113153267,"acs":2360,"articleLive":2,"columnArticles":38,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"","submitted":6257,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8279076050249898,"acs":18387,"articleLive":2,"columnArticles":303,"formTitle":"[1678]设计 Goal 解析器","frequency":0.4105017363,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":22209,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49903184883488017,"acs":7474,"articleLive":2,"columnArticles":120,"formTitle":"[1679]K 和数对的最大数目","frequency":0.3843222307,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":14977,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.47137389038195293,"acs":5788,"articleLive":2,"columnArticles":74,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":12279,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3871268656716418,"acs":2490,"articleLive":2,"columnArticles":50,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6432,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5044472681067345,"acs":397,"articleLive":2,"columnArticles":18,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"","submitted":787,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8986563425187885,"acs":3946,"articleLive":2,"columnArticles":42,"formTitle":"[1683]无效的推文","frequency":0.4105017363,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"","submitted":4391,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8269673874512584,"acs":18663,"articleLive":2,"columnArticles":384,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":22568,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.6123099203475743,"acs":4228,"articleLive":2,"columnArticles":94,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6905,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4763830475574248,"acs":2945,"articleLive":2,"columnArticles":51,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":6182,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.3985102420856611,"acs":1070,"articleLive":2,"columnArticles":26,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2685,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8069474565308374,"acs":21209,"articleLive":2,"columnArticles":281,"formTitle":"[1688]比赛中的配对次数","frequency":0.9844113355,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":26283,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8653314152926856,"acs":15640,"articleLive":2,"columnArticles":207,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":18074,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5225893459204316,"acs":4650,"articleLive":2,"columnArticles":109,"formTitle":"[1690]石子游戏 VII","frequency":0.5946753013,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8898,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.49207561581057857,"acs":2577,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":5237,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6091954022988506,"acs":212,"articleLive":2,"columnArticles":13,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"","submitted":348,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8057266009852216,"acs":2617,"articleLive":2,"columnArticles":36,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"","submitted":3248,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6371282208119887,"acs":8333,"articleLive":2,"columnArticles":145,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":13079,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.47186118625057727,"acs":7152,"articleLive":2,"columnArticles":144,"formTitle":"[1695]删除子数组的最大得分","frequency":0.4105017363,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":15157,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.39558301865201967,"acs":6914,"articleLive":2,"columnArticles":123,"formTitle":"[1696]跳跃游戏 VI","frequency":0.4105017363,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":17478,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5316223648029331,"acs":2320,"articleLive":2,"columnArticles":46,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4364,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5158946412352406,"acs":568,"articleLive":2,"columnArticles":18,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.7526696758,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"","submitted":1101,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8031524926686217,"acs":2191,"articleLive":2,"columnArticles":45,"formTitle":"[1699]两人之间的通话次数","frequency":0.4663353824,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"","submitted":2728,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7037554200044095,"acs":9576,"articleLive":2,"columnArticles":201,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.4105017363,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":13607,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6144267926148561,"acs":4293,"articleLive":2,"columnArticles":87,"formTitle":"[1701]平均等待时间","frequency":0.4378109156,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6987,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4796870297923563,"acs":3188,"articleLive":2,"columnArticles":68,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6646,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.38887381275440974,"acs":1433,"articleLive":2,"columnArticles":25,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.7982980285,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3685,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7803406035255452,"acs":13059,"articleLive":2,"columnArticles":203,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":16735,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.45289913482723415,"acs":25284,"articleLive":2,"columnArticles":344,"formTitle":"[1705]吃苹果的最大数目","frequency":0.7904928062,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"ac","submitted":55827,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.593937875751503,"acs":4742,"articleLive":2,"columnArticles":120,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7984,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5032522870360708,"acs":14468,"articleLive":2,"columnArticles":153,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28749,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6902485659655831,"acs":1083,"articleLive":2,"columnArticles":27,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"","submitted":1569,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.719983552631579,"acs":1751,"articleLive":2,"columnArticles":43,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.4378109156,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"","submitted":2432,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6956637403564778,"acs":13075,"articleLive":2,"columnArticles":203,"formTitle":"[1710]卡车上的最大单元数","frequency":0.4105017363,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":18795,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3588902603891142,"acs":30529,"articleLive":2,"columnArticles":365,"formTitle":"[1711]大餐计数","frequency":2.5565455058,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":85065,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26508532550098524,"acs":7130,"articleLive":2,"columnArticles":107,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.4378109156,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":26897,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4945350961389603,"acs":15972,"articleLive":2,"columnArticles":173,"formTitle":"[1713]得到子序列的最少操作次数","frequency":2.6101201805,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":32297,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6062639821029083,"acs":271,"articleLive":2,"columnArticles":10,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"","submitted":447,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.725789286981199,"acs":2046,"articleLive":2,"columnArticles":39,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"","submitted":2819,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6688946015424164,"acs":9107,"articleLive":2,"columnArticles":203,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":13615,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.44076782449725777,"acs":2411,"articleLive":2,"columnArticles":54,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.5602128972,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5470,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4977457168620379,"acs":2208,"articleLive":2,"columnArticles":52,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.5946753013,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4436,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.37682789651293586,"acs":670,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1778,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8686223325605593,"acs":47584,"articleLive":2,"columnArticles":501,"formTitle":"[1720]解码异或后的数组","frequency":0.3843222307,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":54781,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.644017339530997,"acs":12331,"articleLive":2,"columnArticles":192,"formTitle":"[1721]交换链表中的节点","frequency":0.9844113355,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":19147,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.516602073949932,"acs":4932,"articleLive":2,"columnArticles":119,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9547,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5051555069231093,"acs":24006,"articleLive":2,"columnArticles":180,"formTitle":"[1723]完成所有工作的最短时间","frequency":1.4467860052,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":47522,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5574468085106383,"acs":393,"articleLive":2,"columnArticles":14,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"","submitted":705,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7890818858560794,"acs":11448,"articleLive":2,"columnArticles":156,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":14508,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4898531595446296,"acs":5938,"articleLive":2,"columnArticles":115,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":12122,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5776847528578328,"acs":3588,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.5602128972,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":6211,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3639975550122249,"acs":1191,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3272,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.624274661508704,"acs":2582,"articleLive":2,"columnArticles":25,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"","submitted":4136,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.525833878351864,"acs":804,"articleLive":2,"columnArticles":25,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"","submitted":1529,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.46239262518332286,"acs":2207,"articleLive":2,"columnArticles":33,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"","submitted":4773,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7892212697080511,"acs":13165,"articleLive":2,"columnArticles":223,"formTitle":"[1732]找到最高海拔","frequency":0.9844113355,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":16681,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.46614426361261807,"acs":2320,"articleLive":2,"columnArticles":58,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4977,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7234211605495181,"acs":28225,"articleLive":2,"columnArticles":370,"formTitle":"[1734]解码异或后的排列","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":39016,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4904545454545455,"acs":1079,"articleLive":2,"columnArticles":26,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2200,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4483641492656303,"acs":29245,"articleLive":2,"columnArticles":358,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":1.8216777638,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":65226,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.32643622200584227,"acs":4023,"articleLive":2,"columnArticles":107,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":12324,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6537494620977057,"acs":28865,"articleLive":2,"columnArticles":393,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":44153,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4757768125626462,"acs":2848,"articleLive":2,"columnArticles":62,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5986,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.6546474358974359,"acs":817,"articleLive":2,"columnArticles":26,"formTitle":"[1740]找到二叉树中的距离","frequency":0.7982980285,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"","submitted":1248,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8407292741658067,"acs":2444,"articleLive":2,"columnArticles":33,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"","submitted":2907,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7107611141283264,"acs":9161,"articleLive":2,"columnArticles":138,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":12889,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6967218137254902,"acs":22741,"articleLive":2,"columnArticles":332,"formTitle":"[1743]从相邻元素对还原数组","frequency":2.3764833974,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32640,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3626245468143904,"acs":28606,"articleLive":2,"columnArticles":369,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78886,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.48529804865009357,"acs":3631,"articleLive":2,"columnArticles":77,"formTitle":"[1745]回文串分割 IV","frequency":0.4378109156,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":7482,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.572926162260711,"acs":1257,"articleLive":2,"columnArticles":48,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":1.1152097392,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"","submitted":2194,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.6981296215745977,"acs":1605,"articleLive":2,"columnArticles":37,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"","submitted":2299,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.743949190364479,"acs":13002,"articleLive":2,"columnArticles":251,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":17477,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5368545526212062,"acs":4086,"articleLive":2,"columnArticles":95,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":7611,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4537922243467177,"acs":3560,"articleLive":2,"columnArticles":82,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7845,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.47890295358649787,"acs":2497,"articleLive":2,"columnArticles":37,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.6309637533,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":5214,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6690930946974756,"acs":10019,"articleLive":2,"columnArticles":119,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.3843222307,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":14974,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.629369957741068,"acs":6553,"articleLive":2,"columnArticles":137,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":10412,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.424420812761109,"acs":4470,"articleLive":2,"columnArticles":93,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.5602128972,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":10532,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.41919315403422985,"acs":3429,"articleLive":2,"columnArticles":58,"formTitle":"[1755]最接近目标值的子序列和","frequency":1.2296200904,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":8180,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7863247863247863,"acs":552,"articleLive":2,"columnArticles":18,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"","submitted":702,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9229166666666667,"acs":3544,"articleLive":2,"columnArticles":37,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"","submitted":3840,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6437878662129637,"acs":7757,"articleLive":2,"columnArticles":119,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":12049,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.43516560958421424,"acs":4940,"articleLive":2,"columnArticles":104,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":11352,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5467980295566502,"acs":4551,"articleLive":2,"columnArticles":80,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":8323,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4389822522381027,"acs":2795,"articleLive":2,"columnArticles":44,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.9548670892,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6367,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.7289940828402367,"acs":1232,"articleLive":2,"columnArticles":26,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"","submitted":1690,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.5886327983588754,"acs":4878,"articleLive":2,"columnArticles":91,"formTitle":"[1763]最长的美好子字符串","frequency":0.4378109156,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":8287,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.47548374976517,"acs":2531,"articleLive":2,"columnArticles":62,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.5602128972,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":5323,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5472299168975069,"acs":3951,"articleLive":2,"columnArticles":90,"formTitle":"[1765]地图中的最高点","frequency":1.0470983134,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":7220,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.3801096709870389,"acs":1525,"articleLive":2,"columnArticles":30,"formTitle":"[1766]互质树","frequency":1.3626179125,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":4012,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7935285053929122,"acs":1030,"articleLive":2,"columnArticles":25,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"","submitted":1298,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7587604290822407,"acs":12732,"articleLive":2,"columnArticles":226,"formTitle":"[1768]交替合并字符串","frequency":0.3591952806,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":16780,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8546175188267935,"acs":10781,"articleLive":2,"columnArticles":188,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":12615,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.3737992008841282,"acs":4397,"articleLive":2,"columnArticles":110,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11763,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36764928193499624,"acs":2432,"articleLive":2,"columnArticles":48,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6615,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.4955357142857143,"acs":444,"articleLive":2,"columnArticles":13,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"","submitted":896,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8432161790693108,"acs":17178,"articleLive":2,"columnArticles":215,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":20372,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5450419592395959,"acs":6365,"articleLive":2,"columnArticles":93,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":11678,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.47691660532127456,"acs":4535,"articleLive":2,"columnArticles":98,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9509,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.46219890293346055,"acs":1938,"articleLive":2,"columnArticles":47,"formTitle":"[1776]车队 II","frequency":0.8989866308,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":4193,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7864406779661017,"acs":6032,"articleLive":2,"columnArticles":65,"formTitle":"[1777]每家商店的产品价格","frequency":0.9844113355,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"","submitted":7670,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5011600928074246,"acs":216,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"","submitted":431,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6457124775867524,"acs":6122,"articleLive":2,"columnArticles":76,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.4105017363,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":9481,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6693610049153468,"acs":6128,"articleLive":2,"columnArticles":118,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":9155,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5271007639141506,"acs":4347,"articleLive":2,"columnArticles":63,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.6692532698,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":8247,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2977027660571964,"acs":1270,"articleLive":2,"columnArticles":36,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4266,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7970005356186395,"acs":1488,"articleLive":2,"columnArticles":34,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"","submitted":1867,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.4232759008502407,"acs":9409,"articleLive":2,"columnArticles":114,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":22229,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.35370879120879123,"acs":6695,"articleLive":2,"columnArticles":68,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18928,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.34312341146568764,"acs":3645,"articleLive":2,"columnArticles":94,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.4961705308,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":10623,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6527143721467467,"acs":11867,"articleLive":2,"columnArticles":61,"formTitle":"[1787]使所有区间的异或结果为零","frequency":1.2296200904,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18181,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6216814159292036,"acs":281,"articleLive":2,"columnArticles":19,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"","submitted":452,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7155797101449275,"acs":1975,"articleLive":2,"columnArticles":35,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"","submitted":2760,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6342438980046361,"acs":13954,"articleLive":2,"columnArticles":164,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":22001,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8098229583095374,"acs":11344,"articleLive":2,"columnArticles":158,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":14008,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5132196320846056,"acs":6891,"articleLive":2,"columnArticles":110,"formTitle":"[1792]最大平均通过率","frequency":1.8548769354,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":13427,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4193089430894309,"acs":4126,"articleLive":2,"columnArticles":100,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9840,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5525,"acs":221,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"","submitted":400,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7871540826785104,"acs":2304,"articleLive":2,"columnArticles":32,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.4105017363,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"","submitted":2927,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.49136055292461284,"acs":7678,"articleLive":2,"columnArticles":141,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":15626,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5687732342007435,"acs":5508,"articleLive":2,"columnArticles":85,"formTitle":"[1797]设计一个验证系统","frequency":1.0151262807,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":9684,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5269689737470167,"acs":3312,"articleLive":2,"columnArticles":52,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":1.0470983134,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":6285,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5156765676567657,"acs":2500,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":1.3626179125,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4848,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6806056701030928,"acs":10563,"articleLive":2,"columnArticles":178,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":15520,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.384016606123508,"acs":4440,"articleLive":2,"columnArticles":117,"formTitle":"[1801]积压订单中的订单总数","frequency":0.4961705308,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":11562,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.264472190692395,"acs":4427,"articleLive":2,"columnArticles":111,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":16739,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.408679593721145,"acs":2213,"articleLive":2,"columnArticles":55,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5415,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5802357207615594,"acs":640,"articleLive":2,"columnArticles":37,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"","submitted":1103,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.47635268953497584,"acs":12026,"articleLive":2,"columnArticles":165,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":25246,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6626132274475741,"acs":5340,"articleLive":2,"columnArticles":83,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":8059,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5858898674150779,"acs":6054,"articleLive":2,"columnArticles":93,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":10333,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.26896624695799387,"acs":2542,"articleLive":2,"columnArticles":48,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9451,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6248581157775256,"acs":2202,"articleLive":2,"columnArticles":36,"formTitle":"[1809]没有广告的剧集","frequency":0.4378109156,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"","submitted":3524,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.615819209039548,"acs":218,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"","submitted":354,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6567493112947659,"acs":1192,"articleLive":2,"columnArticles":33,"formTitle":"[1811]寻找面试候选人","frequency":0.4961705308,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"","submitted":1815,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7919246533531002,"acs":9081,"articleLive":2,"columnArticles":224,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.3843222307,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":11467,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5006712610758077,"acs":5594,"articleLive":2,"columnArticles":85,"formTitle":"[1813]句子相似性 III","frequency":1.0804236231,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":11173,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3511111111111111,"acs":3871,"articleLive":2,"columnArticles":89,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":11025,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.2945673389720234,"acs":1811,"articleLive":2,"columnArticles":40,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":6148,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7348056892575797,"acs":47478,"articleLive":2,"columnArticles":646,"formTitle":"[1816]截断句子","frequency":0.7916027705,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":64613,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6976439790575916,"acs":6396,"articleLive":2,"columnArticles":108,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.4663353824,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":9168,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3716855457978024,"acs":26283,"articleLive":2,"columnArticles":342,"formTitle":"[1818]绝对差值和","frequency":2.5565455058,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":70713,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3806259314456036,"acs":2554,"articleLive":2,"columnArticles":35,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.8469457526,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6710,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.4561933534743202,"acs":151,"articleLive":2,"columnArticles":10,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"","submitted":331,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9014519616929255,"acs":2918,"articleLive":2,"columnArticles":25,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"","submitted":3237,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8024830699774267,"acs":21330,"articleLive":2,"columnArticles":216,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":26580,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7233115468409586,"acs":10292,"articleLive":2,"columnArticles":132,"formTitle":"[1823]找出游戏的获胜者","frequency":1.6449038473,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":14229,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6493243789950643,"acs":8025,"articleLive":2,"columnArticles":160,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":12359,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2857142857142857,"acs":2764,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9674,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4267834793491865,"acs":341,"articleLive":2,"columnArticles":24,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"","submitted":799,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7920177066971298,"acs":11093,"articleLive":2,"columnArticles":156,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":14006,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8657047724750278,"acs":8580,"articleLive":2,"columnArticles":109,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":9911,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.691105381888495,"acs":4289,"articleLive":2,"columnArticles":88,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":6206,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4915346805024577,"acs":900,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1831,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7443070917371503,"acs":1144,"articleLive":2,"columnArticles":29,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"","submitted":1537,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8226144511858797,"acs":14914,"articleLive":2,"columnArticles":237,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":18130,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6828762387646923,"acs":44445,"articleLive":2,"columnArticles":394,"formTitle":"[1833]雪糕的最大数量","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":65085,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3557147439324281,"acs":6654,"articleLive":2,"columnArticles":138,"formTitle":"[1834]单线程 CPU","frequency":0.5602128972,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":18706,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5153256704980843,"acs":3766,"articleLive":2,"columnArticles":63,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.6309637533,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7308,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7360406091370558,"acs":580,"articleLive":2,"columnArticles":33,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.6692532698,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"","submitted":788,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.795479704797048,"acs":8623,"articleLive":2,"columnArticles":105,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.4105017363,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":10840,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42875671669445986,"acs":30082,"articleLive":2,"columnArticles":314,"formTitle":"[1838]最高频元素的频数","frequency":3.1858679643,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":70161,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5649015175976752,"acs":6998,"articleLive":2,"columnArticles":135,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":12388,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3896538890956457,"acs":2094,"articleLive":2,"columnArticles":48,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5374,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5292334343871806,"acs":1222,"articleLive":2,"columnArticles":39,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"","submitted":2309,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6431924882629108,"acs":137,"articleLive":2,"columnArticles":15,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"","submitted":213,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5153482880755608,"acs":873,"articleLive":2,"columnArticles":28,"formTitle":"[1843]可疑银行账户","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"","submitted":1694,"title":"可疑银行账户","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.7988969461750587,"acs":7822,"articleLive":2,"columnArticles":132,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":9791,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.506360655737705,"acs":7722,"articleLive":2,"columnArticles":74,"formTitle":"[1845]座位预约管理系统","frequency":0.4105017363,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":15250,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6329813636568747,"acs":28055,"articleLive":2,"columnArticles":379,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":2.1098323144,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":44322,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.36399132321041217,"acs":2517,"articleLive":2,"columnArticles":48,"formTitle":"[1847]最近的房间","frequency":0.7982980285,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6915,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6807744619569566,"acs":8509,"articleLive":2,"columnArticles":108,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":12499,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.32827887197851385,"acs":5867,"articleLive":2,"columnArticles":114,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.6309637533,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17872,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.611405197305101,"acs":2541,"articleLive":2,"columnArticles":52,"formTitle":"[1850]邻位交换的最小次数","frequency":0.6692532698,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":4156,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40483271375464686,"acs":2178,"articleLive":2,"columnArticles":53,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.7526696758,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":5380,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.5491698595146871,"acs":430,"articleLive":2,"columnArticles":13,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"","submitted":783,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6396925858951176,"acs":1415,"articleLive":2,"columnArticles":22,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"","submitted":2212,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7726123682101239,"acs":12531,"articleLive":2,"columnArticles":134,"formTitle":"[1854]人口最多的年份","frequency":1.3158804347,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":16219,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6680761099365751,"acs":11060,"articleLive":2,"columnArticles":109,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":16555,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.3569464544138929,"acs":4933,"articleLive":2,"columnArticles":85,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.4105017363,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":13820,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4575076219512195,"acs":2401,"articleLive":2,"columnArticles":35,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":5248,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6218487394957983,"acs":444,"articleLive":2,"columnArticles":25,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"","submitted":714,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7650220771741217,"acs":7970,"articleLive":2,"columnArticles":161,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":10418,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.769109396914446,"acs":4387,"articleLive":2,"columnArticles":80,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5704,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6216032608695652,"acs":3660,"articleLive":2,"columnArticles":73,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5888,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3164340268633131,"acs":2403,"articleLive":2,"columnArticles":45,"formTitle":"[1862]向下取整数对和","frequency":0.7526696758,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7594,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.8869608638661757,"acs":14210,"articleLive":2,"columnArticles":167,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.9844113355,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":16021,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.39108995068865837,"acs":4600,"articleLive":2,"columnArticles":112,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.7526696758,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11762,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.509496284062758,"acs":5553,"articleLive":2,"columnArticles":67,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.5274230743,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10899,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.604492680464412,"acs":2395,"articleLive":2,"columnArticles":51,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":1.8436735917,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3962,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7534983853606028,"acs":700,"articleLive":2,"columnArticles":18,"formTitle":"[1867]最大数量高于平均水平的订单","frequency":1.1515773834,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"","submitted":929,"title":"最大数量高于平均水平的订单","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5150339476236664,"acs":531,"articleLive":2,"columnArticles":22,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"","submitted":1031,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7723152822395595,"acs":13463,"articleLive":2,"columnArticles":160,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.3591952806,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":17432,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.44925551942495295,"acs":7875,"articleLive":2,"columnArticles":76,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.4105017363,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":17529,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27582327231814446,"acs":6374,"articleLive":2,"columnArticles":132,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":23109,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6159580342352291,"acs":2231,"articleLive":2,"columnArticles":32,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3622,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8192697146363915,"acs":2670,"articleLive":2,"columnArticles":37,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"","submitted":3259,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.840867992766727,"acs":465,"articleLive":2,"columnArticles":24,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"","submitted":553,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7261072261072261,"acs":623,"articleLive":2,"columnArticles":24,"formTitle":"[1875]将工资相同的雇员分组","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"","submitted":858,"title":"将工资相同的雇员分组","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7248453911848435,"acs":7384,"articleLive":2,"columnArticles":121,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":10187,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8182211037392918,"acs":32188,"articleLive":2,"columnArticles":412,"formTitle":"[1877]数组中最大数对和的最小值","frequency":2.8154195098,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":39339,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.4342105263157895,"acs":2277,"articleLive":2,"columnArticles":58,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":5244,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.4179784589892295,"acs":2018,"articleLive":2,"columnArticles":40,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4828,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7700489457831325,"acs":8181,"articleLive":2,"columnArticles":115,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":10624,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3568980764978996,"acs":6457,"articleLive":2,"columnArticles":68,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":18092,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2824024538126828,"acs":3959,"articleLive":2,"columnArticles":119,"formTitle":"[1882]使用服务器处理任务","frequency":0.4663353824,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":14019,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.3817427385892116,"acs":1840,"articleLive":2,"columnArticles":31,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.8989866308,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4820,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6947108796930666,"acs":2535,"articleLive":2,"columnArticles":47,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":2.0784114172,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":3649,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5090152565880721,"acs":367,"articleLive":2,"columnArticles":18,"formTitle":"[1885]统计数对","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"","submitted":721,"title":"统计数对","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5721815519765739,"acs":5862,"articleLive":2,"columnArticles":89,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.3591952806,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":10245,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6473913555529384,"acs":5497,"articleLive":2,"columnArticles":73,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.4378109156,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":8491,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.324022963126518,"acs":2935,"articleLive":2,"columnArticles":69,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":9058,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2731689973927471,"acs":2305,"articleLive":2,"columnArticles":44,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.7526696758,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":8438,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7332977017637627,"acs":1372,"articleLive":2,"columnArticles":23,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"","submitted":1871,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.39194139194139194,"acs":2247,"articleLive":2,"columnArticles":25,"formTitle":"[1891]割绳子","frequency":0.4663353824,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"","submitted":5733,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3604108309990663,"acs":772,"articleLive":2,"columnArticles":19,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"","submitted":2142,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5908785073921187,"acs":32493,"articleLive":2,"columnArticles":427,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":2.1098323144,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":54991,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.4575485331663375,"acs":37993,"articleLive":2,"columnArticles":523,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":1.9948205886,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":83036,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5387065164135227,"acs":2199,"articleLive":2,"columnArticles":42,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":4082,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5077010838562465,"acs":890,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1753,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5372591503520854,"acs":6943,"articleLive":2,"columnArticles":92,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.4105017363,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":12923,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3141488577745026,"acs":4263,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.6692532698,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13570,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6340836012861736,"acs":3944,"articleLive":2,"columnArticles":45,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":6220,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.4424023629799803,"acs":1348,"articleLive":2,"columnArticles":37,"formTitle":"[1900]最佳运动员的比拼回合","frequency":1.0151262807,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":3047,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6111521418020679,"acs":1655,"articleLive":2,"columnArticles":49,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":2708,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4548611111111111,"acs":131,"articleLive":2,"columnArticles":5,"formTitle":"[1902]给定二叉搜索树的插入顺序求深度","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"","submitted":288,"title":"给定二叉搜索树的插入顺序求深度","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6371020378562623,"acs":8785,"articleLive":2,"columnArticles":113,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":13789,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.28803905614320585,"acs":3894,"articleLive":2,"columnArticles":76,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":13519,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5977086438152012,"acs":6417,"articleLive":2,"columnArticles":139,"formTitle":"[1905]统计子岛屿","frequency":1.3158804347,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":10736,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4235648588645734,"acs":2671,"articleLive":2,"columnArticles":57,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.6692532698,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":6306,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5930807248764415,"acs":720,"articleLive":2,"columnArticles":26,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"","submitted":1214,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6178861788617886,"acs":228,"articleLive":2,"columnArticles":11,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"","submitted":369,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.31927531927531927,"acs":5375,"articleLive":2,"columnArticles":81,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.4105017363,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"ac","submitted":16835,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6723237597911227,"acs":4120,"articleLive":2,"columnArticles":70,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.4378109156,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":6128,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5663912658601358,"acs":3839,"articleLive":2,"columnArticles":79,"formTitle":"[1911]最大子序列交替和","frequency":1.3467470827,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":6778,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.25082977714556665,"acs":2116,"articleLive":2,"columnArticles":50,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":8436,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8320719811638077,"acs":9895,"articleLive":2,"columnArticles":117,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.9548670892,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":11892,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.44534837947775885,"acs":3394,"articleLive":2,"columnArticles":74,"formTitle":"[1914]循环轮转矩阵","frequency":1.3158804347,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7621,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3961258450338013,"acs":3047,"articleLive":2,"columnArticles":61,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7692,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.549804262722923,"acs":1264,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2299,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.37209302325581395,"acs":656,"articleLive":2,"columnArticles":12,"formTitle":"[1917]Leetcodify 好友推荐","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"","submitted":1763,"title":"Leetcodify 好友推荐","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.5055555555555555,"acs":273,"articleLive":2,"columnArticles":6,"formTitle":"[1918]第 K 小的子数组和·","frequency":1.1515773834,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"","submitted":540,"title":"第 K 小的子数组和·","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3989769820971867,"acs":624,"articleLive":2,"columnArticles":21,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"","submitted":1564,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.8932642487046633,"acs":14654,"articleLive":2,"columnArticles":128,"formTitle":"[1920]基于排列构建数组","frequency":2.1098323144,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":16405,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.3487176456683607,"acs":5901,"articleLive":2,"columnArticles":96,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.4663353824,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16922,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3629450902975799,"acs":4964,"articleLive":2,"columnArticles":81,"formTitle":"[1922]统计好数字的数目","frequency":0.4961705308,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":13677,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.24170337738619677,"acs":1646,"articleLive":2,"columnArticles":34,"formTitle":"[1923]最长公共子路径","frequency":1.3626179125,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6810,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.3568075117370892,"acs":76,"articleLive":2,"columnArticles":6,"formTitle":"[1924]安装栅栏 II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"","submitted":213,"title":"安装栅栏 II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6915274463007159,"acs":5795,"articleLive":2,"columnArticles":74,"formTitle":"[1925]统计平方和三元组的数目","frequency":1.8216777638,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":8380,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3475315437378271,"acs":4104,"articleLive":2,"columnArticles":69,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":11809,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4146341463414634,"acs":1989,"articleLive":2,"columnArticles":38,"formTitle":"[1927]求和游戏","frequency":0.4663353824,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4797,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.41050341827221876,"acs":2642,"articleLive":2,"columnArticles":46,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":2.2598828013,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":6436,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.8918067226890757,"acs":16980,"articleLive":2,"columnArticles":146,"formTitle":"[1929]数组串联","frequency":1.3158804347,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":19040,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.48491898628998753,"acs":5836,"articleLive":2,"columnArticles":106,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":1.0804236231,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":12035,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5656591974986972,"acs":2171,"articleLive":2,"columnArticles":66,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.6692532698,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3838,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3320775026910657,"acs":1234,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":1.7387372855,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3716,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5048975957257347,"acs":567,"articleLive":2,"columnArticles":28,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.9548670892,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"","submitted":1123,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7674418604651163,"acs":462,"articleLive":2,"columnArticles":17,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"","submitted":602,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7338916912534501,"acs":7711,"articleLive":2,"columnArticles":111,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":10507,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.4513340849304773,"acs":6005,"articleLive":2,"columnArticles":69,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":13305,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.2501452221899506,"acs":3445,"articleLive":2,"columnArticles":65,"formTitle":"[1937]扣分后的最大得分","frequency":1.3787942601,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":13772,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.35522904062229904,"acs":1233,"articleLive":2,"columnArticles":43,"formTitle":"[1938]查询最大基因差","frequency":1.6449038473,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3471,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6360485268630849,"acs":734,"articleLive":2,"columnArticles":17,"formTitle":"[1939]主动请求确认消息的用户","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"","submitted":1154,"title":"主动请求确认消息的用户","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7535545023696683,"acs":477,"articleLive":2,"columnArticles":29,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"","submitted":633,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7637397346809854,"acs":6045,"articleLive":2,"columnArticles":104,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.9844113355,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":7915,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.399825021872266,"acs":3199,"articleLive":2,"columnArticles":74,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":8001,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4113886113886114,"acs":2059,"articleLive":2,"columnArticles":57,"formTitle":"[1943]描述绘画结果","frequency":0.6309637533,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":5005,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5837181044957472,"acs":2402,"articleLive":2,"columnArticles":67,"formTitle":"[1944]队列中可以看到的人数","frequency":0.9844113355,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":4115,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.65893563466379,"acs":7330,"articleLive":2,"columnArticles":91,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.4378109156,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":11124,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30713860475185367,"acs":5675,"articleLive":2,"columnArticles":84,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":1.0151262807,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":18477,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5457425240750127,"acs":4307,"articleLive":2,"columnArticles":94,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7892,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5134211810639336,"acs":1052,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.9548670892,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":2049,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5357590966122961,"acs":427,"articleLive":2,"columnArticles":16,"formTitle":"[1949]坚定的友谊","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"","submitted":797,"title":"坚定的友谊","titleSlug":"strong-friendship"},{"acceptance":0.4935400516795866,"acs":191,"articleLive":2,"columnArticles":8,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"","submitted":387,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.699594046008119,"acs":517,"articleLive":2,"columnArticles":18,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"","submitted":739,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5433214260699026,"acs":7757,"articleLive":2,"columnArticles":87,"formTitle":"[1952]三除数","frequency":0.4105017363,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":14277,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.33369731382397905,"acs":4584,"articleLive":2,"columnArticles":88,"formTitle":"[1953]你可以工作的最大周数","frequency":0.5274230743,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13737,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.47980561555075596,"acs":4443,"articleLive":2,"columnArticles":73,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.4663353824,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":9260,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4982768002902231,"acs":2747,"articleLive":2,"columnArticles":44,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.7526696758,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5513,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4046511627906977,"acs":174,"articleLive":2,"columnArticles":13,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":2.4541018615,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"","submitted":430,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6093385214007782,"acs":5481,"articleLive":2,"columnArticles":64,"formTitle":"[1957]删除字符使字符串变好","frequency":0.3843222307,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":8995,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.42641630556892957,"acs":2657,"articleLive":2,"columnArticles":48,"formTitle":"[1958]检查操作是否合法","frequency":0.5946753013,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":6231,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.424553101997897,"acs":1615,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3804,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.28519564340459863,"acs":707,"articleLive":2,"columnArticles":20,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":1.5805729889,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2479,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5352949302389833,"acs":7750,"articleLive":2,"columnArticles":76,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.4378109156,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":14478,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4389074531454308,"acs":6042,"articleLive":2,"columnArticles":82,"formTitle":"[1962]移除石子使总数最小","frequency":1.4121084668,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":13766,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6212771491741449,"acs":4777,"articleLive":2,"columnArticles":62,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.4663353824,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7689,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3910549116028568,"acs":3340,"articleLive":2,"columnArticles":50,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8541,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.762962962962963,"acs":721,"articleLive":2,"columnArticles":17,"formTitle":"[1965]丢失信息的雇员","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"","submitted":945,"title":"丢失信息的雇员","titleSlug":"employees-with-missing-information"},{"acceptance":0.5867768595041323,"acs":71,"articleLive":2,"columnArticles":8,"formTitle":"[1966]未排序数组中的可被二分搜索的数","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"","submitted":121,"title":"未排序数组中的可被二分搜索的数","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.783289241622575,"acs":7106,"articleLive":2,"columnArticles":87,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":9072,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.36417293787811716,"acs":4936,"articleLive":2,"columnArticles":72,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":13554,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.28373219107924386,"acs":3047,"articleLive":2,"columnArticles":44,"formTitle":"[1969]数组元素的最小非零乘积","frequency":2.0014230159,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10739,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4780507450664519,"acs":2374,"articleLive":2,"columnArticles":53,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":1.6905738841,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4966,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.48852701702442636,"acs":1320,"articleLive":2,"columnArticles":32,"formTitle":"[1971]寻找图中是否存在路径","frequency":0.4105017363,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":2702,"title":"寻找图中是否存在路径","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.45081967213114754,"acs":330,"articleLive":2,"columnArticles":13,"formTitle":"[1972]同一天的第一个电话和最后一个电话","frequency":0.5602128972,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"","submitted":732,"title":"同一天的第一个电话和最后一个电话","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5317073170731708,"acs":109,"articleLive":2,"columnArticles":11,"formTitle":"[1973]值等于子节点值之和的节点数量","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"","submitted":205,"title":"值等于子节点值之和的节点数量","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7332610043397396,"acs":4731,"articleLive":2,"columnArticles":69,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.9548670892,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":6452,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.38909997625267156,"acs":3277,"articleLive":2,"columnArticles":48,"formTitle":"[1975]最大方阵和","frequency":1.4467860052,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":8422,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.3042832384253528,"acs":2458,"articleLive":2,"columnArticles":55,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":8078,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.25795795795795795,"acs":859,"articleLive":2,"columnArticles":17,"formTitle":"[1977]划分数字的方案数","frequency":1.3626179125,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":3330,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5426774483378257,"acs":604,"articleLive":2,"columnArticles":15,"formTitle":"[1978]上级经理已离职的公司员工","frequency":0.4378109156,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"","submitted":1113,"title":"上级经理已离职的公司员工","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.7916212819438626,"acs":9448,"articleLive":2,"columnArticles":120,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":11935,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5855704697986577,"acs":6282,"articleLive":2,"columnArticles":112,"formTitle":"[1980]找出不同的二进制字符串","frequency":1.0470983134,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":10728,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.30519317611640745,"acs":4866,"articleLive":2,"columnArticles":88,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":1.7896647868,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15944,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.46765913757700206,"acs":911,"articleLive":2,"columnArticles":19,"formTitle":"[1982]从子集的和还原数组","frequency":1.3158804347,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1948,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.5398773006134969,"acs":88,"articleLive":2,"columnArticles":4,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"","submitted":163,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5764532617170579,"acs":6654,"articleLive":2,"columnArticles":74,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":11543,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.41506918877745336,"acs":6539,"articleLive":2,"columnArticles":94,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":15754,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2867437214611872,"acs":4019,"articleLive":2,"columnArticles":80,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.4663353824,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":14016,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.47402200488997553,"acs":1551,"articleLive":2,"columnArticles":27,"formTitle":"[1987]不同的好子序列数目","frequency":0.8989866308,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3272,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6730769230769231,"acs":420,"articleLive":2,"columnArticles":10,"formTitle":"[1988]找出每所学校的最低分数要求","frequency":1.1515773834,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"","submitted":624,"title":"找出每所学校的最低分数要求","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.521505376344086,"acs":97,"articleLive":2,"columnArticles":3,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"","submitted":186,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.5501653803748622,"acs":499,"articleLive":2,"columnArticles":12,"formTitle":"[1990]统计实验的数量","frequency":0.4378109156,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"","submitted":907,"title":"统计实验的数量","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6561451342281879,"acs":6257,"articleLive":2,"columnArticles":86,"formTitle":"[1991]找到数组的中间位置","frequency":0.3843222307,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":9536,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5907240219507878,"acs":3337,"articleLive":2,"columnArticles":69,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":5649,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.3852599504856218,"acs":2023,"articleLive":2,"columnArticles":46,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":5251,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.3733075435203095,"acs":1351,"articleLive":2,"columnArticles":38,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3619,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.6629206532497526,"acs":32149,"articleLive":2,"columnArticles":227,"formTitle":"[1995]统计特殊四元组","frequency":1.0635853738,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":48496,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.256093567251462,"acs":5474,"articleLive":2,"columnArticles":102,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":21375,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.3413208649912332,"acs":2336,"articleLive":2,"columnArticles":38,"formTitle":"[1997]访问完所有房间的第一天","frequency":1.2716254257,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6844,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.42304939155332855,"acs":1773,"articleLive":2,"columnArticles":34,"formTitle":"[1998]数组的最大公因数排序","frequency":0.7097446311,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":4191,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.46733668341708545,"acs":93,"articleLive":2,"columnArticles":9,"formTitle":"[1999]最小的仅由两个数组成的倍数","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"","submitted":199,"title":"最小的仅由两个数组成的倍数","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7696446794693386,"acs":8296,"articleLive":2,"columnArticles":123,"formTitle":"[2000]反转单词前缀","frequency":0.3843222307,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":10779,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.36332446021887016,"acs":6142,"articleLive":2,"columnArticles":133,"formTitle":"[2001]可互换矩形的组数","frequency":0.4961705308,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":16905,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5819284235433304,"acs":3935,"articleLive":2,"columnArticles":90,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6762,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.39571567672833496,"acs":2032,"articleLive":2,"columnArticles":43,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":5135,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.428842504743833,"acs":226,"articleLive":2,"columnArticles":9,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"","submitted":527,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.43902439024390244,"acs":36,"articleLive":2,"columnArticles":3,"formTitle":"[2005]斐波那契树的移除子树游戏","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"","submitted":82,"title":"斐波那契树的移除子树游戏","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8464776873421275,"acs":6032,"articleLive":2,"columnArticles":82,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":7126,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.3224406659582005,"acs":3641,"articleLive":2,"columnArticles":72,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.4105017363,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":11292,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.42681955725433984,"acs":2680,"articleLive":2,"columnArticles":47,"formTitle":"[2008]出租车的最大盈利","frequency":1.6121462508,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":6279,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.41354723707664887,"acs":1624,"articleLive":2,"columnArticles":44,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3927,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6360655737704918,"acs":194,"articleLive":2,"columnArticles":9,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"","submitted":305,"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.8763411024787273,"acs":9475,"articleLive":2,"columnArticles":97,"formTitle":"[2011]执行操作后的变量值","frequency":1.3467470827,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":10812,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.36537530266343826,"acs":4527,"articleLive":2,"columnArticles":81,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":12390,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.344686497843636,"acs":3117,"articleLive":2,"columnArticles":57,"formTitle":"[2013]检测正方形","frequency":0.4378109156,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":9043,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5319219318557724,"acs":1608,"articleLive":2,"columnArticles":26,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":3023,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.5369127516778524,"acs":80,"articleLive":2,"columnArticles":5,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"","submitted":149,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5569887034226944,"acs":6607,"articleLive":2,"columnArticles":88,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.4105017363,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":11862,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.3574380165289256,"acs":3979,"articleLive":2,"columnArticles":100,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":11132,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.4107006854531607,"acs":2157,"articleLive":2,"columnArticles":53,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.5274230743,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":5252,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.35909221488078136,"acs":1250,"articleLive":2,"columnArticles":36,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.4961705308,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":3481,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.7608695652173914,"acs":315,"articleLive":2,"columnArticles":9,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"","submitted":414,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.5910931174089069,"acs":146,"articleLive":2,"columnArticles":10,"formTitle":"[2021]街上最亮的位置","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":247,"title":"街上最亮的位置","titleSlug":"brightest-position-on-street"},{"acceptance":0.6741843610345706,"acs":29116,"articleLive":2,"columnArticles":371,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.1263639015,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":43187,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7507692307692307,"acs":3416,"articleLive":2,"columnArticles":57,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":4550,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.4924786324786325,"acs":2881,"articleLive":2,"columnArticles":72,"formTitle":"[2024]考试的最大困扰度","frequency":0.4378109156,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":5850,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.26543674698795183,"acs":1410,"articleLive":2,"columnArticles":46,"formTitle":"[2025]分割数组的最多方案数","frequency":0.6309637533,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":5312,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.85809906291834,"acs":641,"articleLive":2,"columnArticles":15,"formTitle":"[2026]低质量的问题","frequency":1.3467470827,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":747,"title":"低质量的问题","titleSlug":"low-quality-problems"},{"acceptance":0.5636226739808541,"acs":5240,"articleLive":2,"columnArticles":63,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":9297,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.4277677315651999,"acs":4258,"articleLive":2,"columnArticles":64,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":9954,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.23810492069947134,"acs":2342,"articleLive":2,"columnArticles":68,"formTitle":"[2029]石子游戏 IX","frequency":0.5602128972,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":9836,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.35204616998950683,"acs":1342,"articleLive":2,"columnArticles":42,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.6692532698,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3812,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.5346534653465347,"acs":108,"articleLive":2,"columnArticles":5,"formTitle":"[2031]1 比 0 多的子数组个数","frequency":2.0283208182,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":202,"title":"1 比 0 多的子数组个数","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6628200155159037,"acs":6835,"articleLive":2,"columnArticles":117,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":10312,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.3978798586572438,"acs":4504,"articleLive":2,"columnArticles":93,"formTitle":"[2033]获取单值网格的最小操作数","frequency":0.9844113355,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":11320,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.30661655449698455,"acs":3508,"articleLive":2,"columnArticles":72,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"ac","submitted":11441,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.320132533922373,"acs":2029,"articleLive":2,"columnArticles":47,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.5602128972,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":6338,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.4517766497461929,"acs":89,"articleLive":2,"columnArticles":9,"formTitle":"[2036]最大交替子数组和","frequency":0.0,"frontendQuestionId":"2036","leaf":true,"level":2,"nodeType":"def","questionId":"512","status":"","submitted":197,"title":"最大交替子数组和","titleSlug":"maximum-alternating-subarray-sum"},{"acceptance":0.8295945667832887,"acs":4031,"articleLive":2,"columnArticles":58,"formTitle":"[2037]使每位学生都有座位的最少移动次数","frequency":0.0,"frontendQuestionId":"2037","leaf":true,"level":1,"nodeType":"def","questionId":"2148","status":"ac","submitted":4859,"title":"使每位学生都有座位的最少移动次数","titleSlug":"minimum-number-of-moves-to-seat-everyone"},{"acceptance":0.5081307357913379,"acs":3156,"articleLive":2,"columnArticles":66,"formTitle":"[2038]如果相邻两个颜色均相同则删除当前颜色","frequency":0.0,"frontendQuestionId":"2038","leaf":true,"level":2,"nodeType":"def","questionId":"2149","status":"ac","submitted":6211,"title":"如果相邻两个颜色均相同则删除当前颜色","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color"},{"acceptance":0.36291366241449435,"acs":1963,"articleLive":2,"columnArticles":45,"formTitle":"[2039]网络空闲的时刻","frequency":0.5602128972,"frontendQuestionId":"2039","leaf":true,"level":2,"nodeType":"def","questionId":"2151","status":"ac","submitted":5409,"title":"网络空闲的时刻","titleSlug":"the-time-when-the-network-becomes-idle"},{"acceptance":0.32213656387665196,"acs":1170,"articleLive":2,"columnArticles":21,"formTitle":"[2040]两个有序数组的第 K 小乘积","frequency":0.0,"frontendQuestionId":"2040","leaf":true,"level":3,"nodeType":"def","questionId":"2150","status":"","submitted":3632,"title":"两个有序数组的第 K 小乘积","titleSlug":"kth-smallest-product-of-two-sorted-arrays"},{"acceptance":0.6596638655462185,"acs":314,"articleLive":2,"columnArticles":14,"formTitle":"[2041]面试中被录取的候选人","frequency":0.0,"frontendQuestionId":"2041","leaf":true,"level":2,"nodeType":"def","questionId":"2185","status":"","submitted":476,"title":"面试中被录取的候选人","titleSlug":"accepted-candidates-from-the-interviews"},{"acceptance":0.6679550245959242,"acs":7604,"articleLive":2,"columnArticles":124,"formTitle":"[2042]检查句子中的数字是否递增","frequency":1.3158804347,"frontendQuestionId":"2042","leaf":true,"level":1,"nodeType":"def","questionId":"2168","status":"ac","submitted":11384,"title":"检查句子中的数字是否递增","titleSlug":"check-if-numbers-are-ascending-in-a-sentence"},{"acceptance":0.5932203389830508,"acs":6195,"articleLive":2,"columnArticles":74,"formTitle":"[2043]简易银行系统","frequency":0.4663353824,"frontendQuestionId":"2043","leaf":true,"level":2,"nodeType":"def","questionId":"2169","status":"ac","submitted":10443,"title":"简易银行系统","titleSlug":"simple-bank-system"},{"acceptance":0.7413817972017885,"acs":5140,"articleLive":2,"columnArticles":98,"formTitle":"[2044]统计按位或能得到最大值的子集数目","frequency":0.4105017363,"frontendQuestionId":"2044","leaf":true,"level":2,"nodeType":"def","questionId":"2170","status":"ac","submitted":6933,"title":"统计按位或能得到最大值的子集数目","titleSlug":"count-number-of-maximum-bitwise-or-subsets"},{"acceptance":0.33371201363249076,"acs":2350,"articleLive":2,"columnArticles":61,"formTitle":"[2045]到达目的地的第二短时间","frequency":0.5946753013,"frontendQuestionId":"2045","leaf":true,"level":3,"nodeType":"def","questionId":"2171","status":"ac","submitted":7042,"title":"到达目的地的第二短时间","titleSlug":"second-minimum-time-to-reach-destination"},{"acceptance":0.6510067114093959,"acs":194,"articleLive":2,"columnArticles":18,"formTitle":"[2046]给按照绝对值排序的链表排序","frequency":0.0,"frontendQuestionId":"2046","leaf":true,"level":2,"nodeType":"def","questionId":"1992","status":"","submitted":298,"title":"给按照绝对值排序的链表排序","titleSlug":"sort-linked-list-already-sorted-using-absolute-values"},{"acceptance":0.28788745281939837,"acs":5034,"articleLive":2,"columnArticles":108,"formTitle":"[2047]句子中的有效单词数","frequency":0.4105017363,"frontendQuestionId":"2047","leaf":true,"level":1,"nodeType":"def","questionId":"2173","status":"ac","submitted":17486,"title":"句子中的有效单词数","titleSlug":"number-of-valid-words-in-a-sentence"},{"acceptance":0.4153377348908075,"acs":4089,"articleLive":2,"columnArticles":94,"formTitle":"[2048]下一个更大的数值平衡数","frequency":0.0,"frontendQuestionId":"2048","leaf":true,"level":2,"nodeType":"def","questionId":"2174","status":"ac","submitted":9845,"title":"下一个更大的数值平衡数","titleSlug":"next-greater-numerically-balanced-number"},{"acceptance":0.3967294214648894,"acs":2887,"articleLive":2,"columnArticles":97,"formTitle":"[2049]统计最高分的节点数目","frequency":0.0,"frontendQuestionId":"2049","leaf":true,"level":2,"nodeType":"def","questionId":"2175","status":"","submitted":7277,"title":"统计最高分的节点数目","titleSlug":"count-nodes-with-the-highest-score"},{"acceptance":0.5609820485744457,"acs":2125,"articleLive":2,"columnArticles":72,"formTitle":"[2050]并行课程 III","frequency":0.4378109156,"frontendQuestionId":"2050","leaf":true,"level":3,"nodeType":"def","questionId":"2176","status":"","submitted":3788,"title":"并行课程 III","titleSlug":"parallel-courses-iii"},{"acceptance":0.6735905044510386,"acs":227,"articleLive":2,"columnArticles":8,"formTitle":"[2051]The Category of Each Member in the Store","frequency":0.0,"frontendQuestionId":"2051","leaf":true,"level":2,"nodeType":"def","questionId":"2194","status":"","submitted":337,"title":"The Category of Each Member in the Store","titleSlug":"the-category-of-each-member-in-the-store"},{"acceptance":0.4140625,"acs":53,"articleLive":2,"columnArticles":8,"formTitle":"[2052]将句子分隔成行的最低成本","frequency":0.0,"frontendQuestionId":"2052","leaf":true,"level":2,"nodeType":"def","questionId":"2082","status":"","submitted":128,"title":"将句子分隔成行的最低成本","titleSlug":"minimum-cost-to-separate-sentence-into-rows"},{"acceptance":0.7481164383561644,"acs":4369,"articleLive":2,"columnArticles":68,"formTitle":"[2053]数组中第 K 个独一无二的字符串","frequency":0.0,"frontendQuestionId":"2053","leaf":true,"level":1,"nodeType":"def","questionId":"2163","status":"","submitted":5840,"title":"数组中第 K 个独一无二的字符串","titleSlug":"kth-distinct-string-in-an-array"},{"acceptance":0.3340572304547777,"acs":2615,"articleLive":2,"columnArticles":61,"formTitle":"[2054]两个最好的不重叠活动","frequency":0.0,"frontendQuestionId":"2054","leaf":true,"level":2,"nodeType":"def","questionId":"2164","status":"","submitted":7828,"title":"两个最好的不重叠活动","titleSlug":"two-best-non-overlapping-events"},{"acceptance":0.3827117462530498,"acs":2196,"articleLive":2,"columnArticles":71,"formTitle":"[2055]蜡烛之间的盘子","frequency":0.9548670892,"frontendQuestionId":"2055","leaf":true,"level":2,"nodeType":"def","questionId":"2165","status":"","submitted":5738,"title":"蜡烛之间的盘子","titleSlug":"plates-between-candles"},{"acceptance":0.611214953271028,"acs":654,"articleLive":2,"columnArticles":14,"formTitle":"[2056]棋盘上有效移动组合的数目","frequency":0.0,"frontendQuestionId":"2056","leaf":true,"level":3,"nodeType":"def","questionId":"2166","status":"","submitted":1070,"title":"棋盘上有效移动组合的数目","titleSlug":"number-of-valid-move-combinations-on-chessboard"},{"acceptance":0.7742950502238897,"acs":6398,"articleLive":2,"columnArticles":45,"formTitle":"[2057]值相等的最小索引","frequency":0.0,"frontendQuestionId":"2057","leaf":true,"level":1,"nodeType":"def","questionId":"2181","status":"","submitted":8263,"title":"值相等的最小索引","titleSlug":"smallest-index-with-equal-value"},{"acceptance":0.5720833788060679,"acs":5242,"articleLive":2,"columnArticles":78,"formTitle":"[2058]找出临界点之间的最小和最大距离","frequency":0.0,"frontendQuestionId":"2058","leaf":true,"level":2,"nodeType":"def","questionId":"2182","status":"","submitted":9163,"title":"找出临界点之间的最小和最大距离","titleSlug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points"},{"acceptance":0.42715161767815607,"acs":4040,"articleLive":2,"columnArticles":93,"formTitle":"[2059]转化数字的最小运算数","frequency":0.0,"frontendQuestionId":"2059","leaf":true,"level":2,"nodeType":"def","questionId":"2183","status":"","submitted":9458,"title":"转化数字的最小运算数","titleSlug":"minimum-operations-to-convert-number"},{"acceptance":0.3655446977922548,"acs":1010,"articleLive":2,"columnArticles":21,"formTitle":"[2060]同源字符串检测","frequency":0.0,"frontendQuestionId":"2060","leaf":true,"level":3,"nodeType":"def","questionId":"2184","status":"","submitted":2763,"title":"同源字符串检测","titleSlug":"check-if-an-original-string-exists-given-two-encoded-strings"},{"acceptance":0.4370860927152318,"acs":66,"articleLive":2,"columnArticles":6,"formTitle":"[2061]扫地机器人清扫过的空间个数","frequency":0.0,"frontendQuestionId":"2061","leaf":true,"level":2,"nodeType":"def","questionId":"2203","status":"","submitted":151,"title":"扫地机器人清扫过的空间个数","titleSlug":"number-of-spaces-cleaning-robot-cleaned"},{"acceptance":0.6080045740423099,"acs":5317,"articleLive":2,"columnArticles":95,"formTitle":"[2062]统计字符串中的元音子字符串","frequency":0.4105017363,"frontendQuestionId":"2062","leaf":true,"level":1,"nodeType":"def","questionId":"2186","status":"ac","submitted":8745,"title":"统计字符串中的元音子字符串","titleSlug":"count-vowel-substrings-of-a-string"},{"acceptance":0.4864058735803602,"acs":4240,"articleLive":2,"columnArticles":101,"formTitle":"[2063]所有子字符串中的元音","frequency":0.4105017363,"frontendQuestionId":"2063","leaf":true,"level":2,"nodeType":"def","questionId":"2187","status":"ac","submitted":8717,"title":"所有子字符串中的元音","titleSlug":"vowels-of-all-substrings"},{"acceptance":0.417077570655442,"acs":3468,"articleLive":2,"columnArticles":72,"formTitle":"[2064]分配给商店的最多商品的最小值","frequency":0.0,"frontendQuestionId":"2064","leaf":true,"level":2,"nodeType":"def","questionId":"2188","status":"notac","submitted":8315,"title":"分配给商店的最多商品的最小值","titleSlug":"minimized-maximum-of-products-distributed-to-any-store"},{"acceptance":0.5346744309158284,"acs":2020,"articleLive":2,"columnArticles":57,"formTitle":"[2065]最大化一张图中的路径价值","frequency":0.0,"frontendQuestionId":"2065","leaf":true,"level":3,"nodeType":"def","questionId":"2189","status":"ac","submitted":3778,"title":"最大化一张图中的路径价值","titleSlug":"maximum-path-quality-of-a-graph"},{"acceptance":0.8327402135231317,"acs":234,"articleLive":2,"columnArticles":10,"formTitle":"[2066]账户余额","frequency":0.0,"frontendQuestionId":"2066","leaf":true,"level":2,"nodeType":"def","questionId":"2208","status":"","submitted":281,"title":"账户余额","titleSlug":"account-balance"},{"acceptance":0.4661016949152542,"acs":55,"articleLive":2,"columnArticles":5,"formTitle":"[2067]Number of Equal Count Substrings","frequency":0.0,"frontendQuestionId":"2067","leaf":true,"level":2,"nodeType":"def","questionId":"2209","status":"","submitted":118,"title":"Number of Equal Count Substrings","titleSlug":"number-of-equal-count-substrings"},{"acceptance":0.7387002909796314,"acs":3808,"articleLive":2,"columnArticles":68,"formTitle":"[2068]检查两个字符串是否几乎相等","frequency":0.0,"frontendQuestionId":"2068","leaf":true,"level":1,"nodeType":"def","questionId":"2177","status":"ac","submitted":5155,"title":"检查两个字符串是否几乎相等","titleSlug":"check-whether-two-strings-are-almost-equivalent"},{"acceptance":0.1915924363181747,"acs":2452,"articleLive":2,"columnArticles":76,"formTitle":"[2069]模拟行走机器人 II","frequency":0.0,"frontendQuestionId":"2069","leaf":true,"level":2,"nodeType":"def","questionId":"2178","status":"notac","submitted":12798,"title":"模拟行走机器人 II","titleSlug":"walking-robot-simulation-ii"},{"acceptance":0.42607284529390554,"acs":2363,"articleLive":2,"columnArticles":79,"formTitle":"[2070]每一个查询的最大美丽值","frequency":0.0,"frontendQuestionId":"2070","leaf":true,"level":2,"nodeType":"def","questionId":"2179","status":"","submitted":5546,"title":"每一个查询的最大美丽值","titleSlug":"most-beautiful-item-for-each-query"},{"acceptance":0.3649033892936332,"acs":1152,"articleLive":2,"columnArticles":28,"formTitle":"[2071]你可以安排的最多任务数目","frequency":0.4105017363,"frontendQuestionId":"2071","leaf":true,"level":3,"nodeType":"def","questionId":"2180","status":"","submitted":3157,"title":"你可以安排的最多任务数目","titleSlug":"maximum-number-of-tasks-you-can-assign"},{"acceptance":0.6940639269406392,"acs":304,"articleLive":2,"columnArticles":6,"formTitle":"[2072]赢得比赛的大学","frequency":0.0,"frontendQuestionId":"2072","leaf":true,"level":1,"nodeType":"def","questionId":"2214","status":"","submitted":438,"title":"赢得比赛的大学","titleSlug":"the-winner-university"},{"acceptance":0.6148218527315914,"acs":6471,"articleLive":2,"columnArticles":96,"formTitle":"[2073]买票需要的时间","frequency":0.0,"frontendQuestionId":"2073","leaf":true,"level":1,"nodeType":"def","questionId":"2195","status":"","submitted":10525,"title":"买票需要的时间","titleSlug":"time-needed-to-buy-tickets"},{"acceptance":0.41735028712059064,"acs":4070,"articleLive":2,"columnArticles":117,"formTitle":"[2074]反转偶数长度组的节点","frequency":0.9548670892,"frontendQuestionId":"2074","leaf":true,"level":2,"nodeType":"def","questionId":"2196","status":"","submitted":9752,"title":"反转偶数长度组的节点","titleSlug":"reverse-nodes-in-even-length-groups"},{"acceptance":0.4598701478104711,"acs":3329,"articleLive":2,"columnArticles":65,"formTitle":"[2075]解码斜向换位密码","frequency":0.4378109156,"frontendQuestionId":"2075","leaf":true,"level":2,"nodeType":"def","questionId":"2197","status":"","submitted":7239,"title":"解码斜向换位密码","titleSlug":"decode-the-slanted-ciphertext"},{"acceptance":0.4937214611872146,"acs":2595,"articleLive":2,"columnArticles":68,"formTitle":"[2076]处理含限制条件的好友请求","frequency":0.0,"frontendQuestionId":"2076","leaf":true,"level":3,"nodeType":"def","questionId":"2198","status":"","submitted":5256,"title":"处理含限制条件的好友请求","titleSlug":"process-restricted-friend-requests"},{"acceptance":0.6625,"acs":53,"articleLive":2,"columnArticles":5,"formTitle":"[2077]Paths in Maze That Lead to Same Room","frequency":0.0,"frontendQuestionId":"2077","leaf":true,"level":2,"nodeType":"def","questionId":"2218","status":"","submitted":80,"title":"Paths in Maze That Lead to Same Room","titleSlug":"paths-in-maze-that-lead-to-same-room"},{"acceptance":0.7527768235428833,"acs":6574,"articleLive":2,"columnArticles":89,"formTitle":"[2078]两栋颜色不同且距离最远的房子","frequency":0.3591952806,"frontendQuestionId":"2078","leaf":true,"level":1,"nodeType":"def","questionId":"2199","status":"","submitted":8733,"title":"两栋颜色不同且距离最远的房子","titleSlug":"two-furthest-houses-with-different-colors"},{"acceptance":0.7720373207074224,"acs":5544,"articleLive":2,"columnArticles":103,"formTitle":"[2079]给植物浇水","frequency":0.0,"frontendQuestionId":"2079","leaf":true,"level":2,"nodeType":"def","questionId":"1310","status":"","submitted":7181,"title":"给植物浇水","titleSlug":"watering-plants"},{"acceptance":0.26890574214517876,"acs":4964,"articleLive":2,"columnArticles":134,"formTitle":"[2080]区间内查询数字的频率","frequency":0.3843222307,"frontendQuestionId":"2080","leaf":true,"level":2,"nodeType":"def","questionId":"1294","status":"","submitted":18460,"title":"区间内查询数字的频率","titleSlug":"range-frequency-queries"},{"acceptance":0.4073139974779319,"acs":2261,"articleLive":2,"columnArticles":64,"formTitle":"[2081]k 镜像数字的和","frequency":0.0,"frontendQuestionId":"2081","leaf":true,"level":3,"nodeType":"def","questionId":"2202","status":"","submitted":5551,"title":"k 镜像数字的和","titleSlug":"sum-of-k-mirror-numbers"},{"acceptance":0.7713097713097713,"acs":371,"articleLive":2,"columnArticles":10,"formTitle":"[2082]富有客户的数量","frequency":0.0,"frontendQuestionId":"2082","leaf":true,"level":1,"nodeType":"def","questionId":"2223","status":"","submitted":481,"title":"富有客户的数量","titleSlug":"the-number-of-rich-customers"},{"acceptance":0.6824324324324325,"acs":101,"articleLive":2,"columnArticles":8,"formTitle":"[2083]求以相同字母开头和结尾的子串总数","frequency":0.0,"frontendQuestionId":"2083","leaf":true,"level":2,"nodeType":"def","questionId":"2225","status":"","submitted":148,"title":"求以相同字母开头和结尾的子串总数","titleSlug":"substrings-that-begin-and-end-with-the-same-letter"},{"acceptance":0.8311688311688312,"acs":192,"articleLive":2,"columnArticles":9,"formTitle":"[2084]为订单类型为 0 的客户删除类型为 1 的订单","frequency":0.0,"frontendQuestionId":"2084","leaf":true,"level":2,"nodeType":"def","questionId":"2224","status":"","submitted":231,"title":"为订单类型为 0 的客户删除类型为 1 的订单","titleSlug":"drop-type-1-orders-for-customers-with-type-0-orders"},{"acceptance":0.7342985717080807,"acs":3753,"articleLive":2,"columnArticles":61,"formTitle":"[2085]统计出现过一次的公共字符串","frequency":0.0,"frontendQuestionId":"2085","leaf":true,"level":1,"nodeType":"def","questionId":"2190","status":"ac","submitted":5111,"title":"统计出现过一次的公共字符串","titleSlug":"count-common-words-with-one-occurrence"},{"acceptance":0.4480730537068565,"acs":2895,"articleLive":2,"columnArticles":67,"formTitle":"[2086]从房屋收集雨水需要的最少水桶数","frequency":0.0,"frontendQuestionId":"2086","leaf":true,"level":2,"nodeType":"def","questionId":"2191","status":"ac","submitted":6461,"title":"从房屋收集雨水需要的最少水桶数","titleSlug":"minimum-number-of-buckets-required-to-collect-rainwater-from-houses"},{"acceptance":0.46624771944050275,"acs":2300,"articleLive":2,"columnArticles":58,"formTitle":"[2087]网格图中机器人回家的最小代价","frequency":0.4105017363,"frontendQuestionId":"2087","leaf":true,"level":2,"nodeType":"def","questionId":"2192","status":"ac","submitted":4933,"title":"网格图中机器人回家的最小代价","titleSlug":"minimum-cost-homecoming-of-a-robot-in-a-grid"},{"acceptance":0.615,"acs":1599,"articleLive":2,"columnArticles":43,"formTitle":"[2088]统计农场中肥沃金字塔的数目","frequency":0.0,"frontendQuestionId":"2088","leaf":true,"level":3,"nodeType":"def","questionId":"2193","status":"","submitted":2600,"title":"统计农场中肥沃金字塔的数目","titleSlug":"count-fertile-pyramids-in-a-land"},{"acceptance":0.8383081710268526,"acs":7274,"articleLive":2,"columnArticles":83,"formTitle":"[2089]找出数组排序后的目标下标","frequency":0.9548670892,"frontendQuestionId":"2089","leaf":true,"level":1,"nodeType":"def","questionId":"2210","status":"","submitted":8677,"title":"找出数组排序后的目标下标","titleSlug":"find-target-indices-after-sorting-array"},{"acceptance":0.3478371825953809,"acs":5452,"articleLive":2,"columnArticles":89,"formTitle":"[2090]半径为 k 的子数组平均值","frequency":0.3591952806,"frontendQuestionId":"2090","leaf":true,"level":2,"nodeType":"def","questionId":"2211","status":"","submitted":15674,"title":"半径为 k 的子数组平均值","titleSlug":"k-radius-subarray-averages"},{"acceptance":0.5716716290940026,"acs":5376,"articleLive":2,"columnArticles":108,"formTitle":"[2091]从数组中移除最大值和最小值","frequency":0.0,"frontendQuestionId":"2091","leaf":true,"level":2,"nodeType":"def","questionId":"2212","status":"","submitted":9404,"title":"从数组中移除最大值和最小值","titleSlug":"removing-minimum-and-maximum-from-array"},{"acceptance":0.26550517960446657,"acs":3947,"articleLive":2,"columnArticles":108,"formTitle":"[2092]找出知晓秘密的所有专家","frequency":0.4105017363,"frontendQuestionId":"2092","leaf":true,"level":3,"nodeType":"def","questionId":"2213","status":"","submitted":14866,"title":"找出知晓秘密的所有专家","titleSlug":"find-all-people-with-secret"},{"acceptance":0.6515151515151515,"acs":43,"articleLive":2,"columnArticles":3,"formTitle":"[2093]Minimum Cost to Reach City With Discounts","frequency":0.0,"frontendQuestionId":"2093","leaf":true,"level":2,"nodeType":"def","questionId":"2230","status":"","submitted":66,"title":"Minimum Cost to Reach City With Discounts","titleSlug":"minimum-cost-to-reach-city-with-discounts"},{"acceptance":0.5520365971672385,"acs":6275,"articleLive":2,"columnArticles":104,"formTitle":"[2094]找出 3 位偶数","frequency":0.075284288,"frontendQuestionId":"2094","leaf":true,"level":1,"nodeType":"def","questionId":"2215","status":"","submitted":11367,"title":"找出 3 位偶数","titleSlug":"finding-3-digit-even-numbers"},{"acceptance":0.5966023321270607,"acs":5935,"articleLive":2,"columnArticles":93,"formTitle":"[2095]删除链表的中间节点","frequency":0.0,"frontendQuestionId":"2095","leaf":true,"level":2,"nodeType":"def","questionId":"2216","status":"","submitted":9948,"title":"删除链表的中间节点","titleSlug":"delete-the-middle-node-of-a-linked-list"},{"acceptance":0.4069118213323065,"acs":4227,"articleLive":2,"columnArticles":152,"formTitle":"[2096]从二叉树一个节点到另一个节点每一步的方向","frequency":0.179210257,"frontendQuestionId":"2096","leaf":true,"level":2,"nodeType":"def","questionId":"2217","status":"","submitted":10388,"title":"从二叉树一个节点到另一个节点每一步的方向","titleSlug":"step-by-step-directions-from-a-binary-tree-node-to-another"},{"acceptance":0.34,"acs":1717,"articleLive":2,"columnArticles":45,"formTitle":"[2097]合法重新排列数对","frequency":0.3350511817,"frontendQuestionId":"2097","leaf":true,"level":3,"nodeType":"def","questionId":"2201","status":"","submitted":5050,"title":"合法重新排列数对","titleSlug":"valid-arrangement-of-pairs"},{"acceptance":0.41379310344827586,"acs":36,"articleLive":2,"columnArticles":2,"formTitle":"[2098]Subsequence of Size K With the Largest Even Sum","frequency":0.9548670892,"frontendQuestionId":"2098","leaf":true,"level":2,"nodeType":"def","questionId":"2242","status":"","submitted":87,"title":"Subsequence of Size K With the Largest Even Sum","titleSlug":"subsequence-of-size-k-with-the-largest-even-sum"},{"acceptance":0.49109481403876376,"acs":3750,"articleLive":2,"columnArticles":86,"formTitle":"[2099]找到和最大的长度为 K 的子序列","frequency":0.2546909129,"frontendQuestionId":"2099","leaf":true,"level":1,"nodeType":"def","questionId":"2204","status":"ac","submitted":7636,"title":"找到和最大的长度为 K 的子序列","titleSlug":"find-subsequence-of-length-k-with-the-largest-sum"},{"acceptance":0.3561082262913364,"acs":2606,"articleLive":2,"columnArticles":56,"formTitle":"[2100]适合打劫银行的日子","frequency":0.0,"frontendQuestionId":"2100","leaf":true,"level":2,"nodeType":"def","questionId":"2205","status":"ac","submitted":7318,"title":"适合打劫银行的日子","titleSlug":"find-good-days-to-rob-the-bank"},{"acceptance":0.37346746306193024,"acs":2376,"articleLive":2,"columnArticles":60,"formTitle":"[2101]引爆最多的炸弹","frequency":0.0,"frontendQuestionId":"2101","leaf":true,"level":2,"nodeType":"def","questionId":"2206","status":"notac","submitted":6362,"title":"引爆最多的炸弹","titleSlug":"detonate-the-maximum-bombs"},{"acceptance":0.5348762455801993,"acs":1664,"articleLive":2,"columnArticles":56,"formTitle":"[2102]序列顺序查询","frequency":0.0,"frontendQuestionId":"2102","leaf":true,"level":3,"nodeType":"def","questionId":"2207","status":"","submitted":3111,"title":"序列顺序查询","titleSlug":"sequentially-ordinal-rank-tracker"},{"acceptance":0.8112631159516536,"acs":6108,"articleLive":2,"columnArticles":108,"formTitle":"[2103]环和杆","frequency":0.1100583063,"frontendQuestionId":"2103","leaf":true,"level":1,"nodeType":"def","questionId":"2226","status":"","submitted":7529,"title":"环和杆","titleSlug":"rings-and-rods"},{"acceptance":0.5572870939420544,"acs":5078,"articleLive":2,"columnArticles":89,"formTitle":"[2104]子数组范围和","frequency":0.0,"frontendQuestionId":"2104","leaf":true,"level":2,"nodeType":"def","questionId":"2227","status":"","submitted":9112,"title":"子数组范围和","titleSlug":"sum-of-subarray-ranges"},{"acceptance":0.5490220505792949,"acs":4407,"articleLive":2,"columnArticles":75,"formTitle":"[2105]给植物浇水 II","frequency":0.1641042295,"frontendQuestionId":"2105","leaf":true,"level":2,"nodeType":"def","questionId":"2228","status":"","submitted":8027,"title":"给植物浇水 II","titleSlug":"watering-plants-ii"},{"acceptance":0.31836317135549874,"acs":3112,"articleLive":2,"columnArticles":74,"formTitle":"[2106]摘水果","frequency":1.1034448977,"frontendQuestionId":"2106","leaf":true,"level":3,"nodeType":"def","questionId":"2229","status":"","submitted":9775,"title":"摘水果","titleSlug":"maximum-fruits-harvested-after-at-most-k-steps"},{"acceptance":0.5487804878048781,"acs":45,"articleLive":2,"columnArticles":5,"formTitle":"[2107]Number of Unique Flavors After Sharing K Candies","frequency":0.0,"frontendQuestionId":"2107","leaf":true,"level":2,"nodeType":"def","questionId":"2247","status":"","submitted":82,"title":"Number of Unique Flavors After Sharing K Candies","titleSlug":"number-of-unique-flavors-after-sharing-k-candies"},{"acceptance":0.8197463768115942,"acs":6335,"articleLive":2,"columnArticles":79,"formTitle":"[2108]找出数组中的第一个回文字符串","frequency":0.0,"frontendQuestionId":"2108","leaf":true,"level":1,"nodeType":"def","questionId":"2231","status":"ac","submitted":7728,"title":"找出数组中的第一个回文字符串","titleSlug":"find-first-palindromic-string-in-the-array"},{"acceptance":0.6080298013245033,"acs":5876,"articleLive":2,"columnArticles":75,"formTitle":"[2109]向字符串添加空格","frequency":0.0,"frontendQuestionId":"2109","leaf":true,"level":2,"nodeType":"def","questionId":"2232","status":"ac","submitted":9664,"title":"向字符串添加空格","titleSlug":"adding-spaces-to-a-string"},{"acceptance":0.4992526158445441,"acs":5678,"articleLive":2,"columnArticles":102,"formTitle":"[2110]股票平滑下跌阶段的数目","frequency":0.0,"frontendQuestionId":"2110","leaf":true,"level":2,"nodeType":"def","questionId":"2233","status":"ac","submitted":11373,"title":"股票平滑下跌阶段的数目","titleSlug":"number-of-smooth-descent-periods-of-a-stock"},{"acceptance":0.31813442032420136,"acs":3356,"articleLive":2,"columnArticles":82,"formTitle":"[2111]使数组 K 递增的最少操作次数","frequency":0.0,"frontendQuestionId":"2111","leaf":true,"level":3,"nodeType":"def","questionId":"2234","status":"notac","submitted":10549,"title":"使数组 K 递增的最少操作次数","titleSlug":"minimum-operations-to-make-the-array-k-increasing"},{"acceptance":0.7964601769911505,"acs":90,"articleLive":2,"columnArticles":4,"formTitle":"[2112]The Airport With the Most Traffic","frequency":0.0,"frontendQuestionId":"2112","leaf":true,"level":2,"nodeType":"def","questionId":"2252","status":"","submitted":113,"title":"The Airport With the Most Traffic","titleSlug":"the-airport-with-the-most-traffic"},{"acceptance":0.9016393442622951,"acs":55,"articleLive":2,"columnArticles":4,"formTitle":"[2113]Elements in Array After Removing and Replacing Elements","frequency":0.0,"frontendQuestionId":"2113","leaf":true,"level":2,"nodeType":"def","questionId":"2258","status":"","submitted":61,"title":"Elements in Array After Removing and Replacing Elements","titleSlug":"elements-in-array-after-removing-and-replacing-elements"},{"acceptance":0.903140203449801,"acs":4084,"articleLive":2,"columnArticles":60,"formTitle":"[2114]句子中的最多单词数","frequency":0.0,"frontendQuestionId":"2114","leaf":true,"level":1,"nodeType":"def","questionId":"2219","status":"ac","submitted":4522,"title":"句子中的最多单词数","titleSlug":"maximum-number-of-words-found-in-sentences"},{"acceptance":0.3522727272727273,"acs":2821,"articleLive":2,"columnArticles":74,"formTitle":"[2115]从给定原材料中找到所有可以做出的菜","frequency":0.4378109156,"frontendQuestionId":"2115","leaf":true,"level":2,"nodeType":"def","questionId":"2220","status":"ac","submitted":8008,"title":"从给定原材料中找到所有可以做出的菜","titleSlug":"find-all-possible-recipes-from-given-supplies"},{"acceptance":0.2692913385826772,"acs":1881,"articleLive":2,"columnArticles":43,"formTitle":"[2116]判断一个括号字符串是否有效","frequency":0.5274230743,"frontendQuestionId":"2116","leaf":true,"level":2,"nodeType":"def","questionId":"2221","status":"ac","submitted":6985,"title":"判断一个括号字符串是否有效","titleSlug":"check-if-a-parentheses-string-can-be-valid"},{"acceptance":0.3594692400482509,"acs":894,"articleLive":2,"columnArticles":13,"formTitle":"[2117]一个区间内所有数乘积的缩写","frequency":0.0,"frontendQuestionId":"2117","leaf":true,"level":3,"nodeType":"def","questionId":"2222","status":"","submitted":2487,"title":"一个区间内所有数乘积的缩写","titleSlug":"abbreviating-the-product-of-a-range"},{"acceptance":0.6153846153846154,"acs":40,"articleLive":2,"columnArticles":1,"formTitle":"[2118]Build the Equation","frequency":0.0,"frontendQuestionId":"2118","leaf":true,"level":3,"nodeType":"def","questionId":"2253","status":"","submitted":65,"title":"Build the Equation","titleSlug":"build-the-equation"},{"acceptance":0.8027255029201817,"acs":6185,"articleLive":2,"columnArticles":48,"formTitle":"[2119]反转两次的数字","frequency":0.0,"frontendQuestionId":"2119","leaf":true,"level":1,"nodeType":"def","questionId":"2238","status":"ac","submitted":7705,"title":"反转两次的数字","titleSlug":"a-number-after-a-double-reversal"},{"acceptance":0.8248701189877661,"acs":4922,"articleLive":2,"columnArticles":66,"formTitle":"[2120]执行所有后缀指令","frequency":0.9945154934,"frontendQuestionId":"2120","leaf":true,"level":2,"nodeType":"def","questionId":"2239","status":"ac","submitted":5967,"title":"执行所有后缀指令","titleSlug":"execution-of-all-suffix-instructions-staying-in-a-grid"},{"acceptance":0.3403412028261244,"acs":3950,"articleLive":2,"columnArticles":114,"formTitle":"[2121]相同元素的间隔之和","frequency":0.6498464895,"frontendQuestionId":"2121","leaf":true,"level":2,"nodeType":"def","questionId":"2240","status":"ac","submitted":11606,"title":"相同元素的间隔之和","titleSlug":"intervals-between-identical-elements"},{"acceptance":0.3949809885931559,"acs":2597,"articleLive":2,"columnArticles":51,"formTitle":"[2122]还原原数组","frequency":0.5274230743,"frontendQuestionId":"2122","leaf":true,"level":3,"nodeType":"def","questionId":"2241","status":"notac","submitted":6575,"title":"还原原数组","titleSlug":"recover-the-original-array"},{"acceptance":0.3333333333333333,"acs":11,"articleLive":2,"columnArticles":1,"formTitle":"[2123]Minimum Operations to Remove Adjacent Ones in Matrix","frequency":0.0,"frontendQuestionId":"2123","leaf":true,"level":3,"nodeType":"def","questionId":"2259","status":"","submitted":33,"title":"Minimum Operations to Remove Adjacent Ones in Matrix","titleSlug":"minimum-operations-to-remove-adjacent-ones-in-matrix"},{"acceptance":0.7196390333435301,"acs":4705,"articleLive":2,"columnArticles":62,"formTitle":"[2124]检查是否所有 A 都在 B 之前","frequency":0.3118267287,"frontendQuestionId":"2124","leaf":true,"level":1,"nodeType":"def","questionId":"2243","status":"ac","submitted":6538,"title":"检查是否所有 A 都在 B 之前","titleSlug":"check-if-all-as-appears-before-all-bs"},{"acceptance":0.8427964465044419,"acs":4364,"articleLive":2,"columnArticles":60,"formTitle":"[2125]银行中的激光束数量","frequency":0.0,"frontendQuestionId":"2125","leaf":true,"level":2,"nodeType":"def","questionId":"2244","status":"ac","submitted":5178,"title":"银行中的激光束数量","titleSlug":"number-of-laser-beams-in-a-bank"},{"acceptance":0.47418197630177195,"acs":4362,"articleLive":2,"columnArticles":51,"formTitle":"[2126]摧毁小行星","frequency":0.0,"frontendQuestionId":"2126","leaf":true,"level":2,"nodeType":"def","questionId":"2245","status":"ac","submitted":9199,"title":"摧毁小行星","titleSlug":"destroying-asteroids"},{"acceptance":0.25185315919519946,"acs":1427,"articleLive":2,"columnArticles":52,"formTitle":"[2127]参加会议的最多员工数","frequency":0.0,"frontendQuestionId":"2127","leaf":true,"level":3,"nodeType":"def","questionId":"2246","status":"notac","submitted":5666,"title":"参加会议的最多员工数","titleSlug":"maximum-employees-to-be-invited-to-a-meeting"},{"acceptance":0.8451511041839564,"acs":83506,"articleLive":2,"columnArticles":642,"formTitle":"[LCP 01]猜数字","frequency":0.4105017363,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":98806,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.691486804787771,"acs":14385,"articleLive":2,"columnArticles":247,"formTitle":"[LCP 02]分式化简","frequency":1.3467470827,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":20803,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.22150602296431324,"acs":11787,"articleLive":2,"columnArticles":188,"formTitle":"[LCP 03]机器人大冒险","frequency":0.4663353824,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":53213,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.38587401145350425,"acs":2830,"articleLive":2,"columnArticles":64,"formTitle":"[LCP 04]覆盖","frequency":0.6692532698,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":7334,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.20272795216741404,"acs":2170,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10704,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8393527935059462,"acs":45806,"articleLive":2,"columnArticles":692,"formTitle":"[LCP 06]拿硬币","frequency":0.0,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":54573,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7662909246225557,"acs":41264,"articleLive":2,"columnArticles":493,"formTitle":"[LCP 07]传递信息","frequency":2.4188123845,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":53849,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2933274850594879,"acs":5350,"articleLive":2,"columnArticles":109,"formTitle":"[LCP 08]剧情触发时间","frequency":1.1152097392,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":18239,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.2804917633693094,"acs":6913,"articleLive":2,"columnArticles":112,"formTitle":"[LCP 09]最小跳跃次数","frequency":2.1423630639,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":24646,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5895117540687161,"acs":1956,"articleLive":2,"columnArticles":39,"formTitle":"[LCP 10]二叉树任务调度","frequency":1.829863125,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3318,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6940595938508256,"acs":7314,"articleLive":2,"columnArticles":74,"formTitle":"[LCP 11]期望个数统计","frequency":0.9844113355,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":10538,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4156730141780863,"acs":7007,"articleLive":2,"columnArticles":115,"formTitle":"[LCP 12]小张刷题计划","frequency":0.4961705308,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":16857,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.611520471583264,"acs":9544,"articleLive":2,"columnArticles":86,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15607,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.2154456334655392,"acs":2879,"articleLive":2,"columnArticles":45,"formTitle":"[LCP 14]切分数组","frequency":1.5206748473,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":13363,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.583180987202925,"acs":957,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 15]游乐园的迷宫","frequency":1.0804236231,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1641,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.3137344970142398,"acs":683,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 16]游乐园的游览计划","frequency":1.0804236231,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":2177,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7988241719407588,"acs":24865,"articleLive":2,"columnArticles":270,"formTitle":"[LCP 17]速算机器人","frequency":0.4105017363,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":31127,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.29037528005974605,"acs":18663,"articleLive":2,"columnArticles":250,"formTitle":"[LCP 18]早餐组合","frequency":1.6449038473,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":64272,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5171672151537924,"acs":19958,"articleLive":2,"columnArticles":206,"formTitle":"[LCP 19]秋叶收藏集","frequency":1.0804236231,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38591,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3202888814242526,"acs":1907,"articleLive":2,"columnArticles":34,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5954,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.33227959255356515,"acs":946,"articleLive":2,"columnArticles":27,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2847,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.33613933236574745,"acs":9264,"articleLive":2,"columnArticles":190,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":27560,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3416676930656485,"acs":2774,"articleLive":2,"columnArticles":56,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":8119,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.28734622144112476,"acs":981,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3414,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.33864434242506075,"acs":1254,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3703,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3430985915492958,"acs":609,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 26]导航装置","frequency":1.0804236231,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1775,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32829046898638425,"acs":1302,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3966,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.28909167346736897,"acs":11690,"articleLive":2,"columnArticles":190,"formTitle":"[LCP 28]采购方案","frequency":0.4105017363,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":40437,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.19256254225828262,"acs":5696,"articleLive":2,"columnArticles":134,"formTitle":"[LCP 29]乐团站位","frequency":1.3787942601,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":29580,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.35600022934464765,"acs":6209,"articleLive":2,"columnArticles":109,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":17441,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.25685071574642127,"acs":1884,"articleLive":2,"columnArticles":38,"formTitle":"[LCP 31]变换的迷宫","frequency":1.9625075996,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":7335,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.4152753108348135,"acs":1169,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 32]批量处理任务","frequency":1.3158804347,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2815,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.22636355626046348,"acs":5138,"articleLive":2,"columnArticles":88,"formTitle":"[LCP 33]蓄水","frequency":1.0470983134,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":22698,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.500642555535157,"acs":2727,"articleLive":2,"columnArticles":65,"formTitle":"[LCP 34]二叉树染色","frequency":1.9625075996,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":5447,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.4144736842105263,"acs":1323,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 35]电动车游城市","frequency":1.1515773834,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":3192,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.27424336009882644,"acs":888,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":2.900123216,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":3238,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.20018302447952413,"acs":875,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 37]最小矩形面积","frequency":0.7526696758,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":4371,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5701849836779108,"acs":524,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":919,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.514339890969424,"acs":4340,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 39]无人机方阵","frequency":0.3843222307,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":8438,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.25378896196740064,"acs":3550,"articleLive":2,"columnArticles":74,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":13988,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.4342025469981807,"acs":1432,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.5946753013,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3298,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.20842450765864332,"acs":1143,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5484,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.42910101946246526,"acs":463,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":1079,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8168257756563246,"acs":4107,"articleLive":2,"columnArticles":58,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":5028,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.20589705147426288,"acs":1236,"articleLive":2,"columnArticles":31,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":6003,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.39243498817966904,"acs":996,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2538,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.3669536695366954,"acs":895,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2439,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.17623956799214532,"acs":359,"articleLive":2,"columnArticles":10,"formTitle":"[LCP 48]无限棋局","frequency":1.0151262807,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":2037,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.2501776830135039,"acs":352,"articleLive":2,"columnArticles":10,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1407,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.542657066771871,"acs":5502,"articleLive":2,"columnArticles":118,"formTitle":"[LCS 01]下载插件","frequency":1.6121462508,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"ac","submitted":10139,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6734918884863758,"acs":4276,"articleLive":2,"columnArticles":83,"formTitle":"[LCS 02]完成一半题目","frequency":1.0470983134,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":6349,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4101531023368251,"acs":2036,"articleLive":2,"columnArticles":65,"formTitle":"[LCS 03]主题空间","frequency":1.3467470827,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4964,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6786336554690023,"acs":447527,"articleLive":2,"columnArticles":3036,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":4.1187387662,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"ac","submitted":659453,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.40297045415989446,"acs":294544,"articleLive":2,"columnArticles":2330,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":3.3428317938,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":730932,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.759918034090367,"acs":334503,"articleLive":2,"columnArticles":2171,"formTitle":"[剑指 Offer 05]替换空格","frequency":3.3658515541,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":440183,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7499322122895891,"acs":348483,"articleLive":2,"columnArticles":2342,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":3.4692270059,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":464686,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6996193734196898,"acs":206967,"articleLive":2,"columnArticles":1551,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":3.0387454141,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":295828,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7133121651484442,"acs":311813,"articleLive":2,"columnArticles":1925,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":4.6673538897,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":437134,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3608567247962127,"acs":295450,"articleLive":2,"columnArticles":2002,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":3.5752526668,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":818746,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4471832411553691,"acs":220896,"articleLive":2,"columnArticles":1432,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":3.2056306722,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":493972,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.492370998078944,"acs":294235,"articleLive":2,"columnArticles":1784,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":3.8918855396,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":597588,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.4526274101192595,"acs":192005,"articleLive":2,"columnArticles":1254,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":2.7822175035,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":424201,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5286162833540697,"acs":197989,"articleLive":2,"columnArticles":1854,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":3.5331056787,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":374542,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5706036019119716,"acs":173213,"articleLive":2,"columnArticles":1422,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":2.6776837758,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":303561,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3142424733425495,"acs":91152,"articleLive":2,"columnArticles":526,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.3118267287,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":290069,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.74824458140018,"acs":216108,"articleLive":2,"columnArticles":1347,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":1.5805729889,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":288820,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.34176217782848506,"acs":137494,"articleLive":2,"columnArticles":832,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":1.2296200904,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":402309,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7782857251930253,"acs":163096,"articleLive":2,"columnArticles":1186,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":2.9304997059,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":209558,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5978349534362042,"acs":211074,"articleLive":2,"columnArticles":1600,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":2.2254500659,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":353064,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3801235290158579,"acs":73422,"articleLive":2,"columnArticles":482,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":2.5467606919,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":193153,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24554925909995007,"acs":85059,"articleLive":2,"columnArticles":935,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":2.7865786094,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":346403,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6448863300856215,"acs":218423,"articleLive":2,"columnArticles":1804,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":2.6989227604,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":338700,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7990407740536333,"acs":287387,"articleLive":2,"columnArticles":2622,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":3.9663137517,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":359665,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7425399430850067,"acs":332946,"articleLive":2,"columnArticles":2019,"formTitle":"[剑指 Offer 24]反转链表","frequency":4.0801835087,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":448388,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7275181168231117,"acs":209419,"articleLive":2,"columnArticles":1301,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":3.4009877139,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":287854,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.46644579791624835,"acs":167260,"articleLive":2,"columnArticles":1350,"formTitle":"[剑指 Offer 26]树的子结构","frequency":3.419894728,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":358584,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7929391945326207,"acs":215574,"articleLive":2,"columnArticles":1558,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":2.343215743,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":271867,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5789786485449291,"acs":170482,"articleLive":2,"columnArticles":1231,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":2.0058513288,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":294453,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.439480489405226,"acs":159411,"articleLive":2,"columnArticles":1587,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":3.3051456546,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":362726,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5602566692641442,"acs":174711,"articleLive":2,"columnArticles":1155,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":3.0288590261,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":311841,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6169066606319704,"acs":125398,"articleLive":2,"columnArticles":1044,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":2.1423630639,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":203269,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6406616037579352,"acs":158344,"articleLive":2,"columnArticles":1110,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":2.2511544575,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":247157,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6881495602976446,"acs":156660,"articleLive":2,"columnArticles":1229,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":2.2031836297,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":227654,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5885758541447126,"acs":139074,"articleLive":2,"columnArticles":1295,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":2.3764833974,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":236289,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5551285763166899,"acs":126546,"articleLive":2,"columnArticles":1058,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":2.2598828013,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":227958,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5802341053281138,"acs":150446,"articleLive":2,"columnArticles":965,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":2.8176743531,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":259285,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7185899980154793,"acs":144839,"articleLive":2,"columnArticles":1000,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":2.5891555404,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":201560,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6540232296243955,"acs":118475,"articleLive":2,"columnArticles":1024,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":3.0690250678,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":181148,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5635481258215713,"acs":84885,"articleLive":2,"columnArticles":601,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":2.6646454415,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":150626,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.580210496507457,"acs":172109,"articleLive":2,"columnArticles":1197,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":3.7599199952,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":296632,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6939557548869992,"acs":185985,"articleLive":2,"columnArticles":1104,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":1.7587599787,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":268007,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5717300899366184,"acs":273861,"articleLive":2,"columnArticles":1937,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":3.2678835196,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":479004,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5822112147734924,"acs":72639,"articleLive":2,"columnArticles":530,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":2.0480297731,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":124764,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6062756550581248,"acs":246214,"articleLive":2,"columnArticles":1632,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":3.9064722228,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":406109,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4905691338553964,"acs":53812,"articleLive":2,"columnArticles":548,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":2.6646454415,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":109693,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.4197321119122534,"acs":61764,"articleLive":2,"columnArticles":517,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":2.4222824414,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":147151,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5584655656303973,"acs":124167,"articleLive":2,"columnArticles":917,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":3.2380505964,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":222336,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5306147681917059,"acs":137330,"articleLive":2,"columnArticles":1587,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":3.3346327864,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":258813,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6901253173391053,"acs":136464,"articleLive":2,"columnArticles":1122,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":2.3915032051,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":197738,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46472291854267567,"acs":171855,"articleLive":2,"columnArticles":1163,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":3.2586372504,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":369801,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6517001602596341,"acs":97190,"articleLive":2,"columnArticles":571,"formTitle":"[剑指 Offer 49]丑数","frequency":2.8176743531,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":149133,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6177614078166564,"acs":178121,"articleLive":2,"columnArticles":1196,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":3.0199582107,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":288333,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.48525446144861817,"acs":113008,"articleLive":2,"columnArticles":920,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":3.6898797079,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":232884,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6518501084343425,"acs":193870,"articleLive":2,"columnArticles":1130,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":2.9654128043,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":297415,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5351794022050858,"acs":218335,"articleLive":2,"columnArticles":1764,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":2.9092813482,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":407966,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44776860073748176,"acs":194898,"articleLive":2,"columnArticles":1652,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":2.8498107946,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":435265,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7586914458370074,"acs":181545,"articleLive":2,"columnArticles":1269,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":1.7638369048,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":239287,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.790542098259607,"acs":195456,"articleLive":2,"columnArticles":1380,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":2.0900688253,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":247243,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5900077339520495,"acs":152576,"articleLive":2,"columnArticles":1021,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":1.2296200904,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":258600,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6961863800860182,"acs":126582,"articleLive":2,"columnArticles":1110,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":2.913123074,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":181822,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.8028788325354278,"acs":100791,"articleLive":2,"columnArticles":759,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":1.6121462508,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":125537,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6694121362033577,"acs":152634,"articleLive":2,"columnArticles":943,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":2.5593236712,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":228012,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7091796838636406,"acs":152363,"articleLive":2,"columnArticles":1950,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":2.7428713906,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":214844,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4427199682928587,"acs":147447,"articleLive":2,"columnArticles":1090,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":2.1423630639,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":333048,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8587059942911512,"acs":240065,"articleLive":2,"columnArticles":1993,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":2.2598828013,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":279566,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44519952343375263,"acs":143864,"articleLive":2,"columnArticles":1278,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":2.9966155021,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":323145,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4762709458190794,"acs":103999,"articleLive":2,"columnArticles":1119,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":2.1178580396,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":218361,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5654911642005593,"acs":72384,"articleLive":2,"columnArticles":642,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":2.7272586192,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":128002,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.46038687907696374,"acs":118429,"articleLive":2,"columnArticles":1102,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":2.0480297731,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":257238,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6561653910059108,"acs":120449,"articleLive":2,"columnArticles":814,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":3.5655760638,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":183565,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6352767969761781,"acs":150593,"articleLive":2,"columnArticles":1068,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":2.9092813482,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":237051,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8569804083526157,"acs":151479,"articleLive":2,"columnArticles":1385,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":2.1465112426,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":176759,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5880579668034722,"acs":80955,"articleLive":2,"columnArticles":557,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":2.5386831036,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":137665,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5989882029699731,"acs":82407,"articleLive":2,"columnArticles":601,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":2.6646454415,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":137577,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.2884761225198839,"acs":77219,"articleLive":2,"columnArticles":621,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":1.6449038473,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":267679,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6952127407703599,"acs":132137,"articleLive":2,"columnArticles":768,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":1.6449038473,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":190067,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7017414594268996,"acs":130479,"articleLive":2,"columnArticles":760,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":2.5875618638,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":185936,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20703593196133935,"acs":16237,"articleLive":2,"columnArticles":180,"formTitle":"[剑指 Offer II 001]整数除法","frequency":2.913123074,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"ac","submitted":78426,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5582423602144226,"acs":14267,"articleLive":2,"columnArticles":188,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":1.5501060475,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"ac","submitted":25557,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7856926078473878,"acs":18122,"articleLive":2,"columnArticles":227,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":1.2296200904,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"ac","submitted":23065,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.7017642117054046,"acs":15036,"articleLive":2,"columnArticles":160,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":1.2296200904,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":21426,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.713760343242415,"acs":11645,"articleLive":2,"columnArticles":137,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.9844113355,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":16315,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6437098692033294,"acs":13534,"articleLive":2,"columnArticles":157,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":1.257384228,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"ac","submitted":21025,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.44832616420422666,"acs":11986,"articleLive":2,"columnArticles":121,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":2.2598828013,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":26735,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.49596318761765323,"acs":11856,"articleLive":2,"columnArticles":143,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.8989866308,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":23905,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5523906408952187,"acs":9774,"articleLive":2,"columnArticles":128,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":1.0470983134,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":17694,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4412587120737866,"acs":10573,"articleLive":2,"columnArticles":113,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":1.7896647868,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":23961,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5594052461775845,"acs":7976,"articleLive":2,"columnArticles":99,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":1.93130382,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":14258,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6685998342999171,"acs":9684,"articleLive":2,"columnArticles":124,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.2740864007,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":14484,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6558537304629902,"acs":6672,"articleLive":2,"columnArticles":97,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.9548670892,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":10173,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.509365179132621,"acs":8104,"articleLive":2,"columnArticles":111,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.4105017363,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":15910,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.625780031201248,"acs":6418,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.4105017363,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":10256,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.4858589021081194,"acs":9311,"articleLive":2,"columnArticles":139,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":1.6720204762,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":19164,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5147194963895575,"acs":5560,"articleLive":2,"columnArticles":86,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.3843222307,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":10802,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5192097857922242,"acs":9041,"articleLive":2,"columnArticles":116,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":17413,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4671175795639833,"acs":7735,"articleLive":2,"columnArticles":111,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":1.3158804347,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":16559,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7163555036950603,"acs":7367,"articleLive":2,"columnArticles":101,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":1.1515773834,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":10284,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.522815845296236,"acs":10598,"articleLive":2,"columnArticles":139,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":1.8216777638,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":20271,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5453662842012357,"acs":12358,"articleLive":2,"columnArticles":112,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":1.6720204762,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":22660,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.6969448584202682,"acs":9353,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.9264156679,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":13420,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7396260973915241,"acs":23421,"articleLive":2,"columnArticles":190,"formTitle":"[剑指 Offer II 024]反转链表","frequency":1.9625075996,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":31666,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.600417924309264,"acs":7758,"articleLive":2,"columnArticles":132,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":2.3617000696,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":12921,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6627232842369163,"acs":8459,"articleLive":2,"columnArticles":126,"formTitle":"[剑指 Offer II 026]重排链表","frequency":1.9356963422,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":12764,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6117490963993228,"acs":13371,"articleLive":2,"columnArticles":154,"formTitle":"[剑指 Offer II 027]回文链表","frequency":1.8162620993,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":21857,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6277246145667198,"acs":4723,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.9548670892,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":7524,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.3052894881337319,"acs":5004,"articleLive":2,"columnArticles":119,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.3118267287,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":16391,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5477380807218631,"acs":4492,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.3591952806,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":8201,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5453768038482095,"acs":5102,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":9355,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.5995199725698611,"acs":6994,"articleLive":2,"columnArticles":103,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":11666,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.765814266487214,"acs":5690,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.9844113355,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":7430,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5726062890118949,"acs":4862,"articleLive":2,"columnArticles":92,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":8491,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6633095359510454,"acs":5203,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.4105017363,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":7844,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5701474074837646,"acs":5531,"articleLive":2,"columnArticles":95,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.3591952806,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":9701,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4431526498565605,"acs":5870,"articleLive":2,"columnArticles":108,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":13246,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7776191522073358,"acs":7081,"articleLive":2,"columnArticles":110,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.4105017363,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":9106,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5059132720105125,"acs":4620,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":9132,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5752688172043011,"acs":3210,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":1.6449038473,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":5580,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7786666666666666,"acs":6424,"articleLive":2,"columnArticles":95,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":8250,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8351288056206089,"acs":5349,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.3843222307,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":6405,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6457733355920718,"acs":3812,"articleLive":2,"columnArticles":75,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.9264156679,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":5903,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6401527203308941,"acs":6036,"articleLive":2,"columnArticles":112,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.3350511817,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":9429,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8052877995042688,"acs":5848,"articleLive":2,"columnArticles":119,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":7262,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7210101811450482,"acs":5453,"articleLive":2,"columnArticles":110,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.872516054,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":7563,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6909136672539643,"acs":5490,"articleLive":2,"columnArticles":104,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":1.2861163328,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":7946,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6876495490520891,"acs":3736,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.4105017363,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":5433,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.753516409912927,"acs":5625,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":1.3787942601,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":7465,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6012056262558607,"acs":4488,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":7465,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.414947216890595,"acs":3459,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":1.6789323091,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":8336,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7465227817745803,"acs":6226,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":1.0470983134,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":8340,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6430997876857749,"acs":6058,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.3843222307,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":9420,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.856078083407276,"acs":4824,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":5635,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8808268297827463,"acs":4176,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":4741,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7217605056771625,"acs":6166,"articleLive":2,"columnArticles":105,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":1.3787942601,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":8543,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.35846826616239214,"acs":3033,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":8461,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.6069400630914826,"acs":2886,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.4378109156,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":4755,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6315171097077398,"acs":4300,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":6809,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6811551495506115,"acs":4623,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.3591952806,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":6787,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5487116938557707,"acs":3599,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.3843222307,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":6559,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7701764822526274,"acs":3884,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":5043,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7256153144940748,"acs":3184,"articleLive":2,"columnArticles":80,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.3843222307,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":4388,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6181267474370923,"acs":2653,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":4292,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.647830744509909,"acs":2419,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.4105017363,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":3734,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6498094027954257,"acs":2557,"articleLive":2,"columnArticles":78,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":3935,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6727941176470589,"acs":2379,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":3536,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5006538226832883,"acs":5743,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":11471,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7210707797263728,"acs":38896,"articleLive":2,"columnArticles":415,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":1.7288927484,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"ac","submitted":53942,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6500802568218299,"acs":5265,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.3350511817,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":8099,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5091949325704945,"acs":2492,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":1.0151262807,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":4894,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4193340368155704,"acs":7153,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 072]求平方根","frequency":1.2861163328,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":17058,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5252344180915609,"acs":3809,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.4105017363,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":7252,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.571513353115727,"acs":4815,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 074]合并区间","frequency":1.257384228,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":8425,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7170514842965725,"acs":5000,"articleLive":2,"columnArticles":95,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.3591952806,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":6973,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6832211459530455,"acs":8323,"articleLive":2,"columnArticles":95,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":1.5805729889,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":12182,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5866528298874432,"acs":7349,"articleLive":2,"columnArticles":122,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.3350511817,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":12527,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6419894567957827,"acs":5602,"articleLive":2,"columnArticles":99,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":1.5501060475,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":8726,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8548559231590181,"acs":5607,"articleLive":2,"columnArticles":105,"formTitle":"[剑指 Offer II 079]所有子集","frequency":1.2861163328,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":6559,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8226480836236933,"acs":4722,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":5740,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7847601347427111,"acs":6756,"articleLive":2,"columnArticles":90,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.4105017363,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":8609,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6479902557856273,"acs":5320,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.9548670892,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":8210,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8602303426702688,"acs":6050,"articleLive":2,"columnArticles":98,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.872516054,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":7033,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6862878994810161,"acs":5025,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":1.3158804347,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":7322,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8515703427506095,"acs":5938,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":1.5805729889,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":6973,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7481831395348837,"acs":4118,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.9548670892,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":5504,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6320939334637965,"acs":4199,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":1.6449038473,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":6643,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7409829567974633,"acs":7478,"articleLive":2,"columnArticles":90,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.9264156679,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"ac","submitted":10092,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6131752627719385,"acs":5017,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.9264156679,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":8182,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.49783013019218847,"acs":3212,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":1.0470983134,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":6452,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.77442502299908,"acs":4209,"articleLive":2,"columnArticles":101,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.4105017363,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":5435,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6789864736140218,"acs":3564,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.4378109156,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":5249,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5724528301886792,"acs":3034,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.4378109156,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":5300,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5992628992628992,"acs":2439,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.3843222307,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":4070,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.652588078728024,"acs":9317,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":2.6315572286,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":14277,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.487726586102719,"acs":2583,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":1.6789323091,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":5296,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5468710089399744,"acs":2141,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":1.0151262807,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":3915,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7537044453344013,"acs":3764,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":4994,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.7164670658682635,"acs":4786,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":1.9948205886,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":6680,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7491993594875901,"acs":3743,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.9844113355,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":4996,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.4880427211516137,"acs":4204,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":1.0804236231,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":8614,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5930122757318225,"acs":3140,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":5295,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.5004807692307692,"acs":5205,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":2.1423630639,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":10400,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5922283521228112,"acs":2469,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.4663353824,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":4169,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6979292078015892,"acs":5797,"articleLive":2,"columnArticles":84,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":1.5805729889,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":8306,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5491563554555681,"acs":2441,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 106]二分图","frequency":1.0151262807,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":4445,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5441827931918862,"acs":2334,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":4289,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5955180014695077,"acs":1621,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":2722,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.5899772209567198,"acs":2331,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":1.4467860052,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":3951,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8187919463087249,"acs":3294,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":4023,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6833171677982541,"acs":1409,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.4378109156,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":2062,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5624552185335563,"acs":2355,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.4105017363,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":4187,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5884205426356589,"acs":2429,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":1.0804236231,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":4128,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.4253904951811233,"acs":1280,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.4663353824,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":3009,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.3099725166862976,"acs":1579,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.4105017363,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":5094,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6499586239508216,"acs":5498,"articleLive":2,"columnArticles":95,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":8459,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6371826371826372,"acs":1556,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":2442,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6973590292648109,"acs":1954,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":2802,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.48364287734514944,"acs":5130,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":1.3787942601,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":10607,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.71650906084986,"acs":100547,"articleLive":2,"columnArticles":1643,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":3.8183094352,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":140329,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6420721036051803,"acs":64204,"articleLive":2,"columnArticles":1189,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":1.2861163328,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":99995,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5784302257573986,"acs":49450,"articleLive":2,"columnArticles":539,"formTitle":"[面试题 01.03]URL化","frequency":1.9948205886,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":85490,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5488461300501145,"acs":44355,"articleLive":2,"columnArticles":845,"formTitle":"[面试题 01.04]回文排列","frequency":1.7896647868,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":80815,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3288364711033275,"acs":36051,"articleLive":2,"columnArticles":614,"formTitle":"[面试题 01.05]一次编辑","frequency":1.3467470827,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":109632,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.47090609555189455,"acs":78606,"articleLive":2,"columnArticles":1226,"formTitle":"[面试题 01.06]字符串压缩","frequency":2.913123074,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":166925,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7495243933372792,"acs":70917,"articleLive":2,"columnArticles":1007,"formTitle":"[面试题 01.07]旋转矩阵","frequency":2.9966155021,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":94616,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.622360612312473,"acs":48869,"articleLive":2,"columnArticles":541,"formTitle":"[面试题 01.08]零矩阵","frequency":0.9844113355,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":78522,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5488380482818748,"acs":36512,"articleLive":2,"columnArticles":460,"formTitle":"[面试题 01.09]字符串轮转","frequency":1.93130382,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":66526,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6777857627659999,"acs":67906,"articleLive":2,"columnArticles":728,"formTitle":"[面试题 02.01]移除重复节点","frequency":1.6449038473,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":100188,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7795715896279594,"acs":69148,"articleLive":2,"columnArticles":989,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":2.5467606919,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":88700,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8553399499754446,"acs":74891,"articleLive":2,"columnArticles":716,"formTitle":"[面试题 02.03]删除中间节点","frequency":1.7587599787,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":87557,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6485051232863893,"acs":27721,"articleLive":2,"columnArticles":399,"formTitle":"[面试题 02.04]分割链表","frequency":0.9548670892,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":42746,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46696954244124056,"acs":40292,"articleLive":2,"columnArticles":565,"formTitle":"[面试题 02.05]链表求和","frequency":2.5995800836,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":86284,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4839995508645857,"acs":43105,"articleLive":2,"columnArticles":535,"formTitle":"[面试题 02.06]回文链表","frequency":0.3843222307,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":89060,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6804736443536729,"acs":59306,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 02.07]链表相交","frequency":0.8989866308,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":87154,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5348962061560487,"acs":29890,"articleLive":2,"columnArticles":310,"formTitle":"[面试题 02.08]环路检测","frequency":1.3158804347,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":55880,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5331837805807161,"acs":12597,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 03.01]三合一","frequency":0.9844113355,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":23626,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6138034244464985,"acs":27890,"articleLive":2,"columnArticles":316,"formTitle":"[面试题 03.02]栈的最小值","frequency":1.8216777638,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":45438,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3877130857284032,"acs":9416,"articleLive":2,"columnArticles":147,"formTitle":"[面试题 03.03]堆盘子","frequency":0.9844113355,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":24286,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7138105037634257,"acs":25321,"articleLive":2,"columnArticles":362,"formTitle":"[面试题 03.04]化栈为队","frequency":1.6121462508,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":35473,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.540642908899282,"acs":16415,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 03.05]栈排序","frequency":0.9844113355,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":30362,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5884173297966402,"acs":11979,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 03.06]动物收容所","frequency":0.9844113355,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":20358,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5311667844138905,"acs":19548,"articleLive":2,"columnArticles":266,"formTitle":"[面试题 04.01]节点间通路","frequency":1.5805729889,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":36802,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7890920757138274,"acs":36894,"articleLive":2,"columnArticles":450,"formTitle":"[面试题 04.02]最小高度树","frequency":2.1423630639,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":46755,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8056259582590194,"acs":25747,"articleLive":2,"columnArticles":567,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":1.8216777638,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":31959,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.58775114174348,"acs":35134,"articleLive":2,"columnArticles":401,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":59777,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3529095448434799,"acs":27564,"articleLive":2,"columnArticles":349,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":0.9844113355,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":78105,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5932926341606463,"acs":22255,"articleLive":2,"columnArticles":270,"formTitle":"[面试题 04.06]后继者","frequency":0.3843222307,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":37511,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7156946826758147,"acs":18359,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 04.08]首个共同祖先","frequency":1.4121084668,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":25652,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.4767168083714846,"acs":7289,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":1.0151262807,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":15290,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7164703034215623,"acs":17757,"articleLive":2,"columnArticles":287,"formTitle":"[面试题 04.10]检查子树","frequency":1.3467470827,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":24784,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48664658380376175,"acs":19224,"articleLive":2,"columnArticles":281,"formTitle":"[面试题 04.12]求和路径","frequency":1.9948205886,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":39503,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5059147313022065,"acs":10478,"articleLive":2,"columnArticles":214,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":20711,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6974915141981952,"acs":8425,"articleLive":2,"columnArticles":142,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.3843222307,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":12079,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.383976766943401,"acs":12164,"articleLive":2,"columnArticles":253,"formTitle":"[面试题 05.03]翻转数位","frequency":1.3158804347,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":31679,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3774589365707979,"acs":5814,"articleLive":2,"columnArticles":147,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":15403,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.531105847151228,"acs":12780,"articleLive":2,"columnArticles":248,"formTitle":"[面试题 05.06]整数转换","frequency":0.9844113355,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":24063,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7062708133431168,"acs":12513,"articleLive":2,"columnArticles":231,"formTitle":"[面试题 05.07]配对交换","frequency":0.9548670892,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":17717,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.558016436829642,"acs":4006,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 05.08]绘制直线","frequency":1.0151262807,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":7179,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.3634464627530718,"acs":45759,"articleLive":2,"columnArticles":499,"formTitle":"[面试题 08.01]三步问题","frequency":1.6449038473,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":125903,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36254863294782286,"acs":13605,"articleLive":2,"columnArticles":214,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":37526,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6756927509129276,"acs":53475,"articleLive":2,"columnArticles":443,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":79141,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.821349657695512,"acs":22675,"articleLive":2,"columnArticles":353,"formTitle":"[面试题 08.04]幂集","frequency":1.8548769354,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":27607,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.678137595552467,"acs":24396,"articleLive":2,"columnArticles":538,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":35975,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6536998404712234,"acs":26635,"articleLive":2,"columnArticles":284,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":1.2861163328,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":40745,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8141699401918109,"acs":23006,"articleLive":2,"columnArticles":339,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":1.7896647868,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":28257,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7174404521598708,"acs":17771,"articleLive":2,"columnArticles":259,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.4663353824,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":24770,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8159319680666435,"acs":23507,"articleLive":2,"columnArticles":388,"formTitle":"[面试题 08.09]括号","frequency":2.4222824414,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":28810,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5590039026203308,"acs":15040,"articleLive":2,"columnArticles":238,"formTitle":"[面试题 08.10]颜色填充","frequency":0.9548670892,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":26905,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4950096722644313,"acs":35313,"articleLive":2,"columnArticles":341,"formTitle":"[面试题 08.11]硬币","frequency":1.6449038473,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":71338,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7616170035424047,"acs":18275,"articleLive":2,"columnArticles":312,"formTitle":"[面试题 08.12]八皇后","frequency":2.0283208182,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":23995,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5028540729299577,"acs":7488,"articleLive":2,"columnArticles":97,"formTitle":"[面试题 08.13]堆箱子","frequency":1.0470983134,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":14891,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.535934769947583,"acs":4601,"articleLive":2,"columnArticles":81,"formTitle":"[面试题 08.14]布尔运算","frequency":1.3787942601,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":8585,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5564856283578059,"acs":59766,"articleLive":2,"columnArticles":2403,"formTitle":"[面试题 10.01]合并排序的数组","frequency":3.1154463448,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":107399,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7395650829640318,"acs":35880,"articleLive":2,"columnArticles":439,"formTitle":"[面试题 10.02]变位词组","frequency":3.0288590261,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":48515,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3939174511223751,"acs":14688,"articleLive":2,"columnArticles":220,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":2.750126737,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":37287,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5564543663821405,"acs":21187,"articleLive":2,"columnArticles":278,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.3591952806,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":38075,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.45342301068980084,"acs":13955,"articleLive":2,"columnArticles":189,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":1.3787942601,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":30777,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6249855273821929,"acs":5398,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":8637,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6641482981540618,"acs":8527,"articleLive":2,"columnArticles":115,"formTitle":"[面试题 10.11]峰与谷","frequency":1.0151262807,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":12839,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8280547112462006,"acs":27243,"articleLive":2,"columnArticles":437,"formTitle":"[面试题 16.01]交换数字","frequency":0.9844113355,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":32900,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7655236762304642,"acs":16409,"articleLive":2,"columnArticles":215,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":21435,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.4410707869205893,"acs":9820,"articleLive":2,"columnArticles":238,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":22264,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.460736302356398,"acs":7997,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":17357,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46004328152665747,"acs":11692,"articleLive":2,"columnArticles":137,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.9548670892,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":25415,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4249430933269438,"acs":14188,"articleLive":2,"columnArticles":212,"formTitle":"[面试题 16.06]最小差","frequency":1.9948205886,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":33388,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.732500345160845,"acs":21222,"articleLive":2,"columnArticles":317,"formTitle":"[面试题 16.07]最大数值","frequency":1.3467470827,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":28972,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3788129226145755,"acs":2521,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6655,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5457850488525335,"acs":2402,"articleLive":2,"columnArticles":42,"formTitle":"[面试题 16.09]运算","frequency":0.4663353824,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":4401,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6802761933353347,"acs":11330,"articleLive":2,"columnArticles":214,"formTitle":"[面试题 16.10]生存人数","frequency":1.3467470827,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":16655,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.44080096305464656,"acs":51996,"articleLive":2,"columnArticles":605,"formTitle":"[面试题 16.11]跳水板","frequency":1.6449038473,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":117958,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.42823621431364883,"acs":2190,"articleLive":2,"columnArticles":60,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":5114,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5530537573881227,"acs":3930,"articleLive":2,"columnArticles":68,"formTitle":"[面试题 16.14]最佳直线","frequency":1.3467470827,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":7106,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5028482910253848,"acs":10063,"articleLive":2,"columnArticles":255,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.4961705308,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":20012,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.45704965567234507,"acs":16393,"articleLive":2,"columnArticles":232,"formTitle":"[面试题 16.16]部分排序","frequency":1.3467470827,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":35867,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.597062611048625,"acs":36628,"articleLive":2,"columnArticles":396,"formTitle":"[面试题 16.17]连续数列","frequency":1.7587599787,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":61347,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3438274884874247,"acs":15530,"articleLive":2,"columnArticles":319,"formTitle":"[面试题 16.18]模式匹配","frequency":0.4378109156,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":45168,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6149528963720184,"acs":21476,"articleLive":2,"columnArticles":388,"formTitle":"[面试题 16.19]水域大小","frequency":1.8548769354,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":34923,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7206079570853822,"acs":9672,"articleLive":2,"columnArticles":189,"formTitle":"[面试题 16.20]T9键盘","frequency":0.9844113355,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":13422,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4658307210031348,"acs":10402,"articleLive":2,"columnArticles":196,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":22330,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5862136301503612,"acs":3002,"articleLive":2,"columnArticles":63,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":5121,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.4733387031816351,"acs":11753,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 16.24]数对和","frequency":0.4105017363,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":24830,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5454901653475432,"acs":34805,"articleLive":2,"columnArticles":279,"formTitle":"[面试题 16.25]LRU 缓存","frequency":3.9352649987,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":63805,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.39055520102105934,"acs":15912,"articleLive":2,"columnArticles":223,"formTitle":"[面试题 16.26]计算器","frequency":2.4541018615,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":40742,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5980543205528899,"acs":13586,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 17.01]不用加号的加法","frequency":1.3467470827,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":22717,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6386967148597705,"acs":30835,"articleLive":2,"columnArticles":491,"formTitle":"[面试题 17.04]消失的数字","frequency":1.3467470827,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":48278,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.39023920990187905,"acs":6085,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":15593,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.45369705671213206,"acs":5056,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.06]2出现的次数","frequency":1.0804236231,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":11144,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4105253839684858,"acs":9275,"articleLive":2,"columnArticles":222,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.4663353824,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":22593,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.2725090774816912,"acs":8856,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 17.08]马戏团人塔","frequency":1.3787942601,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":32498,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5487752161383286,"acs":15234,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 17.09]第 k 个数","frequency":1.8893488444,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":27760,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5699941177932611,"acs":68800,"articleLive":2,"columnArticles":952,"formTitle":"[面试题 17.10]主要元素","frequency":2.8176743531,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":120703,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.685204149784051,"acs":15389,"articleLive":2,"columnArticles":285,"formTitle":"[面试题 17.11]单词距离","frequency":1.0151262807,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":22459,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6312589715443722,"acs":22428,"articleLive":2,"columnArticles":312,"formTitle":"[面试题 17.12]BiNode","frequency":0.9844113355,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":35529,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5520054236101999,"acs":25241,"articleLive":2,"columnArticles":277,"formTitle":"[面试题 17.13]恢复空格","frequency":1.0470983134,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":45726,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5962275250946796,"acs":81078,"articleLive":2,"columnArticles":802,"formTitle":"[面试题 17.14]最小K个数","frequency":3.6339297534,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":135985,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.4043785827539944,"acs":6631,"articleLive":2,"columnArticles":130,"formTitle":"[面试题 17.15]最长单词","frequency":1.8216777638,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":16398,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5170486077106389,"acs":63355,"articleLive":2,"columnArticles":1171,"formTitle":"[面试题 17.16]按摩师","frequency":1.7143279701,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":122532,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4482496194824962,"acs":8835,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 17.17]多次搜索","frequency":0.4105017363,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":19710,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4427785265049416,"acs":7885,"articleLive":2,"columnArticles":135,"formTitle":"[面试题 17.18]最短超串","frequency":1.6789323091,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":17808,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5780286207747347,"acs":9371,"articleLive":2,"columnArticles":197,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.3843222307,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":16212,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5742063492063492,"acs":4341,"articleLive":2,"columnArticles":76,"formTitle":"[面试题 17.20]连续中值","frequency":0.4663353824,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":7560,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6361181814346585,"acs":45235,"articleLive":2,"columnArticles":543,"formTitle":"[面试题 17.21]直方图的水量","frequency":2.4870320677,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":71111,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.38161045895331946,"acs":9720,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 17.22]单词转换","frequency":0.9548670892,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":25471,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.37641757416447613,"acs":5012,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 17.23]最大黑方阵","frequency":1.3787942601,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":13315,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5223275826057897,"acs":12504,"articleLive":2,"columnArticles":132,"formTitle":"[面试题 17.24]最大子矩阵","frequency":3.8183094352,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":23939,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5054514956667598,"acs":1808,"articleLive":2,"columnArticles":40,"formTitle":"[面试题 17.25]单词矩阵","frequency":0.5946753013,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3577,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3463537000537538,"acs":3866,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 17.26]稀疏相似度","frequency":1.0470983134,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":11162,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}]
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/doc/content/DayOfTheWeek.md b/src/main/java/leetcode/editor/cn/doc/content/DayOfTheWeek.md
new file mode 100644
index 0000000..b45f5d7
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/doc/content/DayOfTheWeek.md
@@ -0,0 +1,34 @@
+<p>给你一个日期，请你设计一个算法来判断它是对应一周中的哪一天。</p>
+
+<p>输入为三个整数：<code>day</code>、<code>month</code> 和&nbsp;<code>year</code>，分别表示日、月、年。</p>
+
+<p>您返回的结果必须是这几个值中的一个&nbsp;<code>{&quot;Sunday&quot;, &quot;Monday&quot;, &quot;Tuesday&quot;, &quot;Wednesday&quot;, &quot;Thursday&quot;, &quot;Friday&quot;, &quot;Saturday&quot;}</code>。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><strong>输入：</strong>day = 31, month = 8, year = 2019
+<strong>输出：</strong>&quot;Saturday&quot;
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><strong>输入：</strong>day = 18, month = 7, year = 1999
+<strong>输出：</strong>&quot;Sunday&quot;
+</pre>
+
+<p><strong>示例 3：</strong></p>
+
+<pre><strong>输入：</strong>day = 15, month = 8, year = 1993
+<strong>输出：</strong>&quot;Sunday&quot;
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li>给出的日期一定是在&nbsp;<code>1971</code> 到&nbsp;<code>2100</code>&nbsp;年之间的有效日期。</li>
+</ul>
+<div><div>Related Topics</div><div><li>数学</li></div></div><br><div><li>👍 102</li><li>👎 0</li></div>
\ No newline at end of file