diff --git a/src/main/java/leetcode/editor/cn/LicenseKeyFormatting.java b/src/main/java/leetcode/editor/cn/LicenseKeyFormatting.java
new file mode 100644
index 0000000..94d8617
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/LicenseKeyFormatting.java
@@ -0,0 +1,82 @@
+//有一个密钥字符串 S ，只包含字母，数字以及 '-'（破折号）。其中， N 个 '-' 将字符串分成了 N+1 组。
+//
+// 给你一个数字 K，请你重新格式化字符串，使每个分组恰好包含 K 个字符。特别地，第一个分组包含的字符个数必须小于等于 K，但至少要包含 1 个字符。两个分
+//组之间需要用 '-'（破折号）隔开，并且将所有的小写字母转换为大写字母。
+//
+// 给定非空字符串 S 和数字 K，按照上面描述的规则进行格式化。
+//
+//
+//
+// 示例 1：
+//
+// 输入：S = "5F3Z-2e-9-w", K = 4
+//输出："5F3Z-2E9W"
+//解释：字符串 S 被分成了两个部分，每部分 4 个字符；
+// 注意，两个额外的破折号需要删掉。
+//
+//
+// 示例 2：
+//
+// 输入：S = "2-5g-3-J", K = 2
+//输出："2-5G-3J"
+//解释：字符串 S 被分成了 3 个部分，按照前面的规则描述，第一部分的字符可以少于给定的数量，其余部分皆为 2 个字符。
+//
+//
+//
+//
+// 提示:
+//
+//
+// S 的长度可能很长，请按需分配大小。K 为正整数。
+// S 只包含字母数字（a-z，A-Z，0-9）以及破折号'-'
+// S 非空
+//
+//
+//
+// Related Topics 字符串 👍 113 👎 0
+
+package leetcode.editor.cn;
+
+//482:密钥格式化
+class LicenseKeyFormatting {
+ public static void main(String[] args) {
+ //测试代码
+ Solution solution = new LicenseKeyFormatting().new Solution();
+ }
+
+ //力扣代码
+ //leetcode submit region begin(Prohibit modification and deletion)
+ class Solution {
+ public String licenseKeyFormatting(String s, int k) {
+ s = s.replace("-", "");
+ char[] chs = s.toCharArray();
+ for (int i = 0; i < chs.length; i++) {
+ if (Character.isAlphabetic(chs[i])) {
+ chs[i] = Character.toUpperCase(chs[i]);
+ }
+ }
+ int mod = chs.length % k;
+ s = "";
+ for (int i = 0; i < mod; i++) {
+ s += chs[i];
+ }
+ if (s.length() > 0) {
+ s += "-";
+ }
+ for (int i = mod; i < chs.length; i++) {
+ for (int j = 0; j < k; j++) {
+ s += chs[i];
+ i++;
+ }
+ s += "-";
+ i--;
+ }
+ if (s.length() > 0) {
+ s = s.substring(0, s.length() - 1);
+ }
+ return s;
+ }
+ }
+//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 d09e8ca..81b84e0 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.5550971664314407,"acs":40904,"articleLive":2,"columnArticles":424,"formTitle":"[405]数字转换为十六进制数","frequency":0.0,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"","submitted":73688,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.5204380643633302,"acs":2535848,"articleLive":2,"columnArticles":14293,"formTitle":"[1]两数之和","frequency":0.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4872526,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.40877484059489677,"acs":1011134,"articleLive":2,"columnArticles":7182,"formTitle":"[2]两数相加","frequency":0.0,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2473572,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.3806201131431098,"acs":1253583,"articleLive":2,"columnArticles":7482,"formTitle":"[3]无重复字符的最长子串","frequency":0.0,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3293528,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4085635677246432,"acs":517963,"articleLive":2,"columnArticles":3848,"formTitle":"[4]寻找两个正序数组的中位数","frequency":0.0,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1267766,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.354859733135366,"acs":743775,"articleLive":2,"columnArticles":4027,"formTitle":"[5]最长回文子串","frequency":0.0,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2095969,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.506810046538772,"acs":305684,"articleLive":2,"columnArticles":2472,"formTitle":"[6]Z 字形变换","frequency":0.0,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":603153,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35269711977608503,"acs":841754,"articleLive":2,"columnArticles":5293,"formTitle":"[7]整数反转","frequency":0.0,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2386620,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.2171517654092654,"acs":349767,"articleLive":2,"columnArticles":2690,"formTitle":"[8]字符串转换整数 (atoi)","frequency":0.0,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1610703,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.584074794389969,"acs":775722,"articleLive":2,"columnArticles":4941,"formTitle":"[9]回文数","frequency":0.0,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1328121,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3160081181242343,"acs":205842,"articleLive":2,"columnArticles":1239,"formTitle":"[10]正则表达式匹配","frequency":0.0,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":651382,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6278493944291438,"acs":539597,"articleLive":2,"columnArticles":3060,"formTitle":"[11]盛最多水的容器","frequency":0.0,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":859437,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6646041803218994,"acs":228142,"articleLive":2,"columnArticles":1779,"formTitle":"[12]整数转罗马数字","frequency":0.0,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":343275,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6320179474606895,"acs":470471,"articleLive":2,"columnArticles":3898,"formTitle":"[13]罗马数字转整数","frequency":0.0,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":744395,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.40938599595534586,"acs":628150,"articleLive":2,"columnArticles":3924,"formTitle":"[14]最长公共前缀","frequency":0.0,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1534371,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.33594565664047243,"acs":662206,"articleLive":2,"columnArticles":3110,"formTitle":"[15]三数之和","frequency":0.0,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":1971170,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4591833157464829,"acs":261965,"articleLive":2,"columnArticles":1434,"formTitle":"[16]最接近的三数之和","frequency":0.0,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":570502,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5726589839507663,"acs":341685,"articleLive":2,"columnArticles":3075,"formTitle":"[17]电话号码的字母组合","frequency":0.0,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":596664,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.39896129860963064,"acs":222699,"articleLive":2,"columnArticles":1526,"formTitle":"[18]四数之和","frequency":0.0,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":558197,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.42921795919443273,"acs":521050,"articleLive":2,"columnArticles":3897,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":0.0,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1213952,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44491161924920836,"acs":787801,"articleLive":2,"columnArticles":5594,"formTitle":"[20]有效的括号","frequency":0.0,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1770691,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6672642793709477,"acs":719058,"articleLive":2,"columnArticles":3492,"formTitle":"[21]合并两个有序链表","frequency":0.0,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1077621,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7724569756430416,"acs":353199,"articleLive":2,"columnArticles":2653,"formTitle":"[22]括号生成","frequency":0.0,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":457241,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5597832867604959,"acs":327532,"articleLive":2,"columnArticles":2111,"formTitle":"[23]合并K个升序链表","frequency":0.0,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":585105,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7031422587856884,"acs":318290,"articleLive":2,"columnArticles":2525,"formTitle":"[24]两两交换链表中的节点","frequency":0.0,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":452668,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6574779243184347,"acs":231711,"articleLive":2,"columnArticles":2209,"formTitle":"[25]K 个一组翻转链表","frequency":0.0,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":352424,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5392420336390429,"acs":817863,"articleLive":2,"columnArticles":4548,"formTitle":"[26]删除有序数组中的重复项","frequency":0.0,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1516690,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5972990101549129,"acs":484431,"articleLive":2,"columnArticles":4105,"formTitle":"[27]移除元素","frequency":0.0,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":811036,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40596134594280325,"acs":472021,"articleLive":2,"columnArticles":3246,"formTitle":"[28]实现 strStr()","frequency":0.0,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1162724,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.20760846487280707,"acs":110494,"articleLive":2,"columnArticles":897,"formTitle":"[29]两数相除","frequency":0.0,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","submitted":532223,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.3582983259138504,"acs":80003,"articleLive":2,"columnArticles":591,"formTitle":"[30]串联所有单词的子串","frequency":0.0,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":223286,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3730823787649225,"acs":216199,"articleLive":2,"columnArticles":1747,"formTitle":"[31]下一个排列","frequency":0.0,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":579494,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3565448756484759,"acs":192162,"articleLive":2,"columnArticles":1304,"formTitle":"[32]最长有效括号","frequency":0.0,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":538956,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.42743856569709127,"acs":368199,"articleLive":2,"columnArticles":2428,"formTitle":"[33]搜索旋转排序数组","frequency":0.0,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":861408,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.423608524344293,"acs":344578,"articleLive":2,"columnArticles":3324,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":0.0,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":813435,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.46322717721814005,"acs":512786,"articleLive":2,"columnArticles":3956,"formTitle":"[35]搜索插入位置","frequency":0.0,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1106986,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6406526070448479,"acs":204504,"articleLive":2,"columnArticles":1453,"formTitle":"[36]有效的数独","frequency":0.0,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":319212,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6706911485642121,"acs":101436,"articleLive":2,"columnArticles":856,"formTitle":"[37]解数独","frequency":0.0,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":151241,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5804213606594278,"acs":216597,"articleLive":2,"columnArticles":2273,"formTitle":"[38]外观数列","frequency":0.0,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":373172,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7277675620792312,"acs":337599,"articleLive":2,"columnArticles":1969,"formTitle":"[39]组合总和","frequency":0.0,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":463883,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6232566771315012,"acs":201502,"articleLive":2,"columnArticles":1401,"formTitle":"[40]组合总和 II","frequency":0.0,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":323305,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41932638899418273,"acs":165935,"articleLive":2,"columnArticles":1418,"formTitle":"[41]缺失的第一个正数","frequency":0.0,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":395718,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5809260813777462,"acs":327335,"articleLive":2,"columnArticles":2440,"formTitle":"[42]接雨水","frequency":0.0,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":563471,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.44887997062218027,"acs":171131,"articleLive":2,"columnArticles":1148,"formTitle":"[43]字符串相乘","frequency":0.0,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":381240,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32825131571808364,"acs":84700,"articleLive":2,"columnArticles":549,"formTitle":"[44]通配符匹配","frequency":0.0,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":258034,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.42921835048496504,"acs":203119,"articleLive":2,"columnArticles":1622,"formTitle":"[45]跳跃游戏 II","frequency":0.0,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":473230,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7828333625534035,"acs":424190,"articleLive":2,"columnArticles":2717,"formTitle":"[46]全排列","frequency":0.0,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":541865,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6375548421458397,"acs":216666,"articleLive":2,"columnArticles":1492,"formTitle":"[47]全排列 II","frequency":0.0,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":339839,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.73510358856872,"acs":223323,"articleLive":2,"columnArticles":1889,"formTitle":"[48]旋转图像","frequency":0.0,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":303798,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6649976082175418,"acs":234939,"articleLive":2,"columnArticles":1329,"formTitle":"[49]字母异位词分组","frequency":0.0,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":353293,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3762841630116138,"acs":217823,"articleLive":2,"columnArticles":1291,"formTitle":"[50]Pow(x, n)","frequency":0.0,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":578879,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.738630050384107,"acs":154223,"articleLive":2,"columnArticles":1540,"formTitle":"[51]N 皇后","frequency":0.0,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":208796,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.822541460979533,"acs":74148,"articleLive":2,"columnArticles":610,"formTitle":"[52]N皇后 II","frequency":0.0,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":90145,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5525588402341123,"acs":685883,"articleLive":2,"columnArticles":3799,"formTitle":"[53]最大子序和","frequency":0.0,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1241285,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.4811273734677613,"acs":190168,"articleLive":2,"columnArticles":2016,"formTitle":"[54]螺旋矩阵","frequency":0.0,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":395255,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43242846487121295,"acs":326973,"articleLive":2,"columnArticles":2513,"formTitle":"[55]跳跃游戏","frequency":0.0,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":756132,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.46907743281080655,"acs":303396,"articleLive":2,"columnArticles":2318,"formTitle":"[56]合并区间","frequency":0.0,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":646793,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.41114254438963366,"acs":86763,"articleLive":2,"columnArticles":931,"formTitle":"[57]插入区间","frequency":0.0,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":211029,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.3757954872533669,"acs":249373,"articleLive":2,"columnArticles":2680,"formTitle":"[58]最后一个单词的长度","frequency":0.0,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":663587,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7903910116256744,"acs":127611,"articleLive":2,"columnArticles":1581,"formTitle":"[59]螺旋矩阵 II","frequency":0.0,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":161453,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5241574467098091,"acs":90392,"articleLive":2,"columnArticles":955,"formTitle":"[60]排列序列","frequency":0.0,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":172452,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.41760771891467535,"acs":197883,"articleLive":2,"columnArticles":2015,"formTitle":"[61]旋转链表","frequency":0.0,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":473849,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.662044221139248,"acs":315713,"articleLive":2,"columnArticles":2433,"formTitle":"[62]不同路径","frequency":0.0,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":476876,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.39149313551388853,"acs":182758,"articleLive":2,"columnArticles":1724,"formTitle":"[63]不同路径 II","frequency":0.0,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":466823,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6883826357141948,"acs":270290,"articleLive":2,"columnArticles":2092,"formTitle":"[64]最小路径和","frequency":0.0,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":392645,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2693113938537537,"acs":46122,"articleLive":2,"columnArticles":639,"formTitle":"[65]有效数字","frequency":0.0,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":171259,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.45745738322183105,"acs":351599,"articleLive":2,"columnArticles":3184,"formTitle":"[66]加一","frequency":0.0,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":768594,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5428863635732013,"acs":195343,"articleLive":2,"columnArticles":1783,"formTitle":"[67]二进制求和","frequency":0.0,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":359823,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5243185388026299,"acs":37720,"articleLive":2,"columnArticles":574,"formTitle":"[68]文本左右对齐","frequency":0.0,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":71941,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39216483774894256,"acs":388573,"articleLive":2,"columnArticles":1951,"formTitle":"[69]Sqrt(x)","frequency":0.0,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":990841,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.529799671243136,"acs":577248,"articleLive":2,"columnArticles":3602,"formTitle":"[70]爬楼梯","frequency":0.0,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1089559,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42159080747563266,"acs":94293,"articleLive":2,"columnArticles":830,"formTitle":"[71]简化路径","frequency":0.0,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":223660,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6138984085579898,"acs":176982,"articleLive":2,"columnArticles":1238,"formTitle":"[72]编辑距离","frequency":0.0,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":288292,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6043620481873125,"acs":133396,"articleLive":2,"columnArticles":986,"formTitle":"[73]矩阵置零","frequency":0.0,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":220722,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4607479775238281,"acs":170063,"articleLive":2,"columnArticles":1710,"formTitle":"[74]搜索二维矩阵","frequency":0.0,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":369102,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5960159415213182,"acs":270537,"articleLive":2,"columnArticles":1867,"formTitle":"[75]颜色分类","frequency":0.0,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":453909,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4266018196340534,"acs":185867,"articleLive":2,"columnArticles":1270,"formTitle":"[76]最小覆盖子串","frequency":0.0,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":435692,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7699854233997919,"acs":221330,"articleLive":2,"columnArticles":1302,"formTitle":"[77]组合","frequency":0.0,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":287447,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8012446935873775,"acs":313882,"articleLive":2,"columnArticles":2054,"formTitle":"[78]子集","frequency":0.0,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":391743,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4584891030715723,"acs":225291,"articleLive":2,"columnArticles":1416,"formTitle":"[79]单词搜索","frequency":0.0,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":491377,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6166227405731837,"acs":148566,"articleLive":2,"columnArticles":1329,"formTitle":"[80]删除有序数组中的重复项 II","frequency":0.0,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":240935,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4150278231315184,"acs":124554,"articleLive":2,"columnArticles":998,"formTitle":"[81]搜索旋转排序数组 II","frequency":0.0,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":300110,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5304746321324382,"acs":182200,"articleLive":2,"columnArticles":1693,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":0.0,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":343466,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.538544892427149,"acs":318077,"articleLive":2,"columnArticles":1953,"formTitle":"[83]删除排序链表中的重复元素","frequency":0.0,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":590623,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43320851589947595,"acs":183602,"articleLive":2,"columnArticles":1159,"formTitle":"[84]柱状图中最大的矩形","frequency":0.0,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":423819,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5157333361411341,"acs":97962,"articleLive":2,"columnArticles":694,"formTitle":"[85]最大矩形","frequency":0.0,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":189947,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6326106780098779,"acs":120017,"articleLive":2,"columnArticles":1107,"formTitle":"[86]分隔链表","frequency":0.0,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":189717,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.487517085879178,"acs":41730,"articleLive":2,"columnArticles":312,"formTitle":"[87]扰乱字符串","frequency":0.0,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":85597,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5169629291083797,"acs":467152,"articleLive":2,"columnArticles":3272,"formTitle":"[88]合并两个有序数组","frequency":0.0,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":903647,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.709949877102511,"acs":58923,"articleLive":2,"columnArticles":478,"formTitle":"[89]格雷编码","frequency":0.0,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":82996,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6337295724916415,"acs":138558,"articleLive":2,"columnArticles":1221,"formTitle":"[90]子集 II","frequency":0.0,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":218639,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.308807437249152,"acs":163961,"articleLive":2,"columnArticles":1524,"formTitle":"[91]解码方法","frequency":0.0,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":530949,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5485886712328061,"acs":212893,"articleLive":2,"columnArticles":2038,"formTitle":"[92]反转链表 II","frequency":0.0,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":388074,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.540143350332089,"acs":154111,"articleLive":2,"columnArticles":1336,"formTitle":"[93]复原 IP 地址","frequency":0.0,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":285315,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.755626975299658,"acs":565917,"articleLive":2,"columnArticles":2318,"formTitle":"[94]二叉树的中序遍历","frequency":0.0,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":748937,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7020342649778429,"acs":100598,"articleLive":2,"columnArticles":629,"formTitle":"[95]不同的二叉搜索树 II","frequency":0.0,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":143295,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6993713708226992,"acs":163320,"articleLive":2,"columnArticles":1293,"formTitle":"[96]不同的二叉搜索树","frequency":0.0,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":233524,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.45593818690468263,"acs":61605,"articleLive":2,"columnArticles":545,"formTitle":"[97]交错字符串","frequency":0.0,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":135117,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.34995656665140407,"acs":349285,"articleLive":2,"columnArticles":1944,"formTitle":"[98]验证二叉搜索树","frequency":0.0,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":998081,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6112085411444654,"acs":71446,"articleLive":2,"columnArticles":591,"formTitle":"[99]恢复二叉搜索树","frequency":0.0,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":116893,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6023494528835942,"acs":250687,"articleLive":2,"columnArticles":1891,"formTitle":"[100]相同的树","frequency":0.0,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":416182,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5634381869462641,"acs":412923,"articleLive":2,"columnArticles":2266,"formTitle":"[101]对称二叉树","frequency":0.0,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":732863,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6418687013275262,"acs":399087,"articleLive":2,"columnArticles":2512,"formTitle":"[102]二叉树的层序遍历","frequency":0.0,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":621758,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5715524037250624,"acs":174731,"articleLive":2,"columnArticles":1596,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":0.0,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":305713,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7662008999058583,"acs":516814,"articleLive":2,"columnArticles":2566,"formTitle":"[104]二叉树的最大深度","frequency":0.0,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":674515,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7043833111326846,"acs":249594,"articleLive":2,"columnArticles":1439,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":354344,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.721354602764738,"acs":133535,"articleLive":2,"columnArticles":889,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":185117,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.696904738566966,"acs":163528,"articleLive":2,"columnArticles":1313,"formTitle":"[107]二叉树的层序遍历 II","frequency":0.0,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":234649,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7602094861660079,"acs":192333,"articleLive":2,"columnArticles":1192,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":0.0,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":253000,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7630861350487519,"acs":94306,"articleLive":2,"columnArticles":727,"formTitle":"[109]有序链表转换二叉搜索树","frequency":0.0,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":123585,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5631960739677092,"acs":257295,"articleLive":2,"columnArticles":1470,"formTitle":"[110]平衡二叉树","frequency":0.0,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":456848,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.48599487541179726,"acs":272179,"articleLive":2,"columnArticles":1796,"formTitle":"[111]二叉树的最小深度","frequency":0.0,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":560045,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5259913764562455,"acs":270085,"articleLive":2,"columnArticles":1693,"formTitle":"[112]路径总和","frequency":0.0,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":513478,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6273834745762712,"acs":180044,"articleLive":2,"columnArticles":1271,"formTitle":"[113]路径总和 II","frequency":0.0,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":286976,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7256802603337257,"acs":178177,"articleLive":2,"columnArticles":1326,"formTitle":"[114]二叉树展开为链表","frequency":0.0,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":245531,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5224177816946165,"acs":61650,"articleLive":2,"columnArticles":682,"formTitle":"[115]不同的子序列","frequency":0.0,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":118009,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7038581948448176,"acs":158953,"articleLive":2,"columnArticles":1212,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":0.0,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":225831,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6138384044653189,"acs":90179,"articleLive":2,"columnArticles":764,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":0.0,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":146910,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7302164221666515,"acs":216377,"articleLive":2,"columnArticles":1742,"formTitle":"[118]杨辉三角","frequency":0.0,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":296319,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6666144489495024,"acs":144682,"articleLive":2,"columnArticles":1203,"formTitle":"[119]杨辉三角 II","frequency":0.0,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":217040,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6811984028387225,"acs":179303,"articleLive":2,"columnArticles":1578,"formTitle":"[120]三角形最小路径和","frequency":0.0,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":263217,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5733011771554561,"acs":565287,"articleLive":2,"columnArticles":3404,"formTitle":"[121]买卖股票的最佳时机","frequency":0.0,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":986021,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6891445339152487,"acs":463602,"articleLive":2,"columnArticles":2658,"formTitle":"[122]买卖股票的最佳时机 II","frequency":0.0,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":672721,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5362931125709216,"acs":131764,"articleLive":2,"columnArticles":819,"formTitle":"[123]买卖股票的最佳时机 III","frequency":0.0,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":245694,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4444906987264346,"acs":160162,"articleLive":2,"columnArticles":1098,"formTitle":"[124]二叉树中的最大路径和","frequency":0.0,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":360327,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.4730687275062957,"acs":278400,"articleLive":2,"columnArticles":1837,"formTitle":"[125]验证回文串","frequency":0.0,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":588498,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3951986702042643,"acs":37089,"articleLive":2,"columnArticles":329,"formTitle":"[126]单词接龙 II","frequency":0.0,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":93849,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.467936781870203,"acs":123642,"articleLive":2,"columnArticles":653,"formTitle":"[127]单词接龙","frequency":0.0,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":264228,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5431356198218708,"acs":171299,"articleLive":2,"columnArticles":1115,"formTitle":"[128]最长连续序列","frequency":0.0,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":315389,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6822519998421548,"acs":121024,"articleLive":2,"columnArticles":1116,"formTitle":"[129]求根节点到叶节点数字之和","frequency":0.0,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":177389,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.4450224135024581,"acs":129356,"articleLive":2,"columnArticles":1174,"formTitle":"[130]被围绕的区域","frequency":0.0,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":290673,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7230052775289508,"acs":133983,"articleLive":2,"columnArticles":870,"formTitle":"[131]分割回文串","frequency":0.0,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":185314,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49214810403017667,"acs":49579,"articleLive":2,"columnArticles":438,"formTitle":"[132]分割回文串 II","frequency":0.0,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":100740,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6761186553873553,"acs":72891,"articleLive":2,"columnArticles":527,"formTitle":"[133]克隆图","frequency":0.0,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":107808,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5755932203389831,"acs":125652,"articleLive":2,"columnArticles":974,"formTitle":"[134]加油站","frequency":0.0,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":218300,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.48595570099391927,"acs":99497,"articleLive":2,"columnArticles":795,"formTitle":"[135]分发糖果","frequency":0.0,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":204745,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7192856733360087,"acs":501860,"articleLive":2,"columnArticles":2272,"formTitle":"[136]只出现一次的数字","frequency":0.0,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":697720,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7196787493557808,"acs":100542,"articleLive":2,"columnArticles":756,"formTitle":"[137]只出现一次的数字 II","frequency":0.0,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":139704,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6607410014960838,"acs":112620,"articleLive":2,"columnArticles":854,"formTitle":"[138]复制带随机指针的链表","frequency":0.0,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":170445,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.514899355173711,"acs":194357,"articleLive":2,"columnArticles":1210,"formTitle":"[139]单词拆分","frequency":0.0,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":377466,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.48896240160546883,"acs":53359,"articleLive":2,"columnArticles":543,"formTitle":"[140]单词拆分 II","frequency":0.0,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":109127,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5123755605553929,"acs":531977,"articleLive":2,"columnArticles":2738,"formTitle":"[141]环形链表","frequency":0.0,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1038256,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5525141145058394,"acs":298188,"articleLive":2,"columnArticles":1737,"formTitle":"[142]环形链表 II","frequency":0.0,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":539693,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6202631988483834,"acs":127541,"articleLive":2,"columnArticles":1080,"formTitle":"[143]重排链表","frequency":0.0,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":205624,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.703398715430107,"acs":414624,"articleLive":2,"columnArticles":1842,"formTitle":"[144]二叉树的前序遍历","frequency":0.0,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":589458,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.750239707482351,"acs":302027,"articleLive":2,"columnArticles":1558,"formTitle":"[145]二叉树的后序遍历","frequency":0.0,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":402574,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5258577855368294,"acs":234948,"articleLive":2,"columnArticles":1388,"formTitle":"[146]LRU 缓存机制","frequency":0.0,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":446790,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6812112963593059,"acs":100104,"articleLive":2,"columnArticles":785,"formTitle":"[147]对链表进行插入排序","frequency":0.0,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":146950,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6668783068783068,"acs":211117,"articleLive":2,"columnArticles":1253,"formTitle":"[148]排序链表","frequency":0.0,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":316575,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.34053052325581395,"acs":46857,"articleLive":2,"columnArticles":513,"formTitle":"[149]直线上最多的点数","frequency":0.0,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":137600,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5354908488532921,"acs":133183,"articleLive":2,"columnArticles":1053,"formTitle":"[150]逆波兰表达式求值","frequency":0.0,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":248712,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.4833303467048955,"acs":169923,"articleLive":2,"columnArticles":1428,"formTitle":"[151]翻转字符串里的单词","frequency":0.0,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":351567,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.4211264484916043,"acs":184362,"articleLive":2,"columnArticles":1238,"formTitle":"[152]乘积最大子数组","frequency":0.0,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":437783,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5667265046670965,"acs":211835,"articleLive":2,"columnArticles":1499,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":0.0,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":373787,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5318486275539879,"acs":113388,"articleLive":2,"columnArticles":896,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":0.0,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":213196,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5732439314275704,"acs":287941,"articleLive":2,"columnArticles":1597,"formTitle":"[155]最小栈","frequency":0.0,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":502301,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7234701781564679,"acs":6538,"articleLive":2,"columnArticles":113,"formTitle":"[156]上下翻转二叉树","frequency":0.0,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","submitted":9037,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5333593065160223,"acs":5476,"articleLive":2,"columnArticles":82,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","submitted":10267,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5911111111111111,"acs":2793,"articleLive":2,"columnArticles":65,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.0,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"lock","submitted":4725,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5455707573244887,"acs":15791,"articleLive":2,"columnArticles":191,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","submitted":28944,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6140763511320665,"acs":336800,"articleLive":2,"columnArticles":1971,"formTitle":"[160]相交链表","frequency":0.0,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":548466,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33613892088243114,"acs":7588,"articleLive":2,"columnArticles":104,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.0,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","submitted":22574,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.497453924851363,"acs":160896,"articleLive":2,"columnArticles":1091,"formTitle":"[162]寻找峰值","frequency":0.0,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":323439,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.32500710631040364,"acs":9147,"articleLive":2,"columnArticles":144,"formTitle":"[163]缺失的区间","frequency":0.0,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","submitted":28144,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6102961670675434,"acs":59120,"articleLive":2,"columnArticles":490,"formTitle":"[164]最大间距","frequency":0.0,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":96871,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5188652465135382,"acs":85908,"articleLive":2,"columnArticles":919,"formTitle":"[165]比较版本号","frequency":0.0,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":165569,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.29905149503508244,"acs":26894,"articleLive":2,"columnArticles":208,"formTitle":"[166]分数到小数","frequency":0.0,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":89931,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5865245321850678,"acs":293535,"articleLive":2,"columnArticles":1927,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":0.0,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":500465,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43243562242771955,"acs":84267,"articleLive":2,"columnArticles":751,"formTitle":"[168]Excel表列名称","frequency":0.0,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":194866,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6646636241426847,"acs":388127,"articleLive":2,"columnArticles":2197,"formTitle":"[169]多数元素","frequency":0.0,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":583945,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.4184552489414513,"acs":8598,"articleLive":2,"columnArticles":86,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.0,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","submitted":20547,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7179574753055417,"acs":107209,"articleLive":2,"columnArticles":916,"formTitle":"[171]Excel 表列序号","frequency":0.0,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":149325,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4396218141164338,"acs":91229,"articleLive":2,"columnArticles":597,"formTitle":"[172]阶乘后的零","frequency":0.0,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":207517,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8043750200468294,"acs":75234,"articleLive":2,"columnArticles":625,"formTitle":"[173]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":93531,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4804536072093843,"acs":38173,"articleLive":2,"columnArticles":406,"formTitle":"[174]地下城游戏","frequency":0.0,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":79452,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7395205587418607,"acs":304945,"articleLive":2,"columnArticles":1466,"formTitle":"[175]组合两个表","frequency":0.0,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":412355,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3559356638275883,"acs":252788,"articleLive":2,"columnArticles":1017,"formTitle":"[176]第二高的薪水","frequency":0.0,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":710207,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4627287589937125,"acs":128497,"articleLive":2,"columnArticles":501,"formTitle":"[177]第N高的薪水","frequency":0.0,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":277694,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6032222070755264,"acs":119476,"articleLive":2,"columnArticles":671,"formTitle":"[178]分数排名","frequency":0.0,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":198063,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4096869905114885,"acs":121371,"articleLive":2,"columnArticles":961,"formTitle":"[179]最大数","frequency":0.0,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":296253,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48672354454629496,"acs":87399,"articleLive":2,"columnArticles":512,"formTitle":"[180]连续出现的数字","frequency":0.0,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":179566,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.70217967523611,"acs":163716,"articleLive":2,"columnArticles":676,"formTitle":"[181]超过经理收入的员工","frequency":0.0,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":233154,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7969062600306912,"acs":181238,"articleLive":2,"columnArticles":584,"formTitle":"[182]查找重复的电子邮箱","frequency":0.0,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":227427,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6769639916121426,"acs":150439,"articleLive":2,"columnArticles":541,"formTitle":"[183]从不订购的客户","frequency":0.0,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":222226,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47610116615910275,"acs":102556,"articleLive":2,"columnArticles":674,"formTitle":"[184]部门工资最高的员工","frequency":0.0,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":215408,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49602719413591473,"acs":70918,"articleLive":2,"columnArticles":627,"formTitle":"[185]部门工资前三高的所有员工","frequency":0.0,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":142972,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7558764940239043,"acs":7589,"articleLive":2,"columnArticles":115,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.0,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","submitted":10040,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.4850975674953221,"acs":43554,"articleLive":2,"columnArticles":288,"formTitle":"[187]重复的DNA序列","frequency":0.0,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"","submitted":89784,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3919399050213004,"acs":89795,"articleLive":2,"columnArticles":693,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":0.0,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":229104,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.45067380006995417,"acs":344025,"articleLive":2,"columnArticles":1710,"formTitle":"[189]旋转数组","frequency":0.0,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":763357,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6980632546833303,"acs":132098,"articleLive":2,"columnArticles":832,"formTitle":"[190]颠倒二进制位","frequency":0.0,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":189235,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7489054763484728,"acs":190729,"articleLive":2,"columnArticles":1200,"formTitle":"[191]位1的个数","frequency":0.0,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":254677,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3558952323159431,"acs":21700,"articleLive":2,"columnArticles":177,"formTitle":"[192]统计词频","frequency":0.0,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":60973,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3248703759098614,"acs":26065,"articleLive":2,"columnArticles":140,"formTitle":"[193]有效电话号码","frequency":0.0,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":80232,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34492714698180355,"acs":10274,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":0.0,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":29786,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4360798939981351,"acs":35544,"articleLive":2,"columnArticles":142,"formTitle":"[195]第十行","frequency":0.0,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":81508,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6653171213478883,"acs":101721,"articleLive":2,"columnArticles":388,"formTitle":"[196]删除重复的电子邮箱","frequency":0.0,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":152891,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5335614694985717,"acs":94331,"articleLive":2,"columnArticles":505,"formTitle":"[197]上升的温度","frequency":0.0,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":176795,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5151600154014907,"acs":389343,"articleLive":2,"columnArticles":2684,"formTitle":"[198]打家劫舍","frequency":0.0,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":755771,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6522759807960524,"acs":141705,"articleLive":2,"columnArticles":1589,"formTitle":"[199]二叉树的右视图","frequency":0.0,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":217247,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5563440455085228,"acs":330761,"articleLive":2,"columnArticles":2118,"formTitle":"[200]岛屿数量","frequency":0.0,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":594526,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5240060371304632,"acs":49648,"articleLive":2,"columnArticles":323,"formTitle":"[201]数字范围按位与","frequency":0.0,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":94747,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6190025413423239,"acs":170014,"articleLive":2,"columnArticles":1384,"formTitle":"[202]快乐数","frequency":0.0,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":274658,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5160347341906403,"acs":233547,"articleLive":2,"columnArticles":1666,"formTitle":"[203]移除链表元素","frequency":0.0,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":452580,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37784372793177734,"acs":169076,"articleLive":2,"columnArticles":733,"formTitle":"[204]计数质数","frequency":0.0,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":447476,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5007650772991892,"acs":113888,"articleLive":2,"columnArticles":874,"formTitle":"[205]同构字符串","frequency":0.0,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":227428,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.723087518434596,"acs":712905,"articleLive":2,"columnArticles":7376,"formTitle":"[206]反转链表","frequency":0.0,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":985918,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5432667749289053,"acs":142513,"articleLive":2,"columnArticles":935,"formTitle":"[207]课程表","frequency":0.0,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":262326,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7168629118800472,"acs":144959,"articleLive":2,"columnArticles":980,"formTitle":"[208]实现 Trie (前缀树)","frequency":0.0,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":202213,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.47219039267034735,"acs":194915,"articleLive":2,"columnArticles":1384,"formTitle":"[209]长度最小的子数组","frequency":0.0,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":412789,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5422377664546085,"acs":89922,"articleLive":2,"columnArticles":674,"formTitle":"[210]课程表 II","frequency":0.0,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":165835,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4818896081434995,"acs":29256,"articleLive":2,"columnArticles":322,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":0.0,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":60711,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.46271970812742513,"acs":61892,"articleLive":2,"columnArticles":573,"formTitle":"[212]单词搜索 II","frequency":0.0,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":133757,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4329073939639942,"acs":166378,"articleLive":2,"columnArticles":1530,"formTitle":"[213]打家劫舍 II","frequency":0.0,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":384327,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3712549834085321,"acs":31103,"articleLive":2,"columnArticles":304,"formTitle":"[214]最短回文串","frequency":0.0,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":83778,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.646278625675158,"acs":441999,"articleLive":2,"columnArticles":2292,"formTitle":"[215]数组中的第K个最大元素","frequency":0.0,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":683914,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7371569525272518,"acs":99814,"articleLive":2,"columnArticles":1031,"formTitle":"[216]组合总和 III","frequency":0.0,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":135404,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5585759081450722,"acs":367491,"articleLive":2,"columnArticles":1714,"formTitle":"[217]存在重复元素","frequency":0.0,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":657907,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5427118351866218,"acs":31480,"articleLive":2,"columnArticles":279,"formTitle":"[218]天际线问题","frequency":0.0,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":58005,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4248811999096315,"acs":110959,"articleLive":2,"columnArticles":891,"formTitle":"[219]存在重复元素 II","frequency":0.0,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":261153,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28675215195276377,"acs":64494,"articleLive":2,"columnArticles":419,"formTitle":"[220]存在重复元素 III","frequency":0.0,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":224912,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47635935821582637,"acs":139690,"articleLive":2,"columnArticles":987,"formTitle":"[221]最大正方形","frequency":0.0,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":293245,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7811643077913284,"acs":116513,"articleLive":2,"columnArticles":878,"formTitle":"[222]完全二叉树的节点个数","frequency":0.0,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":149153,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5224817724016863,"acs":40775,"articleLive":2,"columnArticles":513,"formTitle":"[223]矩形面积","frequency":0.0,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":78041,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4180966232303921,"acs":71293,"articleLive":2,"columnArticles":656,"formTitle":"[224]基本计算器","frequency":0.0,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":170518,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6755235621669317,"acs":135508,"articleLive":2,"columnArticles":4758,"formTitle":"[225]用队列实现栈","frequency":0.0,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":200597,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7877703118284828,"acs":306111,"articleLive":2,"columnArticles":1864,"formTitle":"[226]翻转二叉树","frequency":0.0,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":388579,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43741452493592536,"acs":86357,"articleLive":2,"columnArticles":702,"formTitle":"[227]基本计算器 II","frequency":0.0,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":197426,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5802947154471545,"acs":57101,"articleLive":2,"columnArticles":643,"formTitle":"[228]汇总区间","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":98400,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.46381325901358184,"acs":36779,"articleLive":2,"columnArticles":314,"formTitle":"[229]求众数 II","frequency":0.0,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":79297,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.741384581552143,"acs":138223,"articleLive":2,"columnArticles":865,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.0,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":186439,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5043612847493011,"acs":168148,"articleLive":2,"columnArticles":1217,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":333388,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6911660471950903,"acs":159922,"articleLive":2,"columnArticles":1274,"formTitle":"[232]用栈实现队列","frequency":0.0,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":231380,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47702025099038703,"acs":34438,"articleLive":2,"columnArticles":415,"formTitle":"[233]数字 1 的个数","frequency":0.0,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":72194,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.4962256667404702,"acs":311527,"articleLive":2,"columnArticles":1995,"formTitle":"[234]回文链表","frequency":0.0,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":627793,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.666081453824756,"acs":170728,"articleLive":2,"columnArticles":980,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":256317,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6805789340795758,"acs":258767,"articleLive":2,"columnArticles":1391,"formTitle":"[236]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":380216,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8481252177859174,"acs":209319,"articleLive":2,"columnArticles":1013,"formTitle":"[237]删除链表中的节点","frequency":0.0,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":246802,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7229703011509084,"acs":138952,"articleLive":2,"columnArticles":870,"formTitle":"[238]除自身以外数组的乘积","frequency":0.0,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":192196,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4965278936572768,"acs":193414,"articleLive":2,"columnArticles":1321,"formTitle":"[239]滑动窗口最大值","frequency":0.0,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":389533,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.47789701933746115,"acs":169263,"articleLive":2,"columnArticles":763,"formTitle":"[240]搜索二维矩阵 II","frequency":0.0,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":354183,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7376518029882754,"acs":31646,"articleLive":2,"columnArticles":283,"formTitle":"[241]为运算表达式设计优先级","frequency":0.0,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":42901,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.645267433329503,"acs":291999,"articleLive":2,"columnArticles":1686,"formTitle":"[242]有效的字母异位词","frequency":0.0,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":452524,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6555877760428285,"acs":8817,"articleLive":2,"columnArticles":105,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","submitted":13449,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5509167218908769,"acs":4988,"articleLive":2,"columnArticles":58,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","submitted":9054,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6030545046938489,"acs":4304,"articleLive":2,"columnArticles":59,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","submitted":7137,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4763247367111701,"acs":5744,"articleLive":2,"columnArticles":108,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","submitted":12059,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5239256324291375,"acs":5157,"articleLive":2,"columnArticles":92,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","submitted":9843,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.463281799016163,"acs":2637,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","submitted":5692,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6383592017738359,"acs":5758,"articleLive":2,"columnArticles":101,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","submitted":9020,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6348731109210151,"acs":4453,"articleLive":2,"columnArticles":77,"formTitle":"[250]统计同值子树","frequency":0.0,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","submitted":7014,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.543202416918429,"acs":3596,"articleLive":2,"columnArticles":68,"formTitle":"[251]展开二维向量","frequency":0.0,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","submitted":6620,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5631259698123854,"acs":11976,"articleLive":2,"columnArticles":157,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","submitted":21267,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5002506501237585,"acs":31933,"articleLive":2,"columnArticles":343,"formTitle":"[253]会议室 II","frequency":0.0,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","submitted":63834,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5697043516775551,"acs":5145,"articleLive":2,"columnArticles":75,"formTitle":"[254]因子的组合","frequency":0.0,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","submitted":9031,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47364085667215816,"acs":5175,"articleLive":2,"columnArticles":58,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","submitted":10926,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6392245166959578,"acs":11639,"articleLive":2,"columnArticles":183,"formTitle":"[256]粉刷房子","frequency":0.0,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","submitted":18208,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6825632313177479,"acs":142625,"articleLive":2,"columnArticles":1057,"formTitle":"[257]二叉树的所有路径","frequency":0.0,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":208955,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6919592099348664,"acs":78509,"articleLive":2,"columnArticles":652,"formTitle":"[258]各位相加","frequency":0.0,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":113459,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5648585850492749,"acs":7050,"articleLive":2,"columnArticles":84,"formTitle":"[259]较小的三数之和","frequency":0.0,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","submitted":12481,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7230850443141722,"acs":52052,"articleLive":2,"columnArticles":442,"formTitle":"[260]只出现一次的数字 III","frequency":0.0,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":71986,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.4949093036863663,"acs":8458,"articleLive":2,"columnArticles":117,"formTitle":"[261]以图判树","frequency":0.0,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","submitted":17090,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43501805054151627,"acs":38319,"articleLive":2,"columnArticles":370,"formTitle":"[262]行程和用户","frequency":0.0,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":88086,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5151329322349806,"acs":106683,"articleLive":2,"columnArticles":832,"formTitle":"[263]丑数","frequency":0.0,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":207098,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5798378221836085,"acs":100109,"articleLive":2,"columnArticles":613,"formTitle":"[264]丑数 II","frequency":0.0,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":172650,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5877995642701525,"acs":6745,"articleLive":2,"columnArticles":151,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","submitted":11475,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6736916406171222,"acs":6681,"articleLive":2,"columnArticles":103,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","submitted":9917,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.4480493892026796,"acs":3411,"articleLive":2,"columnArticles":77,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","submitted":7613,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6252450859242417,"acs":151792,"articleLive":2,"columnArticles":1095,"formTitle":"[268]丢失的数字","frequency":0.0,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":242772,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3384509137271568,"acs":6371,"articleLive":2,"columnArticles":104,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","submitted":18824,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5529217826284675,"acs":9727,"articleLive":2,"columnArticles":138,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.0,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","submitted":17592,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5531512605042017,"acs":2633,"articleLive":2,"columnArticles":45,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","submitted":4760,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.647125567322239,"acs":3422,"articleLive":2,"columnArticles":75,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","submitted":5288,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.31045569620253166,"acs":12263,"articleLive":2,"columnArticles":161,"formTitle":"[273]整数转换英文表示","frequency":0.0,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"","submitted":39500,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.44003772501742733,"acs":53656,"articleLive":2,"columnArticles":563,"formTitle":"[274]H 指数","frequency":0.0,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":121935,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4621216253067903,"acs":50838,"articleLive":2,"columnArticles":414,"formTitle":"[275]H 指数 II","frequency":0.0,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":110010,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4912048946673156,"acs":7065,"articleLive":2,"columnArticles":128,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","submitted":14383,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5691881918819188,"acs":7404,"articleLive":2,"columnArticles":84,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","submitted":13008,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4536880146635038,"acs":183412,"articleLive":2,"columnArticles":1042,"formTitle":"[278]第一个错误的版本","frequency":0.0,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":404269,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6319254642917178,"acs":203001,"articleLive":2,"columnArticles":1196,"formTitle":"[279]完全平方数","frequency":0.0,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":321242,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6850625459896983,"acs":5586,"articleLive":2,"columnArticles":70,"formTitle":"[280]摆动排序","frequency":0.0,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","submitted":8154,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7577473182359953,"acs":2543,"articleLive":2,"columnArticles":64,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","submitted":3356,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.3911495962600935,"acs":7363,"articleLive":2,"columnArticles":79,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":18824,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.63867999369515,"acs":490291,"articleLive":2,"columnArticles":3375,"formTitle":"[283]移动零","frequency":0.0,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":767663,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7346765039727582,"acs":10356,"articleLive":2,"columnArticles":104,"formTitle":"[284]窥探迭代器","frequency":0.0,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"","submitted":14096,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6346276257161044,"acs":7976,"articleLive":2,"columnArticles":102,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","submitted":12568,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5092961487383798,"acs":11505,"articleLive":2,"columnArticles":149,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","submitted":22590,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.659901544629171,"acs":179092,"articleLive":2,"columnArticles":1220,"formTitle":"[287]寻找重复数","frequency":0.0,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":271392,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.43103876739562624,"acs":3469,"articleLive":2,"columnArticles":54,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","submitted":8048,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7531222440328866,"acs":52946,"articleLive":2,"columnArticles":828,"formTitle":"[289]生命游戏","frequency":0.0,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":70302,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45693339451874543,"acs":82646,"articleLive":2,"columnArticles":1094,"formTitle":"[290]单词规律","frequency":0.0,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":180871,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5316908822910086,"acs":2525,"articleLive":2,"columnArticles":55,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","submitted":4749,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7084743037042993,"acs":114544,"articleLive":2,"columnArticles":765,"formTitle":"[292]Nim 游戏","frequency":0.0,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":161677,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7121519721577726,"acs":4911,"articleLive":2,"columnArticles":83,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","submitted":6896,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5830913197805744,"acs":3614,"articleLive":2,"columnArticles":54,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","submitted":6198,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5230493845323917,"acs":63993,"articleLive":2,"columnArticles":501,"formTitle":"[295]数据流的中位数","frequency":0.0,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":122346,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.619011598587998,"acs":2455,"articleLive":2,"columnArticles":46,"formTitle":"[296]最佳的碰头地点","frequency":0.0,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","submitted":3966,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5598803032884648,"acs":105150,"articleLive":2,"columnArticles":755,"formTitle":"[297]二叉树的序列化与反序列化","frequency":0.0,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":187808,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5770643288709868,"acs":4871,"articleLive":2,"columnArticles":81,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","submitted":8441,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5041907802833766,"acs":30318,"articleLive":2,"columnArticles":358,"formTitle":"[299]猜数字游戏","frequency":0.0,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":60132,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5161081675597049,"acs":362262,"articleLive":2,"columnArticles":2013,"formTitle":"[300]最长递增子序列","frequency":0.0,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":701911,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5230603140330544,"acs":32946,"articleLive":2,"columnArticles":233,"formTitle":"[301]删除无效的括号","frequency":0.0,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":62987,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6556572923479398,"acs":2005,"articleLive":2,"columnArticles":37,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","submitted":3058,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.726090227252313,"acs":129337,"articleLive":2,"columnArticles":794,"formTitle":"[303]区域和检索 - 数组不可变","frequency":0.0,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":178128,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5458715992639118,"acs":63183,"articleLive":2,"columnArticles":560,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":0.0,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":115747,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.38055954088952654,"acs":4244,"articleLive":2,"columnArticles":64,"formTitle":"[305]岛屿数量 II","frequency":0.0,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","submitted":11152,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3372160512358651,"acs":16849,"articleLive":2,"columnArticles":250,"formTitle":"[306]累加数","frequency":0.0,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":49965,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5410069664344522,"acs":23919,"articleLive":2,"columnArticles":231,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.0,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":44212,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6094979647218454,"acs":2246,"articleLive":2,"columnArticles":42,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","submitted":3685,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6077576814120723,"acs":117138,"articleLive":2,"columnArticles":929,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":0.0,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":192738,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3793805463720202,"acs":21803,"articleLive":2,"columnArticles":213,"formTitle":"[310]最小高度树","frequency":0.0,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":57470,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7605359844391615,"acs":3519,"articleLive":2,"columnArticles":44,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.0,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","submitted":4627,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.682803538446583,"acs":56192,"articleLive":2,"columnArticles":377,"formTitle":"[312]戳气球","frequency":0.0,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":82296,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6309684632226208,"acs":40635,"articleLive":2,"columnArticles":355,"formTitle":"[313]超级丑数","frequency":0.0,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":64401,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5456308326263484,"acs":4502,"articleLive":2,"columnArticles":87,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","submitted":8251,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4180986248228185,"acs":50439,"articleLive":2,"columnArticles":480,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":0.0,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":120639,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4764439034401738,"acs":67322,"articleLive":2,"columnArticles":529,"formTitle":"[316]去除重复字母","frequency":0.0,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":141301,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4835102133972384,"acs":4237,"articleLive":2,"columnArticles":64,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","submitted":8763,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6843646766338589,"acs":20095,"articleLive":2,"columnArticles":176,"formTitle":"[318]最大单词长度乘积","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":29363,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5181807922356393,"acs":22958,"articleLive":2,"columnArticles":227,"formTitle":"[319]灯泡开关","frequency":0.0,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":44305,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6761533165021804,"acs":2946,"articleLive":2,"columnArticles":49,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","submitted":4357,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.4243053337591824,"acs":26570,"articleLive":2,"columnArticles":230,"formTitle":"[321]拼接最大数","frequency":0.0,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":62620,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.44473470648485547,"acs":305245,"articleLive":2,"columnArticles":1817,"formTitle":"[322]零钱兑换","frequency":0.0,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":686353,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6315356113627008,"acs":10738,"articleLive":2,"columnArticles":147,"formTitle":"[323]无向图中连通分量的数目","frequency":0.0,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","submitted":17003,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.37823314573105016,"acs":25269,"articleLive":2,"columnArticles":168,"formTitle":"[324]摆动排序 II","frequency":0.0,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":66808,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5378888440006926,"acs":9320,"articleLive":2,"columnArticles":103,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.0,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","submitted":17327,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5044629219845475,"acs":135415,"articleLive":2,"columnArticles":574,"formTitle":"[326]3的幂","frequency":0.0,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":268434,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42138182066749835,"acs":24658,"articleLive":2,"columnArticles":204,"formTitle":"[327]区间和的个数","frequency":0.0,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":58517,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6559045616321876,"acs":128819,"articleLive":2,"columnArticles":1066,"formTitle":"[328]奇偶链表","frequency":0.0,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":196399,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4853240135989688,"acs":56102,"articleLive":2,"columnArticles":490,"formTitle":"[329]矩阵中的最长递增路径","frequency":0.0,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":115597,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5336869427829816,"acs":18916,"articleLive":2,"columnArticles":149,"formTitle":"[330]按要求补齐数组","frequency":0.0,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35444,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4797726762880431,"acs":44912,"articleLive":2,"columnArticles":504,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.0,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":93611,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.44934371271094947,"acs":39540,"articleLive":2,"columnArticles":328,"formTitle":"[332]重新安排行程","frequency":0.0,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":87995,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46826264030992354,"acs":4714,"articleLive":2,"columnArticles":81,"formTitle":"[333]最大 BST 子树","frequency":0.0,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","submitted":10067,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41196880812705683,"acs":46068,"articleLive":2,"columnArticles":302,"formTitle":"[334]递增的三元子序列","frequency":0.0,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":111824,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.36887072808320953,"acs":2979,"articleLive":2,"columnArticles":37,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":8076,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.40125380489926077,"acs":22146,"articleLive":2,"columnArticles":192,"formTitle":"[336]回文对","frequency":0.0,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":55192,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6079031325211292,"acs":130332,"articleLive":2,"columnArticles":924,"formTitle":"[337]打家劫舍 III","frequency":0.0,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":214396,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.786933612251342,"acs":159502,"articleLive":2,"columnArticles":1369,"formTitle":"[338]比特位计数","frequency":0.0,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":202688,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8078764142732812,"acs":3713,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","submitted":4596,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.493951104763505,"acs":11759,"articleLive":2,"columnArticles":176,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","submitted":23806,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7273051873857403,"acs":50923,"articleLive":2,"columnArticles":488,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":0.0,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":70016,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5159454449623054,"acs":87121,"articleLive":2,"columnArticles":765,"formTitle":"[342]4的幂","frequency":0.0,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":168857,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.605717872757508,"acs":110002,"articleLive":2,"columnArticles":1049,"formTitle":"[343]整数拆分","frequency":0.0,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":181606,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7683349380428949,"acs":367878,"articleLive":2,"columnArticles":1936,"formTitle":"[344]反转字符串","frequency":0.0,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":478799,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5390529303390927,"acs":108258,"articleLive":2,"columnArticles":1027,"formTitle":"[345]反转字符串中的元音字母","frequency":0.0,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":200830,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7075050709939148,"acs":12208,"articleLive":2,"columnArticles":135,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","submitted":17255,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6222498553365426,"acs":202164,"articleLive":2,"columnArticles":1484,"formTitle":"[347]前 K 个高频元素","frequency":0.0,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":324892,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.599232863152685,"acs":4843,"articleLive":2,"columnArticles":80,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","submitted":8082,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7388676822828586,"acs":214081,"articleLive":2,"columnArticles":1503,"formTitle":"[349]两个数组的交集","frequency":0.0,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":289742,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5499482201647681,"acs":249060,"articleLive":2,"columnArticles":1398,"formTitle":"[350]两个数组的交集 II","frequency":0.0,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":452879,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5901169203617913,"acs":5350,"articleLive":2,"columnArticles":100,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","submitted":9066,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.5918587410702251,"acs":4391,"articleLive":2,"columnArticles":84,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"","submitted":7419,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.425390625,"acs":2178,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":0.0,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","submitted":5120,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.45323857631031195,"acs":69898,"articleLive":2,"columnArticles":539,"formTitle":"[354]俄罗斯套娃信封问题","frequency":0.0,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":154219,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.40657989765969543,"acs":26459,"articleLive":2,"columnArticles":436,"formTitle":"[355]设计推特","frequency":0.0,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":65077,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35296722763507526,"acs":1594,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","submitted":4516,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5203291486443717,"acs":24661,"articleLive":2,"columnArticles":387,"formTitle":"[357]计算各个位数不同的数字个数","frequency":0.0,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":47395,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35187981877434227,"acs":4427,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","submitted":12581,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7259608081421844,"acs":4779,"articleLive":2,"columnArticles":56,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","submitted":6583,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6086393088552916,"acs":2818,"articleLive":2,"columnArticles":61,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","submitted":4630,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5646305589202284,"acs":3263,"articleLive":2,"columnArticles":64,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","submitted":5779,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6910242872228088,"acs":3272,"articleLive":2,"columnArticles":62,"formTitle":"[362]敲击计数器","frequency":0.0,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","submitted":4735,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.4900181758588838,"acs":32891,"articleLive":2,"columnArticles":214,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":67122,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7211155378486056,"acs":1810,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","submitted":2510,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3651560097871511,"acs":33728,"articleLive":2,"columnArticles":482,"formTitle":"[365]水壶问题","frequency":0.0,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":92366,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7658730158730159,"acs":4246,"articleLive":2,"columnArticles":120,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","submitted":5544,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.43906093336979307,"acs":77071,"articleLive":2,"columnArticles":610,"formTitle":"[367]有效的完全平方数","frequency":0.0,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":175536,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.45925925925925926,"acs":41664,"articleLive":2,"columnArticles":451,"formTitle":"[368]最大整除子集","frequency":0.0,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":90720,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6168455821635013,"acs":4482,"articleLive":2,"columnArticles":130,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","submitted":7266,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7216821162107168,"acs":3192,"articleLive":2,"columnArticles":48,"formTitle":"[370]区间加法","frequency":0.0,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","submitted":4423,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6131069366363484,"acs":80485,"articleLive":2,"columnArticles":504,"formTitle":"[371]两整数之和","frequency":0.0,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":131274,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.51034332583291,"acs":14062,"articleLive":2,"columnArticles":135,"formTitle":"[372]超级次方","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":27554,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.41795277532315406,"acs":20338,"articleLive":2,"columnArticles":207,"formTitle":"[373]查找和最小的K对数字","frequency":0.0,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":48661,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5151675232904296,"acs":82892,"articleLive":2,"columnArticles":564,"formTitle":"[374]猜数字大小","frequency":0.0,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":160903,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.468517024366629,"acs":14517,"articleLive":2,"columnArticles":121,"formTitle":"[375]猜数字大小 II","frequency":0.0,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":30985,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4638114128024442,"acs":75297,"articleLive":2,"columnArticles":808,"formTitle":"[376]摆动序列","frequency":0.0,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":162344,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5086590679464511,"acs":64441,"articleLive":2,"columnArticles":550,"formTitle":"[377]组合总和 Ⅳ","frequency":0.0,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":126688,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6389365626754351,"acs":79669,"articleLive":2,"columnArticles":564,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":0.0,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":124690,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6392340598899979,"acs":3138,"articleLive":2,"columnArticles":68,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","submitted":4909,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5026871568428086,"acs":34608,"articleLive":2,"columnArticles":216,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":0.0,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":68846,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44156959691611497,"acs":21077,"articleLive":2,"columnArticles":176,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":47732,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6308097747963584,"acs":15798,"articleLive":2,"columnArticles":125,"formTitle":"[382]链表随机节点","frequency":0.0,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":25044,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6003223417693949,"acs":68908,"articleLive":2,"columnArticles":757,"formTitle":"[383]赎金信","frequency":0.0,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":114785,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5783850237496507,"acs":51751,"articleLive":2,"columnArticles":200,"formTitle":"[384]打乱数组","frequency":0.0,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":89475,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41709829813876714,"acs":7328,"articleLive":2,"columnArticles":84,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17569,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7498568782623337,"acs":22267,"articleLive":2,"columnArticles":240,"formTitle":"[386]字典序排数","frequency":0.0,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":29695,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5335631790943082,"acs":221616,"articleLive":2,"columnArticles":1200,"formTitle":"[387]字符串中的第一个唯一字符","frequency":0.0,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":415351,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5264955767714812,"acs":6011,"articleLive":2,"columnArticles":110,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":11417,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6918798358895283,"acs":100508,"articleLive":2,"columnArticles":984,"formTitle":"[389]找不同","frequency":0.0,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":145268,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46708776595744683,"acs":7025,"articleLive":2,"columnArticles":94,"formTitle":"[390]消除游戏","frequency":0.0,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":15040,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.35762567011110247,"acs":4603,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":12871,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.515202013809785,"acs":146542,"articleLive":2,"columnArticles":1575,"formTitle":"[392]判断子序列","frequency":0.0,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":284436,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.39158163265306123,"acs":11052,"articleLive":2,"columnArticles":127,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":28224,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5525070181973454,"acs":121630,"articleLive":2,"columnArticles":1296,"formTitle":"[394]字符串解码","frequency":0.0,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":220142,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5203742496877896,"acs":51669,"articleLive":2,"columnArticles":428,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":0.0,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":99292,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.42816755406869905,"acs":9087,"articleLive":2,"columnArticles":146,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":21223,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.3775447857858592,"acs":15448,"articleLive":2,"columnArticles":192,"formTitle":"[397]整数替换","frequency":0.0,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":40917,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6569746211429615,"acs":14393,"articleLive":2,"columnArticles":121,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":21908,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5925282976261044,"acs":41983,"articleLive":2,"columnArticles":528,"formTitle":"[399]除法求值","frequency":0.0,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":70854,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.41546134663341644,"acs":19159,"articleLive":2,"columnArticles":196,"formTitle":"[400]第 N 位数字","frequency":0.0,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":46115,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6136986614281146,"acs":53733,"articleLive":2,"columnArticles":655,"formTitle":"[401]二进制手表","frequency":0.0,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":87556,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3269763948933406,"acs":80549,"articleLive":2,"columnArticles":586,"formTitle":"[402]移掉 K 位数字","frequency":0.0,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":246345,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45560722073422083,"acs":45758,"articleLive":2,"columnArticles":459,"formTitle":"[403]青蛙过河","frequency":0.0,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":100433,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5835655245578651,"acs":100113,"articleLive":2,"columnArticles":1123,"formTitle":"[404]左叶子之和","frequency":0.0,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":171554,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.7374382716049382,"acs":119465,"articleLive":2,"columnArticles":791,"formTitle":"[406]根据身高重建队列","frequency":0.0,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":162000,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.4842867896123447,"acs":10294,"articleLive":2,"columnArticles":130,"formTitle":"[407]接雨水 II","frequency":0.0,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":21256,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.32363535605430865,"acs":3504,"articleLive":2,"columnArticles":82,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","submitted":10827,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5558190150938722,"acs":94233,"articleLive":2,"columnArticles":1320,"formTitle":"[409]最长回文串","frequency":0.0,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":169539,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5641354836848331,"acs":39107,"articleLive":2,"columnArticles":317,"formTitle":"[410]分割数组的最大值","frequency":0.0,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":69322,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.4971655328798186,"acs":877,"articleLive":2,"columnArticles":21,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","submitted":1764,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6743052125070896,"acs":73711,"articleLive":2,"columnArticles":373,"formTitle":"[412]Fizz Buzz","frequency":0.0,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":109314,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6877872619829284,"acs":71230,"articleLive":2,"columnArticles":924,"formTitle":"[413]等差数列划分","frequency":0.0,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":103564,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.3636470796251547,"acs":61700,"articleLive":2,"columnArticles":851,"formTitle":"[414]第三大的数","frequency":0.0,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":169670,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5380648010076297,"acs":148663,"articleLive":2,"columnArticles":1074,"formTitle":"[415]字符串相加","frequency":0.0,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":276292,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5073155764650877,"acs":173611,"articleLive":2,"columnArticles":982,"formTitle":"[416]分割等和子集","frequency":0.0,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":342215,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.479944504934846,"acs":27329,"articleLive":2,"columnArticles":318,"formTitle":"[417]太平洋大西洋水流问题","frequency":0.0,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":56942,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3626707132018209,"acs":2151,"articleLive":2,"columnArticles":33,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","submitted":5931,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7559157816284703,"acs":12171,"articleLive":2,"columnArticles":157,"formTitle":"[419]甲板上的战舰","frequency":0.0,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":16101,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20762583383869013,"acs":2739,"articleLive":2,"columnArticles":52,"formTitle":"[420]强密码检验器","frequency":0.0,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13192,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6221996692226733,"acs":33106,"articleLive":2,"columnArticles":305,"formTitle":"[421]数组中两个数的最大异或值","frequency":0.0,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":53208,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.42684766214177977,"acs":1981,"articleLive":2,"columnArticles":48,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","submitted":4641,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5706919945725916,"acs":8412,"articleLive":2,"columnArticles":137,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14740,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5308367768595041,"acs":51385,"articleLive":2,"columnArticles":448,"formTitle":"[424]替换后的最长重复字符","frequency":0.0,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":96800,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6143261837312829,"acs":1518,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","submitted":2471,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6685580121306985,"acs":6834,"articleLive":2,"columnArticles":113,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":0.0,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","submitted":10222,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6129080339842004,"acs":4112,"articleLive":2,"columnArticles":67,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6709,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.651030032266071,"acs":2623,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","submitted":4029,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6993083973484576,"acs":58444,"articleLive":2,"columnArticles":470,"formTitle":"[429]N 叉树的层序遍历","frequency":0.0,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":83574,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5875392417290509,"acs":43794,"articleLive":2,"columnArticles":671,"formTitle":"[430]扁平化多级双向链表","frequency":0.0,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":74538,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7289879931389366,"acs":850,"articleLive":2,"columnArticles":29,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","submitted":1166,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.3779577303009419,"acs":6581,"articleLive":2,"columnArticles":85,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.0,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17412,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5321676905420915,"acs":15766,"articleLive":2,"columnArticles":211,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":29626,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.37405638576490524,"acs":38848,"articleLive":2,"columnArticles":533,"formTitle":"[434]字符串中的单词数","frequency":0.0,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"","submitted":103856,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5080922901392381,"acs":96190,"articleLive":2,"columnArticles":840,"formTitle":"[435]无重叠区间","frequency":0.0,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":189316,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.487657091561939,"acs":8692,"articleLive":2,"columnArticles":141,"formTitle":"[436]寻找右区间","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":17824,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5743286244524242,"acs":123634,"articleLive":2,"columnArticles":1023,"formTitle":"[437]路径总和 III","frequency":0.0,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":215267,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.518170003454686,"acs":94494,"articleLive":2,"columnArticles":827,"formTitle":"[438]找到字符串中所有字母异位词","frequency":0.0,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":182361,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5899324739103745,"acs":2883,"articleLive":2,"columnArticles":68,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","submitted":4887,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.3799708515511139,"acs":16425,"articleLive":2,"columnArticles":122,"formTitle":"[440]字典序的第K小数字","frequency":0.0,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":43227,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4255459960291198,"acs":46939,"articleLive":2,"columnArticles":476,"formTitle":"[441]排列硬币","frequency":0.0,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":110303,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6978760434460308,"acs":43306,"articleLive":2,"columnArticles":435,"formTitle":"[442]数组中重复的数据","frequency":0.0,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":62054,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.47703060035880385,"acs":56105,"articleLive":2,"columnArticles":692,"formTitle":"[443]压缩字符串","frequency":0.0,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":117613,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2518070511874908,"acs":3414,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":0.0,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","submitted":13558,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5886982629208664,"acs":82353,"articleLive":2,"columnArticles":931,"formTitle":"[445]两数相加 II","frequency":0.0,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":139890,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5515659057015028,"acs":19232,"articleLive":2,"columnArticles":171,"formTitle":"[446]等差数列划分 II - 子序列","frequency":0.0,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":34868,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6630458426233075,"acs":48771,"articleLive":2,"columnArticles":376,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":73556,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6484921421492283,"acs":137409,"articleLive":2,"columnArticles":1078,"formTitle":"[448]找到所有数组中消失的数字","frequency":0.0,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":211890,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5564240529339053,"acs":15305,"articleLive":2,"columnArticles":136,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":27506,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.48579506552715734,"acs":60310,"articleLive":2,"columnArticles":615,"formTitle":"[450]删除二叉搜索树中的节点","frequency":0.0,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":124147,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7114367861293903,"acs":81409,"articleLive":2,"columnArticles":949,"formTitle":"[451]根据字符出现频率排序","frequency":0.0,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":114429,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5088508835111221,"acs":96787,"articleLive":2,"columnArticles":841,"formTitle":"[452]用最少数量的箭引爆气球","frequency":0.0,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":190207,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.555528440404287,"acs":27317,"articleLive":2,"columnArticles":304,"formTitle":"[453]最小操作次数使数组元素相等","frequency":0.0,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":49173,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6024975101509231,"acs":78644,"articleLive":2,"columnArticles":491,"formTitle":"[454]四数相加 II","frequency":0.0,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":130530,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5769087424129485,"acs":151697,"articleLive":2,"columnArticles":1237,"formTitle":"[455]分发饼干","frequency":0.0,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":262948,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.36237661593326115,"acs":56904,"articleLive":2,"columnArticles":458,"formTitle":"[456]132 模式","frequency":0.0,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":157030,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43593557886428147,"acs":28719,"articleLive":2,"columnArticles":332,"formTitle":"[457]环形数组是否存在循环","frequency":0.0,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":65879,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6107534681294768,"acs":6736,"articleLive":2,"columnArticles":63,"formTitle":"[458]可怜的小猪","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":11029,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5114732119837054,"acs":79352,"articleLive":2,"columnArticles":639,"formTitle":"[459]重复的子字符串","frequency":0.0,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":155144,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4379356273680671,"acs":33866,"articleLive":2,"columnArticles":403,"formTitle":"[460]LFU 缓存","frequency":0.0,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":77331,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8120942764816999,"acs":169385,"articleLive":2,"columnArticles":1350,"formTitle":"[461]汉明距离","frequency":0.0,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":208578,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6043946611733402,"acs":14083,"articleLive":2,"columnArticles":128,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":0.0,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":23301,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7088176609493126,"acs":77444,"articleLive":2,"columnArticles":928,"formTitle":"[463]岛屿的周长","frequency":0.0,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":109258,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3570239467281342,"acs":11152,"articleLive":2,"columnArticles":111,"formTitle":"[464]我能赢吗","frequency":0.0,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":31236,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5308848080133556,"acs":1590,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","submitted":2995,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.3739706639217705,"acs":11626,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31088,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44190292640868284,"acs":8713,"articleLive":2,"columnArticles":112,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.0,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":19717,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.2510396479328165,"acs":24871,"articleLive":2,"columnArticles":297,"formTitle":"[468]验证IP地址","frequency":0.0,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":99072,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4351010840902432,"acs":1485,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.0,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","submitted":3413,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5467388399975865,"acs":63431,"articleLive":2,"columnArticles":334,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":0.0,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":116017,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6175182481751825,"acs":1269,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":0.0,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","submitted":2055,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.39990270007297496,"acs":6576,"articleLive":2,"columnArticles":81,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":16444,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4202685859032608,"acs":20905,"articleLive":2,"columnArticles":179,"formTitle":"[473]火柴拼正方形","frequency":0.0,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":49742,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6116470109800732,"acs":75202,"articleLive":2,"columnArticles":596,"formTitle":"[474]一和零","frequency":0.0,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":122950,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33356658580580956,"acs":21451,"articleLive":2,"columnArticles":238,"formTitle":"[475]供暖器","frequency":0.0,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":64308,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.701397005621417,"acs":37806,"articleLive":2,"columnArticles":482,"formTitle":"[476]数字的补数","frequency":0.0,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":53901,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6037225778385433,"acs":38858,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":0.0,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":64364,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43791757623867167,"acs":6620,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":0.0,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":15117,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.41762609649122806,"acs":3047,"articleLive":2,"columnArticles":25,"formTitle":"[479]最大回文数乘积","frequency":0.0,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","submitted":7296,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.44826434233303974,"acs":29520,"articleLive":2,"columnArticles":404,"formTitle":"[480]滑动窗口中位数","frequency":0.0,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":65854,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.538996138996139,"acs":5584,"articleLive":2,"columnArticles":95,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10360,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.42727830622890456,"acs":19495,"articleLive":2,"columnArticles":226,"formTitle":"[482]密钥格式化","frequency":0.0,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"","submitted":45626,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5905827541434354,"acs":15465,"articleLive":2,"columnArticles":117,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":26186,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6342208642514185,"acs":1453,"articleLive":2,"columnArticles":34,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","submitted":2291,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6067987404229996,"acs":122364,"articleLive":2,"columnArticles":989,"formTitle":"[485]最大连续 1 的个数","frequency":0.0,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":201655,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5863664013788209,"acs":46269,"articleLive":2,"columnArticles":401,"formTitle":"[486]预测赢家","frequency":0.0,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":78908,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5776497928665252,"acs":5717,"articleLive":2,"columnArticles":110,"formTitle":"[487]最大连续1的个数 II","frequency":0.0,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","submitted":9897,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3881973771949322,"acs":3493,"articleLive":2,"columnArticles":73,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":8998,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7188340807174888,"acs":1603,"articleLive":2,"columnArticles":24,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","submitted":2230,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.48251798561151077,"acs":6707,"articleLive":2,"columnArticles":78,"formTitle":"[490]迷宫","frequency":0.0,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","submitted":13900,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5466779488130564,"acs":47163,"articleLive":2,"columnArticles":396,"formTitle":"[491]递增子序列","frequency":0.0,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":86272,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5521246458923513,"acs":19490,"articleLive":2,"columnArticles":178,"formTitle":"[492]构造矩形","frequency":0.0,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":35300,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3455523354481606,"acs":26470,"articleLive":2,"columnArticles":267,"formTitle":"[493]翻转对","frequency":0.0,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":76602,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4938757178570131,"acs":149551,"articleLive":2,"columnArticles":1038,"formTitle":"[494]目标和","frequency":0.0,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":302811,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.542281238058846,"acs":28383,"articleLive":2,"columnArticles":432,"formTitle":"[495]提莫攻击","frequency":0.0,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":52340,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6875332493821508,"acs":102098,"articleLive":2,"columnArticles":1046,"formTitle":"[496]下一个更大元素 I","frequency":0.0,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":148499,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4049869845184272,"acs":2956,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7299,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4675098030766579,"acs":43398,"articleLive":2,"columnArticles":453,"formTitle":"[498]对角线遍历","frequency":0.0,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":92828,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3710798921526891,"acs":2615,"articleLive":2,"columnArticles":48,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","submitted":7047,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7090129749768304,"acs":30601,"articleLive":2,"columnArticles":469,"formTitle":"[500]键盘行","frequency":0.0,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":43160,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5125594238825172,"acs":65338,"articleLive":2,"columnArticles":538,"formTitle":"[501]二叉搜索树中的众数","frequency":0.0,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":127474,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.44055500136029746,"acs":29148,"articleLive":2,"columnArticles":356,"formTitle":"[502]IPO","frequency":0.0,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":66162,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6353447369885201,"acs":102774,"articleLive":2,"columnArticles":967,"formTitle":"[503]下一个更大元素 II","frequency":0.0,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":161761,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5044176309629776,"acs":30601,"articleLive":2,"columnArticles":318,"formTitle":"[504]七进制数","frequency":0.0,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":60666,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.48266920217823495,"acs":5584,"articleLive":2,"columnArticles":66,"formTitle":"[505]迷宫 II","frequency":0.0,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","submitted":11569,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5638692370407385,"acs":21440,"articleLive":2,"columnArticles":283,"formTitle":"[506]相对名次","frequency":0.0,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":38023,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4126496689674602,"acs":29294,"articleLive":2,"columnArticles":230,"formTitle":"[507]完美数","frequency":0.0,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":70990,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6766000834221625,"acs":14599,"articleLive":2,"columnArticles":206,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.0,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":21577,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.674887079685496,"acs":242055,"articleLive":2,"columnArticles":1473,"formTitle":"[509]斐波那契数","frequency":0.0,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":358660,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6083208395802099,"acs":3246,"articleLive":2,"columnArticles":54,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","submitted":5336,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.733233636259059,"acs":19122,"articleLive":2,"columnArticles":106,"formTitle":"[511]游戏玩法分析 I","frequency":0.0,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","submitted":26079,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5379306223669664,"acs":18004,"articleLive":2,"columnArticles":148,"formTitle":"[512]游戏玩法分析 II","frequency":0.0,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","submitted":33469,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7309083019959502,"acs":50535,"articleLive":2,"columnArticles":564,"formTitle":"[513]找树左下角的值","frequency":0.0,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":69140,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5006520238308317,"acs":19580,"articleLive":2,"columnArticles":240,"formTitle":"[514]自由之路","frequency":0.0,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":39109,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6441775579889321,"acs":38297,"articleLive":2,"columnArticles":418,"formTitle":"[515]在每个树行中找最大值","frequency":0.0,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":59451,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.653491345846463,"acs":85857,"articleLive":2,"columnArticles":613,"formTitle":"[516]最长回文子序列","frequency":0.0,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":131382,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5110680760644449,"acs":19001,"articleLive":2,"columnArticles":165,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":37179,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6565536278084141,"acs":107510,"articleLive":2,"columnArticles":681,"formTitle":"[518]零钱兑换 II","frequency":0.0,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":163749,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.3977624024731341,"acs":2702,"articleLive":2,"columnArticles":39,"formTitle":"[519]随机翻转矩阵","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6793,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5639786385604982,"acs":40025,"articleLive":2,"columnArticles":642,"formTitle":"[520]检测大写字母","frequency":0.0,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":70969,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7130566801619433,"acs":25362,"articleLive":2,"columnArticles":252,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.0,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":35568,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3608806636885769,"acs":6786,"articleLive":2,"columnArticles":106,"formTitle":"[522]最长特殊序列 II","frequency":0.0,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":18804,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2746151049096351,"acs":68726,"articleLive":2,"columnArticles":603,"formTitle":"[523]连续的子数组和","frequency":0.0,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":250263,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4947449354358168,"acs":72069,"articleLive":2,"columnArticles":754,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":0.0,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":145669,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5357028193633542,"acs":45051,"articleLive":2,"columnArticles":516,"formTitle":"[525]连续数组","frequency":0.0,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":84097,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7349373544738884,"acs":33142,"articleLive":2,"columnArticles":380,"formTitle":"[526]优美的排列","frequency":0.0,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":45095,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5779843160034853,"acs":1990,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","submitted":3443,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.47669652345529073,"acs":31400,"articleLive":2,"columnArticles":258,"formTitle":"[528]按权重随机选择","frequency":0.0,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":65870,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6449344942631622,"acs":39628,"articleLive":2,"columnArticles":462,"formTitle":"[529]扫雷游戏","frequency":0.0,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":61445,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6208422204425978,"acs":78300,"articleLive":2,"columnArticles":637,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.0,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":126119,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.659292806131336,"acs":3785,"articleLive":2,"columnArticles":76,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","submitted":5741,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37448772002240766,"acs":25403,"articleLive":2,"columnArticles":278,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":67834,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.524605982631071,"acs":1631,"articleLive":2,"columnArticles":33,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","submitted":3109,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6747763525346713,"acs":14256,"articleLive":2,"columnArticles":138,"formTitle":"[534]游戏玩法分析 III","frequency":0.0,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","submitted":21127,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8417701198630136,"acs":15731,"articleLive":2,"columnArticles":101,"formTitle":"[535]TinyURL 的加密与解密","frequency":0.0,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18688,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.537184243066596,"acs":3041,"articleLive":2,"columnArticles":50,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","submitted":5661,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7121841045049444,"acs":11667,"articleLive":2,"columnArticles":173,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16382,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7000109332492974,"acs":108844,"articleLive":2,"columnArticles":837,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":155489,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.597211563059606,"acs":14007,"articleLive":2,"columnArticles":184,"formTitle":"[539]最小时间差","frequency":0.0,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":23454,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5818638654699018,"acs":38442,"articleLive":2,"columnArticles":405,"formTitle":"[540]有序数组中的单一元素","frequency":0.0,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":66067,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6076855234975431,"acs":72348,"articleLive":2,"columnArticles":802,"formTitle":"[541]反转字符串 II","frequency":0.0,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":119055,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4581601229156551,"acs":68883,"articleLive":2,"columnArticles":642,"formTitle":"[542]01 矩阵","frequency":0.0,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":150347,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5519036073219937,"acs":149094,"articleLive":2,"columnArticles":1236,"formTitle":"[543]二叉树的直径","frequency":0.0,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":270145,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7102977667493796,"acs":2290,"articleLive":2,"columnArticles":52,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","submitted":3224,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.41826629172270446,"acs":3421,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","submitted":8179,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6288474406155905,"acs":15037,"articleLive":2,"columnArticles":120,"formTitle":"[546]移除盒子","frequency":0.0,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":23912,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6184633674231456,"acs":162312,"articleLive":2,"columnArticles":1135,"formTitle":"[547]省份数量","frequency":0.0,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":262444,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3544809228039042,"acs":1598,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"lock","submitted":4508,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.480396575033799,"acs":2132,"articleLive":2,"columnArticles":52,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","submitted":4438,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4379704488430443,"acs":12568,"articleLive":2,"columnArticles":178,"formTitle":"[550]游戏玩法分析 IV","frequency":0.0,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","submitted":28696,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5676346703763815,"acs":58757,"articleLive":2,"columnArticles":755,"formTitle":"[551]学生出勤记录 I","frequency":0.0,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":103512,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5776920294224044,"acs":23954,"articleLive":2,"columnArticles":287,"formTitle":"[552]学生出勤记录 II","frequency":0.0,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":41465,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6042884990253411,"acs":5890,"articleLive":2,"columnArticles":86,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9747,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5028837086905988,"acs":45864,"articleLive":2,"columnArticles":488,"formTitle":"[554]砖墙","frequency":0.0,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":91202,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3423507462686567,"acs":1101,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","submitted":3216,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.3257723195311277,"acs":14563,"articleLive":2,"columnArticles":214,"formTitle":"[556]下一个更大元素 III","frequency":0.0,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":44703,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7458752449833435,"acs":160983,"articleLive":2,"columnArticles":1315,"formTitle":"[557]反转字符串中的单词 III","frequency":0.0,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":215831,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5043432939541348,"acs":2903,"articleLive":2,"columnArticles":37,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5756,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7281010115503265,"acs":60894,"articleLive":2,"columnArticles":550,"formTitle":"[559]N 叉树的最大深度","frequency":0.0,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":83634,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.44666773813350474,"acs":150075,"articleLive":2,"columnArticles":923,"formTitle":"[560]和为 K 的子数组","frequency":0.0,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":335988,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7746215386737474,"acs":89853,"articleLive":2,"columnArticles":746,"formTitle":"[561]数组拆分 I","frequency":0.0,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":115996,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.46522579087177013,"acs":3853,"articleLive":2,"columnArticles":59,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","submitted":8282,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6059385819659793,"acs":32202,"articleLive":2,"columnArticles":321,"formTitle":"[563]二叉树的坡度","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":53144,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17930448159993523,"acs":4429,"articleLive":2,"columnArticles":76,"formTitle":"[564]寻找最近的回文数","frequency":0.0,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":24701,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6107512119782058,"acs":14236,"articleLive":2,"columnArticles":139,"formTitle":"[565]数组嵌套","frequency":0.0,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":23309,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.69032859894078,"acs":68823,"articleLive":2,"columnArticles":642,"formTitle":"[566]重塑矩阵","frequency":0.0,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":99696,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4315010895476549,"acs":118019,"articleLive":2,"columnArticles":1073,"formTitle":"[567]字符串的排列","frequency":0.0,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":273508,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5066495066495067,"acs":1181,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","submitted":2331,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5638414810529361,"acs":9746,"articleLive":2,"columnArticles":154,"formTitle":"[569]员工薪水中位数","frequency":0.0,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","submitted":17285,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6613641089623622,"acs":12722,"articleLive":2,"columnArticles":111,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.0,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","submitted":19236,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4887114337568058,"acs":6732,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.0,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","submitted":13775,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47323666359269717,"acs":83646,"articleLive":2,"columnArticles":732,"formTitle":"[572]另一棵树的子树","frequency":0.0,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":176753,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6629798308392973,"acs":1019,"articleLive":2,"columnArticles":31,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","submitted":1537,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6482266570158205,"acs":12538,"articleLive":2,"columnArticles":113,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","submitted":19342,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6845620135515006,"acs":42130,"articleLive":2,"columnArticles":430,"formTitle":"[575]分糖果","frequency":0.0,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":61543,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4686412736579412,"acs":25727,"articleLive":2,"columnArticles":279,"formTitle":"[576]出界的路径数","frequency":0.0,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":54897,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7035726084289018,"acs":14908,"articleLive":2,"columnArticles":84,"formTitle":"[577]员工奖金","frequency":0.0,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","submitted":21189,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.49558236986923815,"acs":9816,"articleLive":2,"columnArticles":113,"formTitle":"[578]查询回答率最高的问题","frequency":0.0,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","submitted":19807,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.40990533240626836,"acs":7664,"articleLive":2,"columnArticles":132,"formTitle":"[579]查询员工的累计薪水","frequency":0.0,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","submitted":18697,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5228445099484156,"acs":9933,"articleLive":2,"columnArticles":81,"formTitle":"[580]统计各专业学生人数","frequency":0.0,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","submitted":18998,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.4049069193629038,"acs":98790,"articleLive":2,"columnArticles":855,"formTitle":"[581]最短无序连续子数组","frequency":0.0,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":243982,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.40768545019471686,"acs":8689,"articleLive":2,"columnArticles":134,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","submitted":21313,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6178461158453749,"acs":50027,"articleLive":2,"columnArticles":488,"formTitle":"[583]两个字符串的删除操作","frequency":0.0,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":80970,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7742265696087353,"acs":13614,"articleLive":2,"columnArticles":61,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","submitted":17584,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5960146226076983,"acs":8315,"articleLive":2,"columnArticles":99,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","submitted":13951,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7473656890734492,"acs":14398,"articleLive":2,"columnArticles":88,"formTitle":"[586]订单最多的客户","frequency":0.0,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","submitted":19265,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.38390928725701945,"acs":2133,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5556,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.4257309941520468,"acs":1456,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":0.0,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","submitted":3420,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7455983238146734,"acs":88252,"articleLive":2,"columnArticles":563,"formTitle":"[589]N 叉树的前序遍历","frequency":0.0,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":118364,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.760799970786216,"acs":62502,"articleLive":2,"columnArticles":457,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":82153,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3418111753371869,"acs":1774,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5190,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5218207414359456,"acs":4448,"articleLive":2,"columnArticles":110,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8524,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44134226760263773,"acs":8299,"articleLive":2,"columnArticles":134,"formTitle":"[593]有效的正方形","frequency":0.0,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":18804,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.517758470586145,"acs":29141,"articleLive":2,"columnArticles":269,"formTitle":"[594]最长和谐子序列","frequency":0.0,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":56283,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.796702786377709,"acs":102934,"articleLive":2,"columnArticles":237,"formTitle":"[595]大的国家","frequency":0.0,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":129200,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4210507188062987,"acs":81099,"articleLive":2,"columnArticles":283,"formTitle":"[596]超过5名学生的课","frequency":0.0,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":192611,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.44162809810112896,"acs":10210,"articleLive":2,"columnArticles":80,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.0,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","submitted":23119,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5179518498280351,"acs":16114,"articleLive":2,"columnArticles":210,"formTitle":"[598]范围求和 II","frequency":0.0,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":31111,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5221880094185836,"acs":28830,"articleLive":2,"columnArticles":272,"formTitle":"[599]两个列表的最小索引总和","frequency":0.0,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":55210,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.48156762705082035,"acs":19255,"articleLive":2,"columnArticles":230,"formTitle":"[600]不含连续1的非负整数","frequency":0.0,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":39984,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.49962640891531407,"acs":31428,"articleLive":2,"columnArticles":372,"formTitle":"[601]体育馆的人流量","frequency":0.0,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":62903,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6287617554858934,"acs":8023,"articleLive":2,"columnArticles":88,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.0,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","submitted":12760,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6706945409827301,"acs":12544,"articleLive":2,"columnArticles":108,"formTitle":"[603]连续空余座位","frequency":0.0,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","submitted":18703,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37340507302075326,"acs":2429,"articleLive":2,"columnArticles":56,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","submitted":6505,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33355497608403223,"acs":108856,"articleLive":2,"columnArticles":1255,"formTitle":"[605]种花问题","frequency":0.0,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":326351,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5693600465274853,"acs":28390,"articleLive":2,"columnArticles":311,"formTitle":"[606]根据二叉树创建字符串","frequency":0.0,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":49863,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6613642640154653,"acs":11974,"articleLive":2,"columnArticles":84,"formTitle":"[607]销售员","frequency":0.0,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","submitted":18105,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6559149158748148,"acs":7524,"articleLive":2,"columnArticles":101,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","submitted":11471,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4859091590466197,"acs":6483,"articleLive":2,"columnArticles":101,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13342,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6670957775489187,"acs":10364,"articleLive":2,"columnArticles":72,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","submitted":15536,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5318776829720706,"acs":50180,"articleLive":2,"columnArticles":390,"formTitle":"[611]有效三角形的个数","frequency":0.0,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":94345,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6676133760879523,"acs":7287,"articleLive":2,"columnArticles":63,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","submitted":10915,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8168464376951462,"acs":11511,"articleLive":2,"columnArticles":81,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","submitted":14092,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3457157649495211,"acs":8013,"articleLive":2,"columnArticles":68,"formTitle":"[614]二级关注者","frequency":0.0,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","submitted":23178,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42539065662699377,"acs":5254,"articleLive":2,"columnArticles":91,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","submitted":12351,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46141709695926564,"acs":3217,"articleLive":2,"columnArticles":55,"formTitle":"[616]给字符串添加加粗标签","frequency":0.0,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","submitted":6972,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.787914945822287,"acs":187534,"articleLive":2,"columnArticles":1242,"formTitle":"[617]合并二叉树","frequency":0.0,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":238013,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6188929489782109,"acs":4573,"articleLive":2,"columnArticles":45,"formTitle":"[618]学生地理信息报告","frequency":0.0,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","submitted":7389,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4657005232123578,"acs":11215,"articleLive":2,"columnArticles":79,"formTitle":"[619]只出现一次的最大数字","frequency":0.0,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","submitted":24082,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7734631872476797,"acs":92920,"articleLive":2,"columnArticles":309,"formTitle":"[620]有趣的电影","frequency":0.0,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":120135,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5706794747510355,"acs":77706,"articleLive":2,"columnArticles":497,"formTitle":"[621]任务调度器","frequency":0.0,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":136164,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4365395752245761,"acs":64827,"articleLive":2,"columnArticles":417,"formTitle":"[622]设计循环队列","frequency":0.0,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":148502,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5459033561063182,"acs":10947,"articleLive":2,"columnArticles":187,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":20053,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.41862707288854606,"acs":2171,"articleLive":2,"columnArticles":49,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","submitted":5186,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3426191451590878,"acs":2509,"articleLive":2,"columnArticles":54,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","submitted":7323,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6840532670023661,"acs":45101,"articleLive":2,"columnArticles":349,"formTitle":"[626]换座位","frequency":0.0,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":65932,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8081161182460673,"acs":85072,"articleLive":2,"columnArticles":336,"formTitle":"[627]变更性别","frequency":0.0,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":105272,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5248890496071534,"acs":79833,"articleLive":2,"columnArticles":757,"formTitle":"[628]三个数的最大乘积","frequency":0.0,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":152095,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.4065466772151899,"acs":4111,"articleLive":2,"columnArticles":57,"formTitle":"[629]K个逆序对数组","frequency":0.0,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":10112,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.36743591234087075,"acs":6321,"articleLive":2,"columnArticles":75,"formTitle":"[630]课程表 III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":17203,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28766390152528765,"acs":1075,"articleLive":2,"columnArticles":35,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","submitted":3737,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5976303166989613,"acs":18814,"articleLive":2,"columnArticles":239,"formTitle":"[632]最小区间","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":31481,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.3982251661252999,"acs":93788,"articleLive":2,"columnArticles":764,"formTitle":"[633]平方数之和","frequency":0.0,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":235515,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.44076598506978254,"acs":1358,"articleLive":2,"columnArticles":21,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","submitted":3081,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5534626038781163,"acs":3996,"articleLive":2,"columnArticles":67,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","submitted":7220,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5504187415119963,"acs":9727,"articleLive":2,"columnArticles":112,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":17672,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6897270554227584,"acs":74445,"articleLive":2,"columnArticles":647,"formTitle":"[637]二叉树的层平均值","frequency":0.0,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":107934,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.593624876501482,"acs":11416,"articleLive":2,"columnArticles":119,"formTitle":"[638]大礼包","frequency":0.0,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":19231,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.37686785128794587,"acs":20000,"articleLive":2,"columnArticles":271,"formTitle":"[639]解码方法 II","frequency":0.0,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":53069,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4250137481341818,"acs":10820,"articleLive":2,"columnArticles":211,"formTitle":"[640]求解方程","frequency":0.0,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25458,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5324509926332875,"acs":21322,"articleLive":2,"columnArticles":239,"formTitle":"[641]设计循环双端队列","frequency":0.0,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":40045,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.48851732473811443,"acs":2425,"articleLive":2,"columnArticles":55,"formTitle":"[642]设计搜索自动补全系统","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","submitted":4964,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4507465016604695,"acs":63521,"articleLive":2,"columnArticles":573,"formTitle":"[643]子数组最大平均数 I","frequency":0.0,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":140924,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.3990095507605235,"acs":1128,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","submitted":2827,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4344038123520715,"acs":68459,"articleLive":2,"columnArticles":695,"formTitle":"[645]错误的集合","frequency":0.0,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":157593,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5772228449287073,"acs":22144,"articleLive":2,"columnArticles":196,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":38363,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.656823954799853,"acs":123343,"articleLive":2,"columnArticles":912,"formTitle":"[647]回文子串","frequency":0.0,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":187787,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5844391329432127,"acs":21273,"articleLive":2,"columnArticles":277,"formTitle":"[648]单词替换","frequency":0.0,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":36399,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.48186322435249473,"acs":29079,"articleLive":2,"columnArticles":308,"formTitle":"[649]Dota2 参议院","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":60347,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5669173802360564,"acs":48993,"articleLive":2,"columnArticles":651,"formTitle":"[650]只有两个键的键盘","frequency":0.0,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":86420,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.582568093385214,"acs":3743,"articleLive":2,"columnArticles":63,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","submitted":6425,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5714412118638069,"acs":32291,"articleLive":2,"columnArticles":233,"formTitle":"[652]寻找重复的子树","frequency":0.0,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":56508,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.597150656137329,"acs":40909,"articleLive":2,"columnArticles":385,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":68507,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8099283031751451,"acs":59307,"articleLive":2,"columnArticles":600,"formTitle":"[654]最大二叉树","frequency":0.0,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":73225,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.598235256776487,"acs":9424,"articleLive":2,"columnArticles":138,"formTitle":"[655]输出二叉树","frequency":0.0,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15753,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.30791896869244934,"acs":836,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","submitted":2715,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7833932945499081,"acs":81874,"articleLive":2,"columnArticles":622,"formTitle":"[657]机器人能否返回原点","frequency":0.0,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":104512,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.454177344951307,"acs":26583,"articleLive":2,"columnArticles":241,"formTitle":"[658]找到 K 个最接近的元素","frequency":0.0,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":58530,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5419288214033008,"acs":28338,"articleLive":2,"columnArticles":261,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":52291,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6530805687203791,"acs":689,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":0.0,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","submitted":1055,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5606844002993401,"acs":16483,"articleLive":2,"columnArticles":213,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":29398,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4084781735788447,"acs":28484,"articleLive":2,"columnArticles":270,"formTitle":"[662]二叉树最大宽度","frequency":0.0,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":69732,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.46368861024033436,"acs":1775,"articleLive":2,"columnArticles":35,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","submitted":3828,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6542773036781541,"acs":22004,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33631,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2706813225032787,"acs":74714,"articleLive":2,"columnArticles":933,"formTitle":"[665]非递减数列","frequency":0.0,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":276022,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.617500731635938,"acs":2110,"articleLive":2,"columnArticles":76,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","submitted":3417,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.624022521113544,"acs":7980,"articleLive":2,"columnArticles":118,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12788,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5081291676032067,"acs":6782,"articleLive":2,"columnArticles":66,"formTitle":"[668]乘法表中第k小的数","frequency":0.0,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":13347,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6660073205900839,"acs":36027,"articleLive":2,"columnArticles":304,"formTitle":"[669]修剪二叉搜索树","frequency":0.0,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":54094,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.45115610398945727,"acs":18829,"articleLive":2,"columnArticles":282,"formTitle":"[670]最大交换","frequency":0.0,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":41735,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.4863241857026822,"acs":53288,"articleLive":2,"columnArticles":665,"formTitle":"[671]二叉树中第二小的节点","frequency":0.0,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":109573,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5492407156818524,"acs":3653,"articleLive":2,"columnArticles":42,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.0,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6651,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.43451226047267955,"acs":47029,"articleLive":2,"columnArticles":411,"formTitle":"[673]最长递增子序列的个数","frequency":0.0,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":108234,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4959499580473742,"acs":92209,"articleLive":2,"columnArticles":760,"formTitle":"[674]最长连续递增序列","frequency":0.0,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":185924,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.4007230255839822,"acs":2882,"articleLive":2,"columnArticles":48,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7192,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5871315898713159,"acs":7072,"articleLive":2,"columnArticles":127,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":12045,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6169734321645707,"acs":14816,"articleLive":2,"columnArticles":248,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":24014,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.38550794329272636,"acs":43291,"articleLive":2,"columnArticles":476,"formTitle":"[678]有效的括号字符串","frequency":0.0,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":112296,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5410258559275867,"acs":25821,"articleLive":2,"columnArticles":260,"formTitle":"[679]24 点游戏","frequency":0.0,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":47726,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4016692579110536,"acs":86289,"articleLive":2,"columnArticles":818,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":0.0,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":214826,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5028436948421259,"acs":2564,"articleLive":2,"columnArticles":62,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","submitted":5099,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6952181564415316,"acs":45826,"articleLive":2,"columnArticles":509,"formTitle":"[682]棒球比赛","frequency":0.0,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":65916,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4334518167456556,"acs":2195,"articleLive":2,"columnArticles":50,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","submitted":5064,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6656043147830351,"acs":59730,"articleLive":2,"columnArticles":602,"formTitle":"[684]冗余连接","frequency":0.0,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":89738,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4312684747664358,"acs":19988,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":46347,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.35576149099089804,"acs":17237,"articleLive":2,"columnArticles":194,"formTitle":"[686]重复叠加字符串匹配","frequency":0.0,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":48451,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.44087105671835525,"acs":38041,"articleLive":2,"columnArticles":268,"formTitle":"[687]最长同值路径","frequency":0.0,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":86286,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.510695357895409,"acs":7998,"articleLive":2,"columnArticles":106,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.0,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15661,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.4854368932038835,"acs":3250,"articleLive":2,"columnArticles":69,"formTitle":"[689]三个无重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6695,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6476993081673399,"acs":55798,"articleLive":2,"columnArticles":565,"formTitle":"[690]员工的重要性","frequency":0.0,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":86148,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.49041511515653013,"acs":3556,"articleLive":2,"columnArticles":47,"formTitle":"[691]贴纸拼词","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7251,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5780621291686558,"acs":67809,"articleLive":2,"columnArticles":735,"formTitle":"[692]前K个高频单词","frequency":0.0,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":117304,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6095291795883846,"acs":25944,"articleLive":2,"columnArticles":282,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":42564,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5338814480838086,"acs":4026,"articleLive":2,"columnArticles":77,"formTitle":"[694]不同岛屿的数量","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","submitted":7541,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6644412776108306,"acs":128685,"articleLive":2,"columnArticles":1276,"formTitle":"[695]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":193674,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6315258358662614,"acs":51943,"articleLive":2,"columnArticles":474,"formTitle":"[696]计数二进制子串","frequency":0.0,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":82250,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6051176475946692,"acs":66428,"articleLive":2,"columnArticles":850,"formTitle":"[697]数组的度","frequency":0.0,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":109777,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44647999879374556,"acs":29611,"articleLive":2,"columnArticles":217,"formTitle":"[698]划分为k个相等的子集","frequency":0.0,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":66321,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47701348081576217,"acs":2760,"articleLive":2,"columnArticles":41,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5786,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7598528737353412,"acs":81188,"articleLive":2,"columnArticles":514,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.0,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":106847,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7234344441461824,"acs":75460,"articleLive":2,"columnArticles":559,"formTitle":"[701]二叉搜索树中的插入操作","frequency":0.0,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":104308,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7413047240006921,"acs":4284,"articleLive":2,"columnArticles":76,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","submitted":5779,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5125913266396069,"acs":59986,"articleLive":2,"columnArticles":545,"formTitle":"[703]数据流中的第 K 大元素","frequency":0.0,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":117025,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5566123347845304,"acs":284597,"articleLive":2,"columnArticles":1413,"formTitle":"[704]二分查找","frequency":0.0,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":511302,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6455015191686181,"acs":66710,"articleLive":2,"columnArticles":432,"formTitle":"[705]设计哈希集合","frequency":0.0,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":103346,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6437985276677631,"acs":57544,"articleLive":2,"columnArticles":388,"formTitle":"[706]设计哈希映射","frequency":0.0,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":89382,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.32072859782072094,"acs":63019,"articleLive":2,"columnArticles":436,"formTitle":"[707]设计链表","frequency":0.0,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":196487,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.33776758409785934,"acs":2209,"articleLive":2,"columnArticles":51,"formTitle":"[708]循环有序列表的插入","frequency":0.0,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","submitted":6540,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7588666938442723,"acs":70737,"articleLive":2,"columnArticles":509,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":93214,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3519085527658706,"acs":5172,"articleLive":2,"columnArticles":64,"formTitle":"[710]黑名单中的随机数","frequency":0.0,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":14697,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5578446909667195,"acs":704,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","submitted":1262,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6718673163753409,"acs":15029,"articleLive":2,"columnArticles":168,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.0,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":22369,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.41232227488151657,"acs":23142,"articleLive":2,"columnArticles":213,"formTitle":"[713]乘积小于K的子数组","frequency":0.0,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":56126,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7210552311223453,"acs":99272,"articleLive":2,"columnArticles":663,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":0.0,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":137676,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.40470139771283353,"acs":2548,"articleLive":2,"columnArticles":41,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6296,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4619971936389149,"acs":3951,"articleLive":2,"columnArticles":72,"formTitle":"[716]最大栈","frequency":0.0,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","submitted":8552,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.511294399792585,"acs":31553,"articleLive":2,"columnArticles":381,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":61712,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5643030139935414,"acs":83878,"articleLive":2,"columnArticles":581,"formTitle":"[718]最长重复子数组","frequency":0.0,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":148640,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3701502532122379,"acs":8844,"articleLive":2,"columnArticles":85,"formTitle":"[719]找出第 k 小的距离对","frequency":0.0,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":23893,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4851578972305797,"acs":20479,"articleLive":2,"columnArticles":272,"formTitle":"[720]词典中最长的单词","frequency":0.0,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":42211,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4693126089577529,"acs":28805,"articleLive":2,"columnArticles":336,"formTitle":"[721]账户合并","frequency":0.0,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":61377,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3218516610867886,"acs":4999,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":0.0,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15532,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7206703910614525,"acs":1290,"articleLive":2,"columnArticles":41,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","submitted":1790,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4616829729784326,"acs":137130,"articleLive":2,"columnArticles":857,"formTitle":"[724]寻找数组的中心下标","frequency":0.0,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":297022,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6085602041837654,"acs":48641,"articleLive":2,"columnArticles":624,"formTitle":"[725]分隔链表","frequency":0.0,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":79928,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5525767961411526,"acs":21766,"articleLive":2,"columnArticles":395,"formTitle":"[726]原子的数量","frequency":0.0,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39390,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4089425124201561,"acs":2881,"articleLive":2,"columnArticles":49,"formTitle":"[727]最小窗口子序列","frequency":0.0,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","submitted":7045,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7602146192528736,"acs":33863,"articleLive":2,"columnArticles":309,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":44544,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.512193588937775,"acs":8149,"articleLive":2,"columnArticles":92,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":15910,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.49003134796238246,"acs":3908,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":0.0,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":7975,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5077489837398373,"acs":3997,"articleLive":2,"columnArticles":41,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":7872,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6097073259407381,"acs":3354,"articleLive":2,"columnArticles":52,"formTitle":"[732]我的日程安排表 III","frequency":0.0,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5501,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5805708696425396,"acs":65291,"articleLive":2,"columnArticles":555,"formTitle":"[733]图像渲染","frequency":0.0,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":112460,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.48226111636707664,"acs":2039,"articleLive":2,"columnArticles":37,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","submitted":4228,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.40524809908285647,"acs":20679,"articleLive":2,"columnArticles":262,"formTitle":"[735]行星碰撞","frequency":0.0,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":51028,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.46213476446034585,"acs":1550,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3354,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4607241669674005,"acs":3830,"articleLive":2,"columnArticles":65,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","submitted":8313,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5017679084847373,"acs":41012,"articleLive":2,"columnArticles":584,"formTitle":"[738]单调递增的数字","frequency":0.0,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":81735,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6796432902995422,"acs":211261,"articleLive":2,"columnArticles":1506,"formTitle":"[739]每日温度","frequency":0.0,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":310841,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6294544544544545,"acs":50306,"articleLive":2,"columnArticles":584,"formTitle":"[740]删除并获得点数","frequency":0.0,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":79920,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3664136271060915,"acs":3958,"articleLive":2,"columnArticles":46,"formTitle":"[741]摘樱桃","frequency":0.0,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10802,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4946376340591485,"acs":1522,"articleLive":2,"columnArticles":44,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","submitted":3077,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5198417423000485,"acs":56761,"articleLive":2,"columnArticles":518,"formTitle":"[743]网络延迟时间","frequency":0.0,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":109189,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4590381202686614,"acs":40870,"articleLive":2,"columnArticles":364,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.0,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":89034,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.39201974496092146,"acs":2859,"articleLive":2,"columnArticles":55,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7293,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5870153648435128,"acs":133374,"articleLive":2,"columnArticles":1283,"formTitle":"[746]使用最小花费爬楼梯","frequency":0.0,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":227207,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.41607133018677345,"acs":45311,"articleLive":2,"columnArticles":403,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":108902,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6015179348351543,"acs":12443,"articleLive":2,"columnArticles":175,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":20686,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5049019607843137,"acs":1339,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2652,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7217550274223035,"acs":1974,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.0,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","submitted":2735,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5028901734104047,"acs":1392,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","submitted":2768,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5302479667643436,"acs":69305,"articleLive":2,"columnArticles":587,"formTitle":"[752]打开转盘锁","frequency":0.0,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":130703,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5906400295967443,"acs":3193,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.0,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5406,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.43061400669040684,"acs":7981,"articleLive":2,"columnArticles":94,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18534,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.4992272024729521,"acs":1292,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","submitted":2588,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5655839325564096,"acs":4562,"articleLive":2,"columnArticles":68,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8066,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.41745894554883317,"acs":2415,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5785,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.46072467601163714,"acs":3484,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","submitted":7562,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.658458244111349,"acs":1845,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","submitted":2802,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8393505661183508,"acs":3929,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","submitted":4681,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5904600620942704,"acs":2092,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3543,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.6999014389907353,"acs":17753,"articleLive":2,"columnArticles":140,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":25365,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7629956195597,"acs":81169,"articleLive":2,"columnArticles":972,"formTitle":"[763]划分字母区间","frequency":0.0,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":106382,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.49400451145672564,"acs":4161,"articleLive":2,"columnArticles":53,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8423,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6649632192863854,"acs":29017,"articleLive":2,"columnArticles":440,"formTitle":"[765]情侣牵手","frequency":0.0,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":43637,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7080014972958321,"acs":54851,"articleLive":2,"columnArticles":632,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":77473,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.4777376366724885,"acs":39936,"articleLive":2,"columnArticles":496,"formTitle":"[767]重构字符串","frequency":0.0,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":83594,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5055198233656523,"acs":5266,"articleLive":2,"columnArticles":79,"formTitle":"[768]最多能完成排序的块 II","frequency":0.0,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10417,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5867097325796798,"acs":12352,"articleLive":2,"columnArticles":145,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":21053,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5536881419234361,"acs":1186,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2142,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8513683013440515,"acs":152721,"articleLive":2,"columnArticles":1112,"formTitle":"[771]宝石与石头","frequency":0.0,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":179383,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.49277468313554534,"acs":6104,"articleLive":2,"columnArticles":124,"formTitle":"[772]基本计算器 III","frequency":0.0,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","submitted":12387,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7134784878543132,"acs":23233,"articleLive":2,"columnArticles":329,"formTitle":"[773]滑动谜题","frequency":0.0,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":32563,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5896047644829453,"acs":1089,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","submitted":1847,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4602495219014662,"acs":5054,"articleLive":2,"columnArticles":80,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":10981,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5682989690721649,"acs":1764,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","submitted":3104,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.32353624535315983,"acs":5570,"articleLive":2,"columnArticles":61,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.0,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17216,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5942786132738201,"acs":23433,"articleLive":2,"columnArticles":346,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":39431,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4363791631084543,"acs":18907,"articleLive":2,"columnArticles":233,"formTitle":"[779]第K个语法符号","frequency":0.0,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43327,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.28696575524289886,"acs":3243,"articleLive":2,"columnArticles":50,"formTitle":"[780]到达终点","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11301,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6174130776935184,"acs":43151,"articleLive":2,"columnArticles":658,"formTitle":"[781]森林中的兔子","frequency":0.0,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":69890,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42771084337349397,"acs":1491,"articleLive":2,"columnArticles":30,"formTitle":"[782]变为棋盘","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3486,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5958211156266612,"acs":69493,"articleLive":2,"columnArticles":668,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.0,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":116634,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6867610429737996,"acs":43564,"articleLive":2,"columnArticles":478,"formTitle":"[784]字母大小写全排列","frequency":0.0,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":63434,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5119346813803661,"acs":40128,"articleLive":2,"columnArticles":403,"formTitle":"[785]判断二分图","frequency":0.0,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":78385,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.47078613883593134,"acs":4198,"articleLive":2,"columnArticles":58,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":8917,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3909901699108131,"acs":42042,"articleLive":2,"columnArticles":396,"formTitle":"[787]K 站中转内最便宜的航班","frequency":0.0,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":107527,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6077506596306068,"acs":18427,"articleLive":2,"columnArticles":191,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30320,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6921140661742788,"acs":20897,"articleLive":2,"columnArticles":294,"formTitle":"[789]逃脱阻碍者","frequency":0.0,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30193,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.44975575715282623,"acs":3867,"articleLive":2,"columnArticles":65,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8598,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6950920245398773,"acs":11330,"articleLive":2,"columnArticles":201,"formTitle":"[791]自定义字符串排序","frequency":0.0,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16300,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.46413306555435396,"acs":9013,"articleLive":2,"columnArticles":98,"formTitle":"[792]匹配子序列的单词数","frequency":0.0,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":19419,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.39458903567755715,"acs":4988,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":12641,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3410617652547117,"acs":7311,"articleLive":2,"columnArticles":102,"formTitle":"[794]有效的井字游戏","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21436,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.533992334073028,"acs":7941,"articleLive":2,"columnArticles":87,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":14871,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5296791262465234,"acs":23424,"articleLive":2,"columnArticles":275,"formTitle":"[796]旋转字符串","frequency":0.0,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":44223,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.794014019211512,"acs":42818,"articleLive":2,"columnArticles":530,"formTitle":"[797]所有可能的路径","frequency":0.0,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":53926,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4623692203847452,"acs":1370,"articleLive":2,"columnArticles":34,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2963,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4091156145663483,"acs":5269,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":0.0,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":12879,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7062007874015748,"acs":1435,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","submitted":2032,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.41918635018281003,"acs":7223,"articleLive":2,"columnArticles":87,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17231,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5766193318749768,"acs":31104,"articleLive":2,"columnArticles":333,"formTitle":"[802]找到最终的安全状态","frequency":0.0,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":53942,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4819139284446373,"acs":12217,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25351,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7712184301669456,"acs":39636,"articleLive":2,"columnArticles":397,"formTitle":"[804]唯一摩尔斯密码词","frequency":0.0,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":51394,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2908949761561495,"acs":2623,"articleLive":2,"columnArticles":41,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9017,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6572876186728319,"acs":13362,"articleLive":2,"columnArticles":150,"formTitle":"[806]写字符串需要的行数","frequency":0.0,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":20329,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8448841500922698,"acs":16482,"articleLive":2,"columnArticles":216,"formTitle":"[807]保持城市天际线","frequency":0.0,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":19508,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.48120879120879123,"acs":4379,"articleLive":2,"columnArticles":41,"formTitle":"[808]分汤","frequency":0.0,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9100,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4182634213706197,"acs":4846,"articleLive":2,"columnArticles":90,"formTitle":"[809]情感丰富的文字","frequency":0.0,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11586,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7338673984243604,"acs":16581,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":0.0,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22594,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7045916294189354,"acs":15606,"articleLive":2,"columnArticles":199,"formTitle":"[811]子域名访问计数","frequency":0.0,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22149,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6303850887990153,"acs":10755,"articleLive":2,"columnArticles":100,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":17061,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5501115360101976,"acs":6905,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":12552,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6999045948358108,"acs":22742,"articleLive":2,"columnArticles":350,"formTitle":"[814]二叉树剪枝","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":32493,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.43375713121434395,"acs":26611,"articleLive":2,"columnArticles":315,"formTitle":"[815]公交路线","frequency":0.0,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":61350,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5099841976727482,"acs":3550,"articleLive":2,"columnArticles":63,"formTitle":"[816]模糊坐标","frequency":0.0,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":6961,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5911003945637878,"acs":13483,"articleLive":2,"columnArticles":166,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22810,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.43166924818300967,"acs":3623,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8393,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.4211972294238285,"acs":21770,"articleLive":2,"columnArticles":246,"formTitle":"[819]最常见的单词","frequency":0.0,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":51686,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5073808753524056,"acs":54891,"articleLive":2,"columnArticles":602,"formTitle":"[820]单词的压缩编码","frequency":0.0,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":108185,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.69300420694843,"acs":24874,"articleLive":2,"columnArticles":336,"formTitle":"[821]字符的最短距离","frequency":0.0,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":35893,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5034458384873652,"acs":2849,"articleLive":2,"columnArticles":39,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5659,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4294213892607467,"acs":2887,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":0.0,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6723,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.615062454077884,"acs":16742,"articleLive":2,"columnArticles":239,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":27220,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.39121601434120107,"acs":6547,"articleLive":2,"columnArticles":90,"formTitle":"[825]适龄的朋友","frequency":0.0,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":16735,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3740454278441355,"acs":7641,"articleLive":2,"columnArticles":112,"formTitle":"[826]安排工作以达到最大收益","frequency":0.0,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":20428,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.39053460350602465,"acs":8978,"articleLive":2,"columnArticles":181,"formTitle":"[827]最大人工岛","frequency":0.0,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":22989,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4919653893695921,"acs":3184,"articleLive":2,"columnArticles":53,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6472,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3653731850216524,"acs":8606,"articleLive":2,"columnArticles":100,"formTitle":"[829]连续整数求和","frequency":0.0,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":23554,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5432571973148177,"acs":51874,"articleLive":2,"columnArticles":582,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":95487,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.40523656906947686,"acs":7460,"articleLive":2,"columnArticles":73,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18409,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7957827012653755,"acs":85592,"articleLive":2,"columnArticles":916,"formTitle":"[832]翻转图像","frequency":0.0,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":107557,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4295194892473118,"acs":5113,"articleLive":2,"columnArticles":77,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":11904,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5283488850229322,"acs":13363,"articleLive":2,"columnArticles":132,"formTitle":"[834]树中距离之和","frequency":0.0,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25292,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5737441393168118,"acs":4283,"articleLive":2,"columnArticles":48,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7465,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4789738366541473,"acs":37621,"articleLive":2,"columnArticles":657,"formTitle":"[836]矩形重叠","frequency":0.0,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":78545,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39623143881208395,"acs":19346,"articleLive":2,"columnArticles":244,"formTitle":"[837]新21点","frequency":0.0,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":48825,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.500634338877925,"acs":7103,"articleLive":2,"columnArticles":123,"formTitle":"[838]推多米诺","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":14188,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5746358492837366,"acs":19094,"articleLive":2,"columnArticles":268,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33228,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.35943501920614596,"acs":8983,"articleLive":2,"columnArticles":113,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":24992,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6576743743457988,"acs":55292,"articleLive":2,"columnArticles":541,"formTitle":"[841]钥匙和房间","frequency":0.0,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":84072,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48825700096565045,"acs":28315,"articleLive":2,"columnArticles":320,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":0.0,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":57992,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3803588549513765,"acs":2777,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7301,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5134177156635423,"acs":88792,"articleLive":2,"columnArticles":979,"formTitle":"[844]比较含退格的字符串","frequency":0.0,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":172943,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4212148035272104,"acs":37593,"articleLive":2,"columnArticles":553,"formTitle":"[845]数组中的最长山脉","frequency":0.0,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":89249,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5106672182495124,"acs":8641,"articleLive":2,"columnArticles":119,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":16921,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6818813039029382,"acs":18659,"articleLive":2,"columnArticles":158,"formTitle":"[847]访问所有节点的最短路径","frequency":0.0,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27364,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44887045181927226,"acs":8981,"articleLive":2,"columnArticles":95,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":20008,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42645482799271245,"acs":15917,"articleLive":2,"columnArticles":185,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":37324,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4488436632747456,"acs":2426,"articleLive":2,"columnArticles":42,"formTitle":"[850]矩形面积 II","frequency":0.0,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5405,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4802119742924794,"acs":4259,"articleLive":2,"columnArticles":71,"formTitle":"[851]喧闹和富有","frequency":0.0,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":8869,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7146803338603023,"acs":84085,"articleLive":2,"columnArticles":725,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":117654,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3832672332389046,"acs":10147,"articleLive":2,"columnArticles":123,"formTitle":"[853]车队","frequency":0.0,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":26475,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.35977829252150895,"acs":4349,"articleLive":2,"columnArticles":67,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12088,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4073021613708775,"acs":4730,"articleLive":2,"columnArticles":56,"formTitle":"[855]考场就座","frequency":0.0,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":11613,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6267329020332717,"acs":16275,"articleLive":2,"columnArticles":218,"formTitle":"[856]括号的分数","frequency":0.0,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":25968,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.4667598633115875,"acs":3005,"articleLive":2,"columnArticles":47,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.0,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6438,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5541537267080745,"acs":2855,"articleLive":2,"columnArticles":49,"formTitle":"[858]镜面反射","frequency":0.0,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5152,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3021277982338949,"acs":27816,"articleLive":2,"columnArticles":362,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":92067,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5876333493671053,"acs":89181,"articleLive":2,"columnArticles":766,"formTitle":"[860]柠檬水找零","frequency":0.0,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":151763,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8085599505562423,"acs":31398,"articleLive":2,"columnArticles":439,"formTitle":"[861]翻转矩阵后的得分","frequency":0.0,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":38832,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.19154979795578797,"acs":16117,"articleLive":2,"columnArticles":128,"formTitle":"[862]和至少为 K 的最短子数组","frequency":0.0,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":84140,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6038454906018279,"acs":35017,"articleLive":2,"columnArticles":561,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":0.0,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":57990,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45509525249470817,"acs":3010,"articleLive":2,"columnArticles":44,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6614,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6570548095971824,"acs":8955,"articleLive":2,"columnArticles":127,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13629,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22444197434433863,"acs":7471,"articleLive":2,"columnArticles":84,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":33287,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6702828299014502,"acs":83658,"articleLive":2,"columnArticles":751,"formTitle":"[867]转置矩阵","frequency":0.0,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":124810,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6243814492308872,"acs":16277,"articleLive":2,"columnArticles":234,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":26069,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5512974737927478,"acs":6416,"articleLive":2,"columnArticles":95,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.0,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11638,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.42899933114258293,"acs":14752,"articleLive":2,"columnArticles":188,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":34387,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.34137028147501636,"acs":9387,"articleLive":2,"columnArticles":125,"formTitle":"[871]最低加油次数","frequency":0.0,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":27498,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6519418786798465,"acs":60347,"articleLive":2,"columnArticles":721,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":92565,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5105403850708896,"acs":15088,"articleLive":2,"columnArticles":112,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":0.0,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":29553,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41465243025305426,"acs":20466,"articleLive":2,"columnArticles":227,"formTitle":"[874]模拟行走机器人","frequency":0.0,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":49357,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.47879343837686167,"acs":44365,"articleLive":2,"columnArticles":351,"formTitle":"[875]爱吃香蕉的珂珂","frequency":0.0,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":92660,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7060836895727011,"acs":149975,"articleLive":2,"columnArticles":1625,"formTitle":"[876]链表的中间结点","frequency":0.0,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":212404,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7571474784432273,"acs":67876,"articleLive":2,"columnArticles":480,"formTitle":"[877]石子游戏","frequency":0.0,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":89647,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.28059950041631976,"acs":4381,"articleLive":2,"columnArticles":62,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15613,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5544667097608275,"acs":21444,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":0.0,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":38675,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2525012718331355,"acs":5956,"articleLive":2,"columnArticles":77,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23588,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5378154157282714,"acs":46805,"articleLive":2,"columnArticles":572,"formTitle":"[881]救生艇","frequency":0.0,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":87028,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4862538183837823,"acs":1751,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3601,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6887171955813804,"acs":10786,"articleLive":2,"columnArticles":109,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15661,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6617506486412672,"acs":19384,"articleLive":2,"columnArticles":251,"formTitle":"[884]两句话中的不常见单词","frequency":0.0,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":29292,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6910483628717332,"acs":4601,"articleLive":2,"columnArticles":71,"formTitle":"[885]螺旋矩阵 III","frequency":0.0,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6658,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4240148214911622,"acs":8468,"articleLive":2,"columnArticles":113,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":19971,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.29153848349076794,"acs":51079,"articleLive":2,"columnArticles":335,"formTitle":"[887]鸡蛋掉落","frequency":0.0,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":175205,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6403654582964928,"acs":54319,"articleLive":2,"columnArticles":455,"formTitle":"[888]公平的糖果棒交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":84825,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6759238818490882,"acs":15309,"articleLive":2,"columnArticles":147,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":0.0,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":22649,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.726167837949566,"acs":8783,"articleLive":2,"columnArticles":121,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12095,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3304621115120475,"acs":2839,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8591,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6386419065542603,"acs":33256,"articleLive":2,"columnArticles":681,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":52073,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7247335042504386,"acs":10742,"articleLive":2,"columnArticles":104,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14822,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7746754401565001,"acs":13068,"articleLive":2,"columnArticles":122,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":16869,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.544891640866873,"acs":7040,"articleLive":2,"columnArticles":82,"formTitle":"[895]最大频率栈","frequency":0.0,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":12920,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5865475720489538,"acs":59429,"articleLive":2,"columnArticles":716,"formTitle":"[896]单调数列","frequency":0.0,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":101320,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7444345610154822,"acs":61931,"articleLive":2,"columnArticles":706,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":83192,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.337546374897818,"acs":5368,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":0.0,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15903,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5375789609385071,"acs":4170,"articleLive":2,"columnArticles":46,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7757,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4923416789396171,"acs":3343,"articleLive":2,"columnArticles":46,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6790,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5450072358900144,"acs":18830,"articleLive":2,"columnArticles":230,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":34550,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.3291252485089463,"acs":3311,"articleLive":2,"columnArticles":77,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10060,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.530096381160211,"acs":2915,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.0,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5499,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4530458001448226,"acs":20021,"articleLive":2,"columnArticles":274,"formTitle":"[904]水果成篮","frequency":0.0,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":44192,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7005907561194102,"acs":57873,"articleLive":2,"columnArticles":599,"formTitle":"[905]按奇偶排序数组","frequency":0.0,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":82606,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.27669593992618047,"acs":2174,"articleLive":2,"columnArticles":38,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7857,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3167033711672031,"acs":11217,"articleLive":2,"columnArticles":128,"formTitle":"[907]子数组的最小值之和","frequency":0.0,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":35418,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.698503639795093,"acs":20726,"articleLive":2,"columnArticles":190,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":29672,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.459214330253387,"acs":16202,"articleLive":2,"columnArticles":192,"formTitle":"[909]蛇梯棋","frequency":0.0,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35282,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.319012488548146,"acs":6616,"articleLive":2,"columnArticles":69,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20739,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4248378481495612,"acs":4454,"articleLive":2,"columnArticles":68,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":10484,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.560894909424274,"acs":226988,"articleLive":2,"columnArticles":1046,"formTitle":"[912]排序数组","frequency":0.0,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":404689,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.4039820166987797,"acs":1887,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4671,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3888204777831624,"acs":48942,"articleLive":2,"columnArticles":615,"formTitle":"[914]卡牌分组","frequency":0.0,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":125873,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4686748195669607,"acs":9351,"articleLive":2,"columnArticles":114,"formTitle":"[915]分割数组","frequency":0.0,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":19952,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44103560769070593,"acs":6354,"articleLive":2,"columnArticles":75,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14407,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5699293210537588,"acs":29271,"articleLive":2,"columnArticles":435,"formTitle":"[917]仅仅反转字母","frequency":0.0,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":51359,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3571061355457463,"acs":20144,"articleLive":2,"columnArticles":222,"formTitle":"[918]环形子数组的最大和","frequency":0.0,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":56409,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6306037059175135,"acs":5275,"articleLive":2,"columnArticles":95,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8365,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.4831899921813917,"acs":1854,"articleLive":2,"columnArticles":20,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3837,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7369463704542238,"acs":20832,"articleLive":2,"columnArticles":307,"formTitle":"[921]使括号有效的最少添加","frequency":0.0,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":28268,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7140539121719972,"acs":89773,"articleLive":2,"columnArticles":825,"formTitle":"[922]按奇偶排序数组 II","frequency":0.0,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":125723,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.33861483175432866,"acs":6219,"articleLive":2,"columnArticles":82,"formTitle":"[923]三数之和的多种可能","frequency":0.0,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18366,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35920036870607214,"acs":6235,"articleLive":2,"columnArticles":94,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":17358,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.38749180643917486,"acs":50248,"articleLive":2,"columnArticles":673,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":129675,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5214680900802618,"acs":6692,"articleLive":2,"columnArticles":122,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.0,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":12833,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.33931919092254564,"acs":3439,"articleLive":2,"columnArticles":69,"formTitle":"[927]三等分","frequency":0.0,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10135,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4199200152351933,"acs":2205,"articleLive":2,"columnArticles":42,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5251,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6440046331268571,"acs":25576,"articleLive":2,"columnArticles":231,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":39714,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5449206426248605,"acs":33681,"articleLive":2,"columnArticles":339,"formTitle":"[930]和相同的二元子数组","frequency":0.0,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":61809,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.663190722151837,"acs":20415,"articleLive":2,"columnArticles":259,"formTitle":"[931]下降路径最小和","frequency":0.0,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":30783,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6324308197210412,"acs":8479,"articleLive":2,"columnArticles":81,"formTitle":"[932]漂亮数组","frequency":0.0,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13407,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7248376459163649,"acs":35828,"articleLive":2,"columnArticles":310,"formTitle":"[933]最近的请求次数","frequency":0.0,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":49429,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47471727280123666,"acs":23339,"articleLive":2,"columnArticles":262,"formTitle":"[934]最短的桥","frequency":0.0,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":49164,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.475125156445557,"acs":6074,"articleLive":2,"columnArticles":80,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12784,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.3810226155358899,"acs":1550,"articleLive":2,"columnArticles":25,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4068,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5874081018404302,"acs":11905,"articleLive":2,"columnArticles":127,"formTitle":"[937]重新排列日志文件","frequency":0.0,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":20267,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8185714285714286,"acs":96837,"articleLive":2,"columnArticles":800,"formTitle":"[938]二叉搜索树的范围和","frequency":0.0,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":118300,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4526227444397818,"acs":5393,"articleLive":2,"columnArticles":63,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":11915,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.420442035735456,"acs":4965,"articleLive":2,"columnArticles":65,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":11809,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3923681726316056,"acs":61931,"articleLive":2,"columnArticles":614,"formTitle":"[941]有效的山脉数组","frequency":0.0,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":157839,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7301556420233463,"acs":22518,"articleLive":2,"columnArticles":212,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":30840,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4696777467647805,"acs":1851,"articleLive":2,"columnArticles":42,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":3941,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6894161296621754,"acs":21183,"articleLive":2,"columnArticles":181,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30726,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.48611301887310787,"acs":35390,"articleLive":2,"columnArticles":537,"formTitle":"[945]使数组唯一的最小增量","frequency":0.0,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":72802,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6240400359770301,"acs":27059,"articleLive":2,"columnArticles":299,"formTitle":"[946]验证栈序列","frequency":0.0,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":43361,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.612282482940996,"acs":25932,"articleLive":2,"columnArticles":334,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":42353,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3916334431155024,"acs":6778,"articleLive":2,"columnArticles":97,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17307,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.37047403260917855,"acs":8339,"articleLive":2,"columnArticles":119,"formTitle":"[949]给定数字能组成的最大时间","frequency":0.0,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":22509,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7741756499682942,"acs":9767,"articleLive":2,"columnArticles":145,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.0,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12616,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6643196726244208,"acs":11039,"articleLive":2,"columnArticles":167,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":16617,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3507780979827089,"acs":3043,"articleLive":2,"columnArticles":57,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8675,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5527465042669979,"acs":13796,"articleLive":2,"columnArticles":168,"formTitle":"[953]验证外星语词典","frequency":0.0,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":24959,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.3003724155644022,"acs":7017,"articleLive":2,"columnArticles":105,"formTitle":"[954]二倍数对数组","frequency":0.0,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":23361,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.32824742268041235,"acs":3184,"articleLive":2,"columnArticles":49,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9700,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.437125748502994,"acs":4015,"articleLive":2,"columnArticles":51,"formTitle":"[956]最高的广告牌","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9185,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.3602408409021329,"acs":14120,"articleLive":2,"columnArticles":140,"formTitle":"[957]N 天后的牢房","frequency":0.0,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":39196,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5356893085059883,"acs":24511,"articleLive":2,"columnArticles":224,"formTitle":"[958]二叉树的完全性检验","frequency":0.0,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":45756,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7433289049155437,"acs":19583,"articleLive":2,"columnArticles":304,"formTitle":"[959]由斜杠划分区域","frequency":0.0,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26345,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.554057848918843,"acs":1973,"articleLive":2,"columnArticles":33,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3561,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6765130483064964,"acs":36552,"articleLive":2,"columnArticles":302,"formTitle":"[961]重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":54030,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4423975348729333,"acs":13352,"articleLive":2,"columnArticles":129,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":30181,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5029005801160232,"acs":2514,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":4999,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.43027059173357124,"acs":1447,"articleLive":2,"columnArticles":27,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3363,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6832464538638865,"acs":32899,"articleLive":2,"columnArticles":389,"formTitle":"[965]单值二叉树","frequency":0.0,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":48151,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.4033214709371293,"acs":3060,"articleLive":2,"columnArticles":50,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7587,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.46308724832214765,"acs":7659,"articleLive":2,"columnArticles":152,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16539,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.49850380575582914,"acs":24822,"articleLive":2,"columnArticles":326,"formTitle":"[968]监控二叉树","frequency":0.0,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":49793,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6526388113539743,"acs":15198,"articleLive":2,"columnArticles":195,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":23287,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4142932489451477,"acs":10997,"articleLive":2,"columnArticles":127,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26544,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.439870340356564,"acs":6785,"articleLive":2,"columnArticles":107,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15425,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4103879448541199,"acs":1280,"articleLive":2,"columnArticles":28,"formTitle":"[972]相等的有理数","frequency":0.0,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3119,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6407141156867413,"acs":67291,"articleLive":2,"columnArticles":635,"formTitle":"[973]最接近原点的 K 个点","frequency":0.0,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":105025,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4659252958394836,"acs":37247,"articleLive":2,"columnArticles":384,"formTitle":"[974]和可被 K 整除的子数组","frequency":0.0,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":79942,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4465217391304348,"acs":3081,"articleLive":2,"columnArticles":47,"formTitle":"[975]奇偶跳","frequency":0.0,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6900,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5972850173593668,"acs":53503,"articleLive":2,"columnArticles":500,"formTitle":"[976]三角形的最大周长","frequency":0.0,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":89577,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7108247118937985,"acs":168882,"articleLive":2,"columnArticles":1322,"formTitle":"[977]有序数组的平方","frequency":0.0,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":237586,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4735912208504801,"acs":43156,"articleLive":2,"columnArticles":600,"formTitle":"[978]最长湍流子数组","frequency":0.0,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":91125,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7117696867061812,"acs":8406,"articleLive":2,"columnArticles":133,"formTitle":"[979]在二叉树中分配硬币","frequency":0.0,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11810,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7343733909998971,"acs":14263,"articleLive":2,"columnArticles":212,"formTitle":"[980]不同路径 III","frequency":0.0,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":19422,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5323910482921084,"acs":21244,"articleLive":2,"columnArticles":313,"formTitle":"[981]基于时间的键值存储","frequency":0.0,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":39903,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5451411333764274,"acs":2530,"articleLive":2,"columnArticles":29,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4641,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6342995074278313,"acs":32322,"articleLive":2,"columnArticles":453,"formTitle":"[983]最低票价","frequency":0.0,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":50957,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41706051339078865,"acs":9001,"articleLive":2,"columnArticles":142,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":21582,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6002661934338953,"acs":16236,"articleLive":2,"columnArticles":187,"formTitle":"[985]查询后的偶数和","frequency":0.0,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27048,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6771536991683935,"acs":25161,"articleLive":2,"columnArticles":242,"formTitle":"[986]区间列表的交集","frequency":0.0,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":37157,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.532796158197308,"acs":23077,"articleLive":2,"columnArticles":410,"formTitle":"[987]二叉树的垂序遍历","frequency":0.0,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":43313,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.49828049435787214,"acs":9273,"articleLive":2,"columnArticles":111,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":18610,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.47142176815735326,"acs":52465,"articleLive":2,"columnArticles":594,"formTitle":"[989]数组形式的整数加法","frequency":0.0,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":111291,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.502561777374745,"acs":33252,"articleLive":2,"columnArticles":500,"formTitle":"[990]等式方程的可满足性","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":66165,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5191012575242863,"acs":8710,"articleLive":2,"columnArticles":110,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16779,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.4524600234196533,"acs":23570,"articleLive":2,"columnArticles":272,"formTitle":"[992]K 个不同整数的子数组","frequency":0.0,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":52093,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.556886358900113,"acs":50773,"articleLive":2,"columnArticles":802,"formTitle":"[993]二叉树的堂兄弟节点","frequency":0.0,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":91173,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5088392464413727,"acs":54371,"articleLive":2,"columnArticles":1395,"formTitle":"[994]腐烂的橘子","frequency":0.0,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":106853,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.53984375,"acs":21421,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.0,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39680,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49510537832546353,"acs":4299,"articleLive":2,"columnArticles":86,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8683,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.51058613457287,"acs":36029,"articleLive":2,"columnArticles":390,"formTitle":"[997]找到小镇的法官","frequency":0.0,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":70564,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6147018478173162,"acs":7618,"articleLive":2,"columnArticles":110,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12393,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.69045563984918,"acs":30398,"articleLive":2,"columnArticles":571,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44026,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4093492634265166,"acs":3529,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":0.0,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8621,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2935267857142857,"acs":2104,"articleLive":2,"columnArticles":54,"formTitle":"[1001]网格照明","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7168,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7359352750809062,"acs":56851,"articleLive":2,"columnArticles":598,"formTitle":"[1002]查找共用字符","frequency":0.0,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":77250,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.576467791775612,"acs":12126,"articleLive":2,"columnArticles":186,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21035,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5968602238626548,"acs":67028,"articleLive":2,"columnArticles":705,"formTitle":"[1004]最大连续1的个数 III","frequency":0.0,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":112301,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5317505181835311,"acs":25398,"articleLive":2,"columnArticles":416,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.0,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":47763,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.627425119128659,"acs":44241,"articleLive":2,"columnArticles":603,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70512,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46481687014428413,"acs":6282,"articleLive":2,"columnArticles":85,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13515,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7236380541819872,"acs":17122,"articleLive":2,"columnArticles":220,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":0.0,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":23661,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5928443788361433,"acs":15261,"articleLive":2,"columnArticles":211,"formTitle":"[1009]十进制整数的反码","frequency":0.0,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":25742,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45173337264440677,"acs":18386,"articleLive":2,"columnArticles":246,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40701,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6267068314953408,"acs":60125,"articleLive":2,"columnArticles":575,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":0.0,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":95938,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3330426250953886,"acs":3055,"articleLive":2,"columnArticles":64,"formTitle":"[1012]至少有 1 位重复的数字","frequency":0.0,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9173,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39724402108510315,"acs":46874,"articleLive":2,"columnArticles":918,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":0.0,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":117998,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5499302285016571,"acs":37833,"articleLive":2,"columnArticles":447,"formTitle":"[1014]最佳观光组合","frequency":0.0,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":68796,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.3555034098408741,"acs":4848,"articleLive":2,"columnArticles":41,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13637,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5837001918952478,"acs":5171,"articleLive":2,"columnArticles":79,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8859,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5611075747931255,"acs":3526,"articleLive":2,"columnArticles":56,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6284,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5162571999529799,"acs":43918,"articleLive":2,"columnArticles":377,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":85070,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5973022758333828,"acs":20104,"articleLive":2,"columnArticles":261,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.0,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":33658,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5373333333333333,"acs":9269,"articleLive":2,"columnArticles":137,"formTitle":"[1020]飞地的数量","frequency":0.0,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":17250,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7833696243875885,"acs":57562,"articleLive":2,"columnArticles":654,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":73480,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7040801717967072,"acs":19672,"articleLive":2,"columnArticles":263,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.0,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":27940,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5643921191734743,"acs":7047,"articleLive":2,"columnArticles":154,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12486,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5575704756477726,"acs":33268,"articleLive":2,"columnArticles":383,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":59666,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7094652613302886,"acs":75187,"articleLive":2,"columnArticles":648,"formTitle":"[1025]除数博弈","frequency":0.0,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":105977,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6706440677966101,"acs":9892,"articleLive":2,"columnArticles":168,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14750,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.43414120126448896,"acs":13184,"articleLive":2,"columnArticles":120,"formTitle":"[1027]最长等差数列","frequency":0.0,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":30368,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7317522866129207,"acs":20241,"articleLive":2,"columnArticles":423,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.0,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27661,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6551521560333686,"acs":16728,"articleLive":2,"columnArticles":182,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":25533,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7106511578873388,"acs":40446,"articleLive":2,"columnArticles":444,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":56914,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5674561093437022,"acs":4816,"articleLive":2,"columnArticles":73,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8487,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.3975106349456436,"acs":2523,"articleLive":2,"columnArticles":41,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6347,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.3906183064400971,"acs":10942,"articleLive":2,"columnArticles":165,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28012,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.432348367029549,"acs":4448,"articleLive":2,"columnArticles":96,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10288,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6323068379283782,"acs":35296,"articleLive":2,"columnArticles":383,"formTitle":"[1035]不相交的线","frequency":0.0,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":55821,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.3001666049611255,"acs":3243,"articleLive":2,"columnArticles":54,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10804,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43847669676000184,"acs":9568,"articleLive":2,"columnArticles":112,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":21821,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7935050179890172,"acs":25143,"articleLive":2,"columnArticles":317,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":31686,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.556135770234987,"acs":4473,"articleLive":2,"columnArticles":59,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8043,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5233181186743402,"acs":2637,"articleLive":2,"columnArticles":30,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5039,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.48163611917061777,"acs":6806,"articleLive":2,"columnArticles":115,"formTitle":"[1041]困于环中的机器人","frequency":0.0,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":14131,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5299145299145299,"acs":11408,"articleLive":2,"columnArticles":150,"formTitle":"[1042]不邻接植花","frequency":0.0,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":21528,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6910026170923201,"acs":7657,"articleLive":2,"columnArticles":100,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11081,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20920872872281504,"acs":5666,"articleLive":2,"columnArticles":71,"formTitle":"[1044]最长重复子串","frequency":0.0,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":27083,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6419297841284474,"acs":8356,"articleLive":2,"columnArticles":105,"formTitle":"[1045]买下所有产品的客户","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","submitted":13017,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6596749031251573,"acs":65542,"articleLive":2,"columnArticles":912,"formTitle":"[1046]最后一块石头的重量","frequency":0.0,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":99355,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7247953579939903,"acs":104925,"articleLive":2,"columnArticles":977,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":0.0,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":144765,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4531628724870491,"acs":9535,"articleLive":2,"columnArticles":131,"formTitle":"[1048]最长字符串链","frequency":0.0,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":21041,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6443934744964608,"acs":42423,"articleLive":2,"columnArticles":400,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.0,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":65834,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7571872047509786,"acs":11220,"articleLive":2,"columnArticles":53,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.0,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","submitted":14818,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7533671463586283,"acs":31044,"articleLive":2,"columnArticles":367,"formTitle":"[1051]高度检查器","frequency":0.0,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":41207,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5811468151436855,"acs":47908,"articleLive":2,"columnArticles":748,"formTitle":"[1052]爱生气的书店老板","frequency":0.0,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":82437,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4584946569614372,"acs":5921,"articleLive":2,"columnArticles":95,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":12914,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37615333396746886,"acs":7909,"articleLive":2,"columnArticles":108,"formTitle":"[1054]距离相等的条形码","frequency":0.0,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":21026,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5869177907864597,"acs":4612,"articleLive":2,"columnArticles":85,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","submitted":7858,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.40975431768426174,"acs":3369,"articleLive":2,"columnArticles":65,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","submitted":8222,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.46443899448191295,"acs":3030,"articleLive":2,"columnArticles":38,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","submitted":6524,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3406225881142269,"acs":1324,"articleLive":2,"columnArticles":31,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","submitted":3887,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.36058700209643607,"acs":2236,"articleLive":2,"columnArticles":37,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","submitted":6201,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5300471815247082,"acs":4269,"articleLive":2,"columnArticles":63,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","submitted":8054,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6049681248626072,"acs":2752,"articleLive":2,"columnArticles":59,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","submitted":4549,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.54144172753255,"acs":3410,"articleLive":2,"columnArticles":45,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","submitted":6298,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7041169680646402,"acs":1830,"articleLive":2,"columnArticles":39,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","submitted":2599,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6505185589519651,"acs":4767,"articleLive":2,"columnArticles":68,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","submitted":7328,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5408368762586708,"acs":2417,"articleLive":2,"columnArticles":69,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","submitted":4469,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.47321844434094085,"acs":2032,"articleLive":2,"columnArticles":42,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","submitted":4294,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4210796915167095,"acs":819,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","submitted":1945,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8642582016204011,"acs":13014,"articleLive":2,"columnArticles":62,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","submitted":15058,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8194961991354897,"acs":10996,"articleLive":2,"columnArticles":55,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","submitted":13418,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48300424893776556,"acs":7730,"articleLive":2,"columnArticles":71,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","submitted":16004,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5867107942973523,"acs":34569,"articleLive":2,"columnArticles":672,"formTitle":"[1071]字符串的最大公因子","frequency":0.0,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":58920,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5799295774647887,"acs":3294,"articleLive":2,"columnArticles":53,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5680,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.33614035087719296,"acs":2395,"articleLive":2,"columnArticles":53,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7125,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6689913188769024,"acs":18418,"articleLive":2,"columnArticles":185,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27531,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6929714580721292,"acs":9396,"articleLive":2,"columnArticles":71,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","submitted":13559,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4956816174305624,"acs":10101,"articleLive":2,"columnArticles":87,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","submitted":20378,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7208151382823872,"acs":7428,"articleLive":2,"columnArticles":87,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","submitted":10305,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6224609167287036,"acs":11706,"articleLive":2,"columnArticles":181,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":18806,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7345900463113952,"acs":11262,"articleLive":2,"columnArticles":188,"formTitle":"[1079]活字印刷","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15331,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.490239625949737,"acs":4194,"articleLive":2,"columnArticles":88,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8555,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5706828885400314,"acs":14541,"articleLive":2,"columnArticles":142,"formTitle":"[1081]不同字符的最小子序列","frequency":0.0,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":25480,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7606497708277163,"acs":11285,"articleLive":2,"columnArticles":92,"formTitle":"[1082]销售分析 I ","frequency":0.0,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","submitted":14836,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5281550434915306,"acs":10383,"articleLive":2,"columnArticles":95,"formTitle":"[1083]销售分析 II","frequency":0.0,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","submitted":19659,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5371870202742046,"acs":10148,"articleLive":2,"columnArticles":93,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","submitted":18891,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7735363499892773,"acs":3607,"articleLive":2,"columnArticles":73,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","submitted":4663,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6895656924337613,"acs":5049,"articleLive":2,"columnArticles":80,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","submitted":7322,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5329994107248085,"acs":1809,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","submitted":3394,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.4483506944444444,"acs":1033,"articleLive":2,"columnArticles":34,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","submitted":2304,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5851439352443552,"acs":19229,"articleLive":2,"columnArticles":283,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":32862,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5444909344490935,"acs":3904,"articleLive":2,"columnArticles":79,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7170,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.37825059101654845,"acs":27680,"articleLive":2,"columnArticles":284,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":0.0,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":73179,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4899605929817977,"acs":2611,"articleLive":2,"columnArticles":50,"formTitle":"[1092]最短公共超序列","frequency":0.0,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5329,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3793210195026313,"acs":3676,"articleLive":2,"columnArticles":59,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9691,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6093146552709157,"acs":26663,"articleLive":2,"columnArticles":376,"formTitle":"[1094]拼车","frequency":0.0,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":43759,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3727213913308216,"acs":19588,"articleLive":2,"columnArticles":383,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":52554,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5493928454217263,"acs":1674,"articleLive":2,"columnArticles":47,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3047,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5186895902831238,"acs":6064,"articleLive":2,"columnArticles":108,"formTitle":"[1097]游戏玩法分析 V","frequency":0.0,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","submitted":11691,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.47161286097832494,"acs":7202,"articleLive":2,"columnArticles":101,"formTitle":"[1098]小众书籍","frequency":0.0,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","submitted":15271,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5809178743961353,"acs":4810,"articleLive":2,"columnArticles":91,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","submitted":8280,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6992843380126618,"acs":5081,"articleLive":2,"columnArticles":98,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","submitted":7266,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.664795058955643,"acs":2368,"articleLive":2,"columnArticles":53,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","submitted":3562,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.3693290734824281,"acs":5202,"articleLive":2,"columnArticles":66,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","submitted":14085,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6366703152757093,"acs":35481,"articleLive":2,"columnArticles":1100,"formTitle":"[1103]分糖果 II","frequency":0.0,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":55729,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7609940601443678,"acs":28570,"articleLive":2,"columnArticles":671,"formTitle":"[1104]二叉树寻路","frequency":0.0,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37543,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.559091896589181,"acs":5147,"articleLive":2,"columnArticles":66,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9206,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5757949561403509,"acs":4201,"articleLive":2,"columnArticles":124,"formTitle":"[1106]解析布尔表达式","frequency":0.0,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7296,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4101984426023612,"acs":6532,"articleLive":2,"columnArticles":92,"formTitle":"[1107]每日新用户统计","frequency":0.0,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","submitted":15924,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8395160885497716,"acs":66896,"articleLive":2,"columnArticles":681,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":79684,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5766155368629391,"acs":58267,"articleLive":2,"columnArticles":581,"formTitle":"[1109]航班预订统计","frequency":0.0,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":101050,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6292859567726604,"acs":11122,"articleLive":2,"columnArticles":202,"formTitle":"[1110]删点成林","frequency":0.0,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":17674,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7712759150243154,"acs":24107,"articleLive":2,"columnArticles":399,"formTitle":"[1111]有效括号的嵌套深度","frequency":0.0,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31256,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.643916659521564,"acs":7510,"articleLive":2,"columnArticles":85,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","submitted":11663,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5402097902097902,"acs":6798,"articleLive":2,"columnArticles":48,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","submitted":12584,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.653581518465415,"acs":77037,"articleLive":2,"columnArticles":574,"formTitle":"[1114]按序打印","frequency":0.0,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":117869,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5621448537420769,"acs":42836,"articleLive":2,"columnArticles":478,"formTitle":"[1115]交替打印FooBar","frequency":0.0,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":76201,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5190360890118759,"acs":22508,"articleLive":2,"columnArticles":365,"formTitle":"[1116]打印零与奇偶数","frequency":0.0,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":43365,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5215536800072602,"acs":17241,"articleLive":2,"columnArticles":251,"formTitle":"[1117]H2O 生成","frequency":0.0,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":33057,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6427388183324131,"acs":2328,"articleLive":2,"columnArticles":37,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","submitted":3622,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8664512093411176,"acs":8311,"articleLive":2,"columnArticles":144,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","submitted":9592,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6091846298031866,"acs":2600,"articleLive":2,"columnArticles":48,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","submitted":4268,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5751186083289405,"acs":1091,"articleLive":2,"columnArticles":18,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","submitted":1897,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7069890129054761,"acs":64862,"articleLive":2,"columnArticles":870,"formTitle":"[1122]数组的相对排序","frequency":0.0,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":91744,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7051754385964912,"acs":8039,"articleLive":2,"columnArticles":103,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11400,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3178511611629128,"acs":12715,"articleLive":2,"columnArticles":130,"formTitle":"[1124]表现良好的最长时间段","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":40003,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4913022272801171,"acs":3022,"articleLive":2,"columnArticles":50,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6151,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6931186283595923,"acs":5983,"articleLive":2,"columnArticles":92,"formTitle":"[1126]查询活跃业务","frequency":0.0,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","submitted":8632,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.41339295219844563,"acs":3883,"articleLive":2,"columnArticles":71,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","submitted":9393,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5446877296105804,"acs":37066,"articleLive":2,"columnArticles":479,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.0,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":68050,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.38011444041100106,"acs":6178,"articleLive":2,"columnArticles":111,"formTitle":"[1129]颜色交替的最短路径","frequency":0.0,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16253,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6281886387995713,"acs":5861,"articleLive":2,"columnArticles":100,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9330,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.45459949472432754,"acs":3059,"articleLive":2,"columnArticles":46,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6729,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.38777050830397586,"acs":4623,"articleLive":2,"columnArticles":53,"formTitle":"[1132]报告的记录 II","frequency":0.0,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","submitted":11922,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6459351399378054,"acs":2908,"articleLive":2,"columnArticles":63,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","submitted":4502,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7757814422840266,"acs":3152,"articleLive":2,"columnArticles":53,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","submitted":4063,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5351894818252126,"acs":6228,"articleLive":2,"columnArticles":72,"formTitle":"[1135]最低成本联通所有城市","frequency":0.0,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","submitted":11637,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5701790920449813,"acs":2738,"articleLive":2,"columnArticles":49,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","submitted":4802,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6079798443962033,"acs":76738,"articleLive":2,"columnArticles":853,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.0,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":126218,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4324879569283083,"acs":6105,"articleLive":2,"columnArticles":139,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14116,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4775645945254541,"acs":9334,"articleLive":2,"columnArticles":154,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.0,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":19545,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6526940283991441,"acs":6711,"articleLive":2,"columnArticles":94,"formTitle":"[1140]石子游戏 II","frequency":0.0,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10282,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5101449275362319,"acs":9856,"articleLive":2,"columnArticles":64,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.0,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","submitted":19320,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.37071161454663704,"acs":6840,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","submitted":18451,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6364360137076396,"acs":165474,"articleLive":2,"columnArticles":1118,"formTitle":"[1143]最长公共子序列","frequency":0.0,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":260001,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44183045890499334,"acs":10273,"articleLive":2,"columnArticles":146,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.0,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23251,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4687811831789023,"acs":6577,"articleLive":2,"columnArticles":106,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14030,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2866133114440112,"acs":4190,"articleLive":2,"columnArticles":62,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":14619,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5599445599445599,"acs":4040,"articleLive":2,"columnArticles":80,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7215,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.714963707426019,"acs":7683,"articleLive":2,"columnArticles":35,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","submitted":10746,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.4424442190669371,"acs":5235,"articleLive":2,"columnArticles":46,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","submitted":11832,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6042047531992687,"acs":4627,"articleLive":2,"columnArticles":83,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.0,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","submitted":7658,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.48543007606787597,"acs":4148,"articleLive":2,"columnArticles":60,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.0,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","submitted":8545,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3856655290102389,"acs":1356,"articleLive":2,"columnArticles":32,"formTitle":"[1152]用户网站访问行为分析","frequency":0.0,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","submitted":3516,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.36980306345733044,"acs":1690,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","submitted":4570,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5693436478188053,"acs":14278,"articleLive":2,"columnArticles":222,"formTitle":"[1154]一年中的第几天","frequency":0.0,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":25078,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.47966304456185826,"acs":9623,"articleLive":2,"columnArticles":125,"formTitle":"[1155]掷骰子的N种方法","frequency":0.0,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":20062,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4317524327167529,"acs":4925,"articleLive":2,"columnArticles":81,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11407,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.317470322512869,"acs":3022,"articleLive":2,"columnArticles":45,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9519,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5504193086520761,"acs":5382,"articleLive":2,"columnArticles":61,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","submitted":9778,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.4873608382449247,"acs":3721,"articleLive":2,"columnArticles":83,"formTitle":"[1159]市场分析 II","frequency":0.0,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","submitted":7635,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6870483602001112,"acs":59328,"articleLive":2,"columnArticles":911,"formTitle":"[1160]拼写单词","frequency":0.0,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":86352,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6335110249575964,"acs":10458,"articleLive":2,"columnArticles":174,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16508,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.46908653314832327,"acs":38201,"articleLive":2,"columnArticles":493,"formTitle":"[1162]地图分析","frequency":0.0,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":81437,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2675793686891658,"acs":5883,"articleLive":2,"columnArticles":99,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":21986,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6093003042155585,"acs":5608,"articleLive":2,"columnArticles":85,"formTitle":"[1164]指定日期的产品价格","frequency":0.0,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","submitted":9204,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.837338057800908,"acs":7562,"articleLive":2,"columnArticles":113,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","submitted":9031,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.48558476881233004,"acs":2678,"articleLive":2,"columnArticles":48,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","submitted":5515,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.4328638497652582,"acs":2305,"articleLive":2,"columnArticles":35,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","submitted":5325,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5700833031510323,"acs":1574,"articleLive":2,"columnArticles":27,"formTitle":"[1168]水资源分配优化","frequency":0.0,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","submitted":2761,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.32250468547263206,"acs":6711,"articleLive":2,"columnArticles":80,"formTitle":"[1169]查询无效交易","frequency":0.0,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20809,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6169799385505151,"acs":13655,"articleLive":2,"columnArticles":216,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.0,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22132,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47417408579206827,"acs":12889,"articleLive":2,"columnArticles":153,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.0,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":27182,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2680199739470256,"acs":2469,"articleLive":2,"columnArticles":53,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9212,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.757624703087886,"acs":7974,"articleLive":2,"columnArticles":73,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","submitted":10525,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6200206932229695,"acs":4794,"articleLive":2,"columnArticles":61,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","submitted":7732,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.49060571118496915,"acs":7233,"articleLive":2,"columnArticles":113,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14743,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.448936838797528,"acs":4286,"articleLive":2,"columnArticles":61,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","submitted":9547,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.2650112476206956,"acs":6126,"articleLive":2,"columnArticles":95,"formTitle":"[1177]构建回文串检测","frequency":0.0,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23116,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46202090592334494,"acs":18564,"articleLive":2,"columnArticles":183,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40180,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6359383195216616,"acs":30312,"articleLive":2,"columnArticles":183,"formTitle":"[1179]重新格式化部门表","frequency":0.0,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":47665,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7757892120308227,"acs":3121,"articleLive":2,"columnArticles":69,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","submitted":4023,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3719298245614035,"acs":1484,"articleLive":2,"columnArticles":28,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","submitted":3990,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.39669585987261147,"acs":1993,"articleLive":2,"columnArticles":41,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","submitted":5024,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5977653631284916,"acs":642,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","submitted":1074,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.585555848956958,"acs":13305,"articleLive":2,"columnArticles":257,"formTitle":"[1184]公交站间的距离","frequency":0.0,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22722,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6088161756712687,"acs":11201,"articleLive":2,"columnArticles":201,"formTitle":"[1185]一周中的第几天","frequency":0.0,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":18398,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39389611763461335,"acs":7447,"articleLive":2,"columnArticles":107,"formTitle":"[1186]删除一次得到子数组最大和","frequency":0.0,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":18906,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4425287356321839,"acs":1848,"articleLive":2,"columnArticles":32,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4176,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6941176470588235,"acs":3245,"articleLive":2,"columnArticles":64,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","submitted":4675,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6451482814244943,"acs":20797,"articleLive":2,"columnArticles":324,"formTitle":"[1189]“气球” 的最大数量","frequency":0.0,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":32236,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6508086292500218,"acs":44829,"articleLive":2,"columnArticles":615,"formTitle":"[1190]反转每对括号间的子串","frequency":0.0,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":68882,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.267119613802968,"acs":5976,"articleLive":2,"columnArticles":95,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22372,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.49976218787158144,"acs":4203,"articleLive":2,"columnArticles":49,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8410,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6043689320388349,"acs":5478,"articleLive":2,"columnArticles":72,"formTitle":"[1193]每月交易 I","frequency":0.0,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","submitted":9064,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5104534746760895,"acs":3467,"articleLive":2,"columnArticles":62,"formTitle":"[1194]锦标赛优胜者","frequency":0.0,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","submitted":6792,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6362627710230687,"acs":13763,"articleLive":2,"columnArticles":261,"formTitle":"[1195]交替打印字符串","frequency":0.0,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":21631,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6928801287208367,"acs":3445,"articleLive":2,"columnArticles":59,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","submitted":4972,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.370152942993975,"acs":4792,"articleLive":2,"columnArticles":60,"formTitle":"[1197]进击的骑士","frequency":0.0,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","submitted":12946,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7470508605685554,"acs":3863,"articleLive":2,"columnArticles":56,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","submitted":5171,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.4365693865396069,"acs":733,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","submitted":1679,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6869276247150199,"acs":17777,"articleLive":2,"columnArticles":249,"formTitle":"[1200]最小绝对差","frequency":0.0,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":25879,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.2471515852047556,"acs":5987,"articleLive":2,"columnArticles":85,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24224,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.503240227661213,"acs":26791,"articleLive":2,"columnArticles":293,"formTitle":"[1202]交换字符串中的元素","frequency":0.0,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53237,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6216578228839318,"acs":12067,"articleLive":2,"columnArticles":143,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19411,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7270468218676432,"acs":5559,"articleLive":2,"columnArticles":81,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","submitted":7646,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4594666666666667,"acs":5169,"articleLive":2,"columnArticles":82,"formTitle":"[1205]每月交易II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","submitted":11250,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6173158574856932,"acs":6688,"articleLive":2,"columnArticles":87,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":10834,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7303513596089215,"acs":59761,"articleLive":2,"columnArticles":829,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":81825,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.49687582319161266,"acs":47156,"articleLive":2,"columnArticles":609,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":94905,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5308004589180125,"acs":12029,"articleLive":2,"columnArticles":159,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.0,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":22662,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.45024664058513353,"acs":2647,"articleLive":2,"columnArticles":54,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5879,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6552534104255127,"acs":7253,"articleLive":2,"columnArticles":61,"formTitle":"[1211]查询结果的质量和占比","frequency":0.0,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","submitted":11069,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5098724804607158,"acs":4958,"articleLive":2,"columnArticles":96,"formTitle":"[1212]查询球队积分","frequency":0.0,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","submitted":9724,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7739635595458146,"acs":5862,"articleLive":2,"columnArticles":124,"formTitle":"[1213]三个有序数组的交集","frequency":0.0,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","submitted":7574,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6348453216929208,"acs":3345,"articleLive":2,"columnArticles":71,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.0,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","submitted":5269,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.411938409618224,"acs":1953,"articleLive":2,"columnArticles":40,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","submitted":4741,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5374074074074074,"acs":1451,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","submitted":2700,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6945075333482614,"acs":21711,"articleLive":2,"columnArticles":350,"formTitle":"[1217]玩筹码","frequency":0.0,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":31261,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.4222778089744244,"acs":8272,"articleLive":2,"columnArticles":113,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":19589,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6314073918300825,"acs":12010,"articleLive":2,"columnArticles":171,"formTitle":"[1219]黄金矿工","frequency":0.0,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":19021,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5254191086275044,"acs":3855,"articleLive":2,"columnArticles":72,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7337,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8440142559879577,"acs":76255,"articleLive":2,"columnArticles":1107,"formTitle":"[1221]分割平衡字符串","frequency":0.0,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":90348,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6726204194514865,"acs":5837,"articleLive":2,"columnArticles":130,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8678,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.47489421720733427,"acs":3367,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7090,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.326274728336584,"acs":4684,"articleLive":2,"columnArticles":69,"formTitle":"[1224]最大相等频率","frequency":0.0,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14356,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.539609644087256,"acs":3290,"articleLive":2,"columnArticles":79,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.0,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","submitted":6097,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.597864768683274,"acs":11760,"articleLive":2,"columnArticles":136,"formTitle":"[1226]哲学家进餐","frequency":0.0,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":19670,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6627073656270737,"acs":9987,"articleLive":2,"columnArticles":157,"formTitle":"[1227]飞机座位分配概率","frequency":0.0,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15070,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.539782684893095,"acs":3080,"articleLive":2,"columnArticles":52,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","submitted":5706,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.417203552150444,"acs":2396,"articleLive":2,"columnArticles":43,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","submitted":5743,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.49164910004864604,"acs":3032,"articleLive":2,"columnArticles":59,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","submitted":6167,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5617085617085618,"acs":2972,"articleLive":2,"columnArticles":42,"formTitle":"[1231]分享巧克力","frequency":0.0,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","submitted":5291,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.469438877755511,"acs":33732,"articleLive":2,"columnArticles":419,"formTitle":"[1232]缀点成线","frequency":0.0,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":71856,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4807201070429388,"acs":7904,"articleLive":2,"columnArticles":114,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":16442,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3426213194403793,"acs":5853,"articleLive":2,"columnArticles":90,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.0,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":17083,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.46154983732623484,"acs":6242,"articleLive":2,"columnArticles":110,"formTitle":"[1235]规划兼职工作","frequency":0.0,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":13524,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5616045845272206,"acs":1176,"articleLive":2,"columnArticles":32,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","submitted":2094,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7106167988211354,"acs":10127,"articleLive":2,"columnArticles":131,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14251,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6585677749360613,"acs":3090,"articleLive":2,"columnArticles":72,"formTitle":"[1238]循环码排列","frequency":0.0,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4692,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4910009338653536,"acs":34701,"articleLive":2,"columnArticles":385,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":70674,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4950048971596474,"acs":2527,"articleLive":2,"columnArticles":39,"formTitle":"[1240]铺瓷砖","frequency":0.0,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5105,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5951930355791067,"acs":6290,"articleLive":2,"columnArticles":63,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","submitted":10568,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4711501719526175,"acs":1233,"articleLive":2,"columnArticles":20,"formTitle":"[1242]多线程网页爬虫","frequency":0.0,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","submitted":2617,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5405575351079438,"acs":2579,"articleLive":2,"columnArticles":55,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","submitted":4771,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6194735497061078,"acs":2424,"articleLive":2,"columnArticles":40,"formTitle":"[1244]力扣排行榜","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","submitted":3913,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5099768652400232,"acs":3527,"articleLive":2,"columnArticles":63,"formTitle":"[1245]树的直径","frequency":0.0,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","submitted":6916,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.48071557525028724,"acs":2929,"articleLive":2,"columnArticles":42,"formTitle":"[1246]删除回文子数组","frequency":0.0,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","submitted":6093,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6167167596965794,"acs":8618,"articleLive":2,"columnArticles":156,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":13974,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5593408360128618,"acs":34791,"articleLive":2,"columnArticles":476,"formTitle":"[1248]统计「优美子数组」","frequency":0.0,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":62200,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5740198345408766,"acs":22342,"articleLive":2,"columnArticles":318,"formTitle":"[1249]移除无效的括号","frequency":0.0,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":38922,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5617438464747602,"acs":2693,"articleLive":2,"columnArticles":38,"formTitle":"[1250]检查「好数组」","frequency":0.0,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4794,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7720202216605094,"acs":7941,"articleLive":2,"columnArticles":94,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","submitted":10286,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7485139460448103,"acs":18007,"articleLive":2,"columnArticles":311,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24057,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39339180402238016,"acs":5203,"articleLive":2,"columnArticles":79,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13226,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5986169199552777,"acs":14456,"articleLive":2,"columnArticles":227,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.0,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":24149,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6800274851122309,"acs":2969,"articleLive":2,"columnArticles":64,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4366,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6665209790209791,"acs":1525,"articleLive":2,"columnArticles":35,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","submitted":2288,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5625193918709277,"acs":1813,"articleLive":2,"columnArticles":39,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","submitted":3223,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5603130755064457,"acs":1217,"articleLive":2,"columnArticles":43,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","submitted":2172,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.47833495618305744,"acs":1965,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","submitted":4108,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6033916580894967,"acs":12311,"articleLive":2,"columnArticles":250,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":20403,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7276827663972938,"acs":7744,"articleLive":2,"columnArticles":97,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10642,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5258484369298139,"acs":12969,"articleLive":2,"columnArticles":197,"formTitle":"[1262]可被三整除的最大和","frequency":0.0,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":24663,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.41864567783959833,"acs":3085,"articleLive":2,"columnArticles":58,"formTitle":"[1263]推箱子","frequency":0.0,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7369,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5698516320474778,"acs":4801,"articleLive":2,"columnArticles":83,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","submitted":8425,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.921455287317239,"acs":2710,"articleLive":2,"columnArticles":65,"formTitle":"[1265]逆序打印不可变链表","frequency":0.0,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","submitted":2941,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8238300458588872,"acs":29821,"articleLive":2,"columnArticles":454,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36198,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6071219321658746,"acs":9326,"articleLive":2,"columnArticles":145,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15361,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5843400117855039,"acs":7933,"articleLive":2,"columnArticles":145,"formTitle":"[1268]搜索推荐系统","frequency":0.0,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":13576,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4914462439977212,"acs":30192,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61435,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.802966389985032,"acs":5901,"articleLive":2,"columnArticles":82,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","submitted":7349,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5068436333471589,"acs":2444,"articleLive":2,"columnArticles":40,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","submitted":4822,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5187702265372168,"acs":1603,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","submitted":3090,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5448851774530271,"acs":1566,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","submitted":2874,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6001239925604464,"acs":968,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","submitted":1613,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.541175687371014,"acs":8129,"articleLive":2,"columnArticles":168,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.0,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15021,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5014635649360654,"acs":6510,"articleLive":2,"columnArticles":97,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":12982,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7250038220455588,"acs":18969,"articleLive":2,"columnArticles":233,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":0.0,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":26164,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5980980980980981,"acs":3585,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":0.0,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":5994,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6202131859455191,"acs":1571,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","submitted":2533,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.506211416812743,"acs":6642,"articleLive":2,"columnArticles":69,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","submitted":13121,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8320324005891017,"acs":45196,"articleLive":2,"columnArticles":614,"formTitle":"[1281]整数的各位积和之差","frequency":0.0,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":54320,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8104716857180396,"acs":12337,"articleLive":2,"columnArticles":227,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":15222,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41798240327829334,"acs":6936,"articleLive":2,"columnArticles":100,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.0,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16594,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6599231754161332,"acs":2577,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.0,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3905,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8125937031484258,"acs":4336,"articleLive":2,"columnArticles":59,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","submitted":5336,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6450953678474114,"acs":4735,"articleLive":2,"columnArticles":91,"formTitle":"[1286]字母组合迭代器","frequency":0.0,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7340,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.603597601598934,"acs":15402,"articleLive":2,"columnArticles":216,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.0,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":25517,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5633251426429553,"acs":13526,"articleLive":2,"columnArticles":169,"formTitle":"[1288]删除被覆盖区间","frequency":0.0,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":24011,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6251096598108977,"acs":6413,"articleLive":2,"columnArticles":94,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":10259,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8094963941579298,"acs":53430,"articleLive":2,"columnArticles":694,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":66004,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5194398927454194,"acs":6974,"articleLive":2,"columnArticles":154,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13426,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.46909803921568627,"acs":5981,"articleLive":2,"columnArticles":95,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12750,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.358604549907478,"acs":13178,"articleLive":2,"columnArticles":127,"formTitle":"[1293]网格中的最短路径","frequency":0.0,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":36748,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6563123396979197,"acs":6909,"articleLive":2,"columnArticles":72,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","submitted":10527,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8086894875430424,"acs":47910,"articleLive":2,"columnArticles":635,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.0,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":59244,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4534986713906112,"acs":7680,"articleLive":2,"columnArticles":122,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":16935,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.4575813556913457,"acs":6440,"articleLive":2,"columnArticles":90,"formTitle":"[1297]子串的最大出现次数","frequency":0.0,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14074,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5971585701191567,"acs":2606,"articleLive":2,"columnArticles":88,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4364,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7862534042277266,"acs":30314,"articleLive":2,"columnArticles":429,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":38555,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4668450442066077,"acs":24078,"articleLive":2,"columnArticles":362,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.0,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":51576,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.36108587005906406,"acs":3179,"articleLive":2,"columnArticles":71,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8804,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8180028482868392,"acs":19529,"articleLive":2,"columnArticles":294,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.0,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":23874,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8218342251009105,"acs":8755,"articleLive":2,"columnArticles":82,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","submitted":10653,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7245170571311138,"acs":21153,"articleLive":2,"columnArticles":380,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29196,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7467486994797919,"acs":14929,"articleLive":2,"columnArticles":224,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.0,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":19992,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5752109494385755,"acs":17315,"articleLive":2,"columnArticles":271,"formTitle":"[1306]跳跃游戏 III","frequency":0.0,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":30102,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3314647377938517,"acs":1833,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5530,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7504992867332382,"acs":5261,"articleLive":2,"columnArticles":59,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","submitted":7010,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7555241051862673,"acs":16549,"articleLive":2,"columnArticles":288,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":21904,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7129618926521019,"acs":37007,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":51906,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3783155592015313,"acs":5534,"articleLive":2,"columnArticles":86,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14628,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6673245893289189,"acs":10481,"articleLive":2,"columnArticles":148,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.0,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":15706,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8319123600857347,"acs":34932,"articleLive":2,"columnArticles":543,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":41990,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7382840198543157,"acs":11453,"articleLive":2,"columnArticles":190,"formTitle":"[1314]矩阵区域和","frequency":0.0,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":15513,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8102319669526533,"acs":12749,"articleLive":2,"columnArticles":261,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15735,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.43949246629659,"acs":2771,"articleLive":2,"columnArticles":59,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6305,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6142650078511898,"acs":10171,"articleLive":2,"columnArticles":191,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16558,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6545966816237087,"acs":6273,"articleLive":2,"columnArticles":111,"formTitle":"[1318]或运算的最小翻转次数","frequency":0.0,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9583,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6169948269639491,"acs":30772,"articleLive":2,"columnArticles":510,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":49874,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5892597968069666,"acs":2436,"articleLive":2,"columnArticles":56,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4134,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6133314503601186,"acs":4343,"articleLive":2,"columnArticles":76,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","submitted":7081,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5934537246049661,"acs":5258,"articleLive":2,"columnArticles":63,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","submitted":8860,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7549025711261906,"acs":24252,"articleLive":2,"columnArticles":475,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.0,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":32126,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5893410658934106,"acs":5894,"articleLive":2,"columnArticles":114,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10001,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.728892721132428,"acs":10144,"articleLive":2,"columnArticles":180,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":13917,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.4747913188647746,"acs":5688,"articleLive":2,"columnArticles":92,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":11980,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6889704022261574,"acs":5447,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","submitted":7906,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.46161647682945856,"acs":5917,"articleLive":2,"columnArticles":119,"formTitle":"[1328]破坏回文串","frequency":0.0,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12818,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7715713492504165,"acs":6948,"articleLive":2,"columnArticles":156,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.0,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9005,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.37732160312805474,"acs":1158,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.0,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3069,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5368931151138338,"acs":11744,"articleLive":2,"columnArticles":201,"formTitle":"[1331]数组序号转换","frequency":0.0,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":21874,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6866261620671986,"acs":9380,"articleLive":2,"columnArticles":132,"formTitle":"[1332]删除回文子序列","frequency":0.0,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13661,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5432505818463925,"acs":5602,"articleLive":2,"columnArticles":117,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10312,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4899457947193565,"acs":5604,"articleLive":2,"columnArticles":93,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":0.0,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11438,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5869786368260427,"acs":3462,"articleLive":2,"columnArticles":57,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":5898,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4214183037853378,"acs":1759,"articleLive":2,"columnArticles":48,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","submitted":4174,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7059240543144347,"acs":38835,"articleLive":2,"columnArticles":618,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.0,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":55013,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6396990987154921,"acs":9014,"articleLive":2,"columnArticles":129,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14091,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.3982411456581287,"acs":8287,"articleLive":2,"columnArticles":130,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":20809,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5735060814383924,"acs":4338,"articleLive":2,"columnArticles":95,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7564,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.4787142857142857,"acs":3351,"articleLive":2,"columnArticles":45,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","submitted":7000,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8204509803921569,"acs":41843,"articleLive":2,"columnArticles":636,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":51000,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.544203146374829,"acs":12730,"articleLive":2,"columnArticles":213,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23392,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5921405180113128,"acs":5967,"articleLive":2,"columnArticles":121,"formTitle":"[1344]时钟指针的夹角","frequency":0.0,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":10077,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.36651669729421454,"acs":5784,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":0.0,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15781,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43501518401916806,"acs":15614,"articleLive":2,"columnArticles":266,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":35893,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7397783721818877,"acs":7744,"articleLive":2,"columnArticles":113,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10468,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3041457167251684,"acs":3206,"articleLive":2,"columnArticles":49,"formTitle":"[1348]推文计数","frequency":0.0,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":10541,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5050194300518135,"acs":3119,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6176,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8476471186096148,"acs":8340,"articleLive":2,"columnArticles":83,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","submitted":9839,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7548452820578123,"acs":29639,"articleLive":2,"columnArticles":542,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.0,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":39265,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44421251094202413,"acs":6597,"articleLive":2,"columnArticles":71,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":14851,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28364384042526514,"acs":11312,"articleLive":2,"columnArticles":152,"formTitle":"[1353]最多可以参加的会议数目","frequency":0.0,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":39881,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2813595636930269,"acs":2889,"articleLive":2,"columnArticles":70,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10268,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6632990768158857,"acs":3808,"articleLive":2,"columnArticles":56,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","submitted":5741,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7315001439677512,"acs":45729,"articleLive":2,"columnArticles":505,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.0,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":62514,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5287144362486829,"acs":4014,"articleLive":2,"columnArticles":41,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7592,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.49264445232187165,"acs":5559,"articleLive":2,"columnArticles":111,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":11284,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5506790001968116,"acs":2798,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5081,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5050823277655591,"acs":8497,"articleLive":2,"columnArticles":140,"formTitle":"[1360]日期之间隔几天","frequency":0.0,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":16823,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4021485540665184,"acs":7412,"articleLive":2,"columnArticles":200,"formTitle":"[1361]验证二叉树","frequency":0.0,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":18431,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5250969088559785,"acs":5283,"articleLive":2,"columnArticles":68,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10061,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3651920490210731,"acs":4887,"articleLive":2,"columnArticles":98,"formTitle":"[1363]形成三的最大倍数","frequency":0.0,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":13382,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6737718229801055,"acs":3319,"articleLive":2,"columnArticles":64,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","submitted":4926,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250248088261047,"acs":84801,"articleLive":2,"columnArticles":1086,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.0,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":102786,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5376834740284432,"acs":7070,"articleLive":2,"columnArticles":140,"formTitle":"[1366]通过投票对团队排名","frequency":0.0,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13149,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41812193839426565,"acs":15108,"articleLive":2,"columnArticles":220,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":36133,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5243759177679882,"acs":3571,"articleLive":2,"columnArticles":87,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6810,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6082614616432138,"acs":2680,"articleLive":2,"columnArticles":42,"formTitle":"[1369]获取最近第二次的活动","frequency":0.0,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","submitted":4406,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7900495220545894,"acs":48020,"articleLive":2,"columnArticles":575,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60781,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5800871734422545,"acs":21161,"articleLive":2,"columnArticles":264,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":0.0,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36479,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5130972669317679,"acs":8129,"articleLive":2,"columnArticles":161,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":15843,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.40179372197309415,"acs":7168,"articleLive":2,"columnArticles":161,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":0.0,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":17840,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7392408388424324,"acs":16885,"articleLive":2,"columnArticles":225,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22841,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5742792311799253,"acs":8605,"articleLive":2,"columnArticles":170,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":14984,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5024544415304956,"acs":7472,"articleLive":2,"columnArticles":152,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14871,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32437485393783594,"acs":4164,"articleLive":2,"columnArticles":129,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12837,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8621686746987952,"acs":7156,"articleLive":2,"columnArticles":60,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","submitted":8300,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8377720038973693,"acs":10318,"articleLive":2,"columnArticles":160,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12316,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7281855652021398,"acs":16607,"articleLive":2,"columnArticles":249,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22806,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7315531875348491,"acs":11808,"articleLive":2,"columnArticles":151,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":16141,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6922207572047466,"acs":11025,"articleLive":2,"columnArticles":173,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":15927,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32433011789924976,"acs":4539,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":0.0,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":13995,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5431228861330327,"acs":1927,"articleLive":2,"columnArticles":45,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","submitted":3548,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7009803921568627,"acs":13442,"articleLive":2,"columnArticles":201,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":19176,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.311560290749776,"acs":6258,"articleLive":2,"columnArticles":130,"formTitle":"[1386]安排电影院座位","frequency":0.0,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20086,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6945097201452681,"acs":9753,"articleLive":2,"columnArticles":168,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14043,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5405016984583224,"acs":4137,"articleLive":2,"columnArticles":53,"formTitle":"[1388]3n 块披萨","frequency":0.0,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7654,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8311234757902214,"acs":28082,"articleLive":2,"columnArticles":478,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.0,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33788,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3532179465636028,"acs":6306,"articleLive":2,"columnArticles":114,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17853,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.39947153495075666,"acs":6652,"articleLive":2,"columnArticles":202,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.0,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16652,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.4028765771846929,"acs":7759,"articleLive":2,"columnArticles":141,"formTitle":"[1392]最长快乐前缀","frequency":0.0,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":19259,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8577825159914713,"acs":4023,"articleLive":2,"columnArticles":59,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","submitted":4690,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6652462861610633,"acs":17017,"articleLive":2,"columnArticles":272,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":25580,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7490632751068658,"acs":14194,"articleLive":2,"columnArticles":211,"formTitle":"[1395]统计作战单位数","frequency":0.0,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":18949,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4125644251450834,"acs":10166,"articleLive":2,"columnArticles":142,"formTitle":"[1396]设计地铁系统","frequency":0.0,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":24641,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3733528550512445,"acs":1020,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2732,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7618963694043003,"acs":4323,"articleLive":2,"columnArticles":64,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","submitted":5674,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6707238490728145,"acs":9368,"articleLive":2,"columnArticles":150,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":13967,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6048638760357258,"acs":5621,"articleLive":2,"columnArticles":96,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9293,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41658651277118736,"acs":3898,"articleLive":2,"columnArticles":89,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9357,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7532804274377308,"acs":9587,"articleLive":2,"columnArticles":174,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12727,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6908185840707964,"acs":21233,"articleLive":2,"columnArticles":361,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.0,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":30736,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4927894519983519,"acs":7176,"articleLive":2,"columnArticles":153,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14562,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5074300300847844,"acs":5566,"articleLive":2,"columnArticles":140,"formTitle":"[1405]最长快乐字符串","frequency":0.0,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":10969,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5693983893889152,"acs":4808,"articleLive":2,"columnArticles":80,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8444,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.666552040348464,"acs":5815,"articleLive":2,"columnArticles":65,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","submitted":8724,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6154415506314475,"acs":13304,"articleLive":2,"columnArticles":202,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":21617,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.806429070580014,"acs":8078,"articleLive":2,"columnArticles":129,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10017,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.47525641025641024,"acs":7414,"articleLive":2,"columnArticles":118,"formTitle":"[1410]HTML 实体解析器","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15600,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5504515395008177,"acs":7741,"articleLive":2,"columnArticles":140,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":0.0,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14063,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5559984057393383,"acs":2790,"articleLive":2,"columnArticles":67,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","submitted":5018,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6927467453344449,"acs":10802,"articleLive":2,"columnArticles":219,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.0,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":15593,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6027711732393212,"acs":7352,"articleLive":2,"columnArticles":147,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12197,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6848757050344684,"acs":6557,"articleLive":2,"columnArticles":177,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.0,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9574,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.40950425344675856,"acs":2792,"articleLive":2,"columnArticles":49,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6818,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5190021832295626,"acs":12837,"articleLive":2,"columnArticles":183,"formTitle":"[1417]重新格式化字符串","frequency":0.0,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24734,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7325706518661155,"acs":25870,"articleLive":2,"columnArticles":414,"formTitle":"[1418]点菜展示表","frequency":0.0,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35314,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4188239054010866,"acs":7863,"articleLive":2,"columnArticles":150,"formTitle":"[1419]数青蛙","frequency":0.0,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18774,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5972839506172839,"acs":2419,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":0.0,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4050,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7483570646221248,"acs":2733,"articleLive":2,"columnArticles":33,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","submitted":3652,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5399524498656192,"acs":10447,"articleLive":2,"columnArticles":193,"formTitle":"[1422]分割字符串的最大得分","frequency":0.0,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19348,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5545157433240335,"acs":34782,"articleLive":2,"columnArticles":508,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":62725,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.39796706889377637,"acs":6695,"articleLive":2,"columnArticles":142,"formTitle":"[1424]对角线遍历 II","frequency":0.0,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16823,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43700623700623703,"acs":3153,"articleLive":2,"columnArticles":69,"formTitle":"[1425]带限制的子序列和","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7215,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7093476144109055,"acs":1457,"articleLive":2,"columnArticles":48,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","submitted":2054,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6575922565033273,"acs":1087,"articleLive":2,"columnArticles":44,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","submitted":1653,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5942652329749104,"acs":829,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","submitted":1395,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5047743055555556,"acs":1163,"articleLive":2,"columnArticles":38,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","submitted":2304,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5839662447257384,"acs":692,"articleLive":2,"columnArticles":25,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","submitted":1185,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8462867571624496,"acs":78367,"articleLive":2,"columnArticles":1028,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":92601,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3940588853838065,"acs":4497,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11412,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6442245644224565,"acs":5990,"articleLive":2,"columnArticles":102,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9298,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.46420069584325213,"acs":2535,"articleLive":2,"columnArticles":44,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5461,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6196905339805825,"acs":4085,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","submitted":6592,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8200048565300093,"acs":40523,"articleLive":2,"columnArticles":621,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":49418,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5874193183104971,"acs":10375,"articleLive":2,"columnArticles":175,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":17662,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.48253063383385736,"acs":32842,"articleLive":2,"columnArticles":465,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":0.0,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":68062,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5612785941524011,"acs":3705,"articleLive":2,"columnArticles":57,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6601,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6989389920424404,"acs":2635,"articleLive":2,"columnArticles":35,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","submitted":3770,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6471590703071177,"acs":17848,"articleLive":2,"columnArticles":374,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":27579,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7915970999245249,"acs":34611,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43723,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4100603029857332,"acs":5576,"articleLive":2,"columnArticles":137,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13598,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5250354753699574,"acs":2590,"articleLive":2,"columnArticles":59,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":4933,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8568315537154064,"acs":3932,"articleLive":2,"columnArticles":49,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","submitted":4589,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5731358204207752,"acs":12613,"articleLive":2,"columnArticles":215,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":22007,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6171997902464604,"acs":5885,"articleLive":2,"columnArticles":73,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9535,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7104249962979416,"acs":9595,"articleLive":2,"columnArticles":152,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.0,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":13506,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6278107642214136,"acs":16389,"articleLive":2,"columnArticles":208,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26105,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8025260625501203,"acs":24018,"articleLive":2,"columnArticles":340,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":29928,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5224434341850864,"acs":9998,"articleLive":2,"columnArticles":152,"formTitle":"[1451]重新排列句子中的单词","frequency":0.0,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19137,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.4994101786316144,"acs":5927,"articleLive":2,"columnArticles":89,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11868,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.3643480205770521,"acs":1629,"articleLive":2,"columnArticles":30,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4471,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.397671617824167,"acs":4953,"articleLive":2,"columnArticles":78,"formTitle":"[1454]活跃用户","frequency":0.0,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","submitted":12455,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6329671496046277,"acs":11927,"articleLive":2,"columnArticles":204,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":18843,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5222086469869547,"acs":13250,"articleLive":2,"columnArticles":205,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":25373,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6327217370403012,"acs":7897,"articleLive":2,"columnArticles":136,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12481,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.44232594936708863,"acs":5591,"articleLive":2,"columnArticles":88,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12640,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5952443857331572,"acs":2253,"articleLive":2,"columnArticles":46,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","submitted":3785,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7453601684540424,"acs":15221,"articleLive":2,"columnArticles":309,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":20421,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5005983928876732,"acs":5856,"articleLive":2,"columnArticles":83,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11698,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.42724949934396794,"acs":6187,"articleLive":2,"columnArticles":124,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":14481,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5911907923860115,"acs":2671,"articleLive":2,"columnArticles":63,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4518,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7685371032958083,"acs":26420,"articleLive":2,"columnArticles":366,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.0,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":34377,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.30907580274668883,"acs":6324,"articleLive":2,"columnArticles":79,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20461,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.48429019188135464,"acs":6335,"articleLive":2,"columnArticles":123,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13081,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6173488546751784,"acs":1644,"articleLive":2,"columnArticles":48,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2663,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7086652184407434,"acs":2936,"articleLive":2,"columnArticles":50,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","submitted":4143,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7946396233248822,"acs":2194,"articleLive":2,"columnArticles":83,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","submitted":2761,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8433248971844353,"acs":53315,"articleLive":2,"columnArticles":724,"formTitle":"[1470]重新排列数组","frequency":0.0,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":63220,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5436231669382314,"acs":7340,"articleLive":2,"columnArticles":105,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13502,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6170130272952854,"acs":7957,"articleLive":2,"columnArticles":128,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":12896,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.674496498325286,"acs":15506,"articleLive":2,"columnArticles":164,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":22989,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.718055032039201,"acs":1905,"articleLive":2,"columnArticles":62,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","submitted":2653,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7215233079773746,"acs":14797,"articleLive":2,"columnArticles":229,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":20508,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8649206021860177,"acs":12582,"articleLive":2,"columnArticles":117,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14547,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.28907462686567165,"acs":4842,"articleLive":2,"columnArticles":97,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.0,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":16750,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.57928164695576,"acs":2645,"articleLive":2,"columnArticles":56,"formTitle":"[1478]安排邮筒","frequency":0.0,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4566,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5655111633372503,"acs":1925,"articleLive":2,"columnArticles":39,"formTitle":"[1479]周内每天的销售情况","frequency":0.0,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","submitted":3404,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8692636759930307,"acs":128219,"articleLive":2,"columnArticles":1283,"formTitle":"[1480]一维数组的动态和","frequency":0.0,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":147503,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5142434143353073,"acs":10073,"articleLive":2,"columnArticles":146,"formTitle":"[1481]不同整数的最少数目","frequency":0.0,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":19588,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5866161044449476,"acs":31093,"articleLive":2,"columnArticles":404,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":53004,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.29987328023171617,"acs":3313,"articleLive":2,"columnArticles":69,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11048,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8064182194616977,"acs":779,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","submitted":966,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.66049055937886,"acs":3743,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","submitted":5667,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.85867733527308,"acs":70828,"articleLive":2,"columnArticles":679,"formTitle":"[1486]数组异或操作","frequency":0.0,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":82485,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.3098147099279877,"acs":7658,"articleLive":2,"columnArticles":106,"formTitle":"[1487]保证文件名唯一","frequency":0.0,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24718,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.2364341085271318,"acs":7198,"articleLive":2,"columnArticles":113,"formTitle":"[1488]避免洪水泛滥","frequency":0.0,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":30444,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6917306769083054,"acs":11527,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16664,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8559822747415067,"acs":1159,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","submitted":1354,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.67192952735897,"acs":19832,"articleLive":2,"columnArticles":297,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":29515,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6645691667512432,"acs":6548,"articleLive":2,"columnArticles":79,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":9853,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5671188199540435,"acs":7651,"articleLive":2,"columnArticles":144,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":0.0,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":13491,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3681245858184228,"acs":2222,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":0.0,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6036,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5429362880886427,"acs":3920,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","submitted":7220,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5376147694737882,"acs":10891,"articleLive":2,"columnArticles":165,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":20258,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3905711181444565,"acs":8268,"articleLive":2,"columnArticles":114,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":21169,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33429839799266553,"acs":5196,"articleLive":2,"columnArticles":65,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15543,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.37471846846846846,"acs":2662,"articleLive":2,"columnArticles":58,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7104,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.30055292259083727,"acs":761,"articleLive":2,"columnArticles":27,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","submitted":2532,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5910421545667447,"acs":4038,"articleLive":2,"columnArticles":58,"formTitle":"[1501]可以放心投资的国家","frequency":0.0,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","submitted":6832,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.717279266013479,"acs":25330,"articleLive":2,"columnArticles":303,"formTitle":"[1502]判断能否形成等差数列","frequency":0.0,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":35314,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5127355934244595,"acs":8515,"articleLive":2,"columnArticles":87,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.0,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16607,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5942751467395674,"acs":7391,"articleLive":2,"columnArticles":133,"formTitle":"[1504]统计全 1 子矩形","frequency":0.0,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12437,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3626943005181347,"acs":3290,"articleLive":2,"columnArticles":72,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9071,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8433734939759037,"acs":560,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","submitted":664,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5891240518717886,"acs":9631,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":0.0,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16348,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5526940639269406,"acs":6052,"articleLive":2,"columnArticles":52,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":10950,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5465938303341902,"acs":5103,"articleLive":2,"columnArticles":76,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9336,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.576702591148819,"acs":5030,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.0,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8722,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6783067040026355,"acs":4118,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":0.0,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","submitted":6071,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8488172979248295,"acs":58492,"articleLive":2,"columnArticles":741,"formTitle":"[1512]好数对的数目","frequency":0.0,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":68910,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.3794811807610266,"acs":11030,"articleLive":2,"columnArticles":148,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":29066,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.3209861145755384,"acs":7721,"articleLive":2,"columnArticles":135,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":24054,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.3423039054808008,"acs":3129,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9141,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5777777777777777,"acs":234,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","submitted":405,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7326133909287257,"acs":3392,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","submitted":4630,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6743704913570164,"acs":24773,"articleLive":2,"columnArticles":395,"formTitle":"[1518]换酒问题","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":36735,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2974728069700741,"acs":5497,"articleLive":2,"columnArticles":123,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18479,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33222767679448056,"acs":2504,"articleLive":2,"columnArticles":70,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7537,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.39644792293798914,"acs":2634,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6644,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7080436941410129,"acs":713,"articleLive":2,"columnArticles":28,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","submitted":1007,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5770866095870464,"acs":9908,"articleLive":2,"columnArticles":169,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":17169,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4274348662353558,"acs":4889,"articleLive":2,"columnArticles":100,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.0,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":11438,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6628224206349206,"acs":5345,"articleLive":2,"columnArticles":110,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8064,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6138730595401847,"acs":3124,"articleLive":2,"columnArticles":50,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5089,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5039738858927051,"acs":3551,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","submitted":7046,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7849567071084559,"acs":29826,"articleLive":2,"columnArticles":356,"formTitle":"[1528]重新排列字符串","frequency":0.0,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":37997,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6900662251655629,"acs":8857,"articleLive":2,"columnArticles":134,"formTitle":"[1529]灯泡开关 IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12835,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.566719098178005,"acs":8647,"articleLive":2,"columnArticles":146,"formTitle":"[1530]好叶子节点对的数量","frequency":0.0,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15258,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.32807457870204376,"acs":1830,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":0.0,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5578,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6138888888888889,"acs":2652,"articleLive":2,"columnArticles":48,"formTitle":"[1532]最近的三笔订单","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","submitted":4320,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6160520607375272,"acs":284,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","submitted":461,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.789658680973083,"acs":17074,"articleLive":2,"columnArticles":159,"formTitle":"[1534]统计好三元组","frequency":0.0,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21622,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4530354507704451,"acs":13201,"articleLive":2,"columnArticles":182,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.0,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29139,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.43986217292990204,"acs":4085,"articleLive":2,"columnArticles":78,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9287,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3656402212498968,"acs":4429,"articleLive":2,"columnArticles":88,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12113,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.61,"acs":122,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","submitted":200,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5391114203359507,"acs":16272,"articleLive":2,"columnArticles":246,"formTitle":"[1539]第 k 个缺失的正整数","frequency":0.0,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":30183,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.31757289204097716,"acs":4836,"articleLive":2,"columnArticles":85,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15228,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4603434816549571,"acs":5897,"articleLive":2,"columnArticles":92,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12810,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.3818915980742351,"acs":2459,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6439,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5512601857115785,"acs":2909,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","submitted":5277,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5459015027360351,"acs":19653,"articleLive":2,"columnArticles":319,"formTitle":"[1544]整理字符串","frequency":0.0,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":36001,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5533966182141797,"acs":7462,"articleLive":2,"columnArticles":100,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.0,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13484,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4140178643276736,"acs":5145,"articleLive":2,"columnArticles":78,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12427,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5366112956810631,"acs":4038,"articleLive":2,"columnArticles":70,"formTitle":"[1547]切棍子的最小成本","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7525,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7148760330578512,"acs":346,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","submitted":484,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6698921758363284,"acs":2423,"articleLive":2,"columnArticles":47,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","submitted":3617,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6594180322761543,"acs":21166,"articleLive":2,"columnArticles":289,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":32098,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8163789937568858,"acs":11115,"articleLive":2,"columnArticles":152,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13615,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5103327890083901,"acs":9063,"articleLive":2,"columnArticles":123,"formTitle":"[1552]两球之间的磁力","frequency":0.0,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17759,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.2954771943273285,"acs":7709,"articleLive":2,"columnArticles":122,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":0.0,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26090,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7090163934426229,"acs":519,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","submitted":732,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.437719298245614,"acs":2994,"articleLive":2,"columnArticles":56,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","submitted":6840,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5786640831045804,"acs":10751,"articleLive":2,"columnArticles":163,"formTitle":"[1556]千位分隔数","frequency":0.0,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":18579,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7677861685214626,"acs":7727,"articleLive":2,"columnArticles":104,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":10064,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6225017470300489,"acs":4454,"articleLive":2,"columnArticles":68,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.0,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7155,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.36644968519901827,"acs":3434,"articleLive":2,"columnArticles":61,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":9371,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5744709349049022,"acs":8578,"articleLive":2,"columnArticles":90,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":14932,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7799581900330433,"acs":11566,"articleLive":2,"columnArticles":164,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.0,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":14829,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3092873831775701,"acs":4236,"articleLive":2,"columnArticles":86,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13696,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3766321044546851,"acs":3923,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10416,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5385266723116003,"acs":636,"articleLive":2,"columnArticles":24,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","submitted":1181,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7239277652370203,"acs":3207,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","submitted":4430,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4454895738893926,"acs":7862,"articleLive":2,"columnArticles":120,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.0,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17648,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.39685530504840494,"acs":12216,"articleLive":2,"columnArticles":198,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.0,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":30782,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45538900785153463,"acs":2552,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5604,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47323290845886445,"acs":2042,"articleLive":2,"columnArticles":45,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4315,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.9001135073779796,"acs":1586,"articleLive":2,"columnArticles":37,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","submitted":1762,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7585278276481149,"acs":3380,"articleLive":2,"columnArticles":42,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","submitted":4456,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8049711571089243,"acs":18978,"articleLive":2,"columnArticles":318,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.0,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":23576,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2955832389580974,"acs":4437,"articleLive":2,"columnArticles":65,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15011,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.32637833356363133,"acs":4724,"articleLive":2,"columnArticles":82,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.0,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14474,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5968654767087506,"acs":4113,"articleLive":2,"columnArticles":66,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":6891,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47658938718885896,"acs":17864,"articleLive":2,"columnArticles":251,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":37483,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.324878919194494,"acs":5098,"articleLive":2,"columnArticles":79,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.0,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15692,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5822348953569699,"acs":10822,"articleLive":2,"columnArticles":202,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18587,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6189376443418014,"acs":16080,"articleLive":2,"columnArticles":294,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":25980,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6342042755344418,"acs":267,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","submitted":421,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8087201125175809,"acs":3450,"articleLive":2,"columnArticles":45,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","submitted":4266,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.670682446318475,"acs":9464,"articleLive":2,"columnArticles":108,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.0,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14111,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6852887090842221,"acs":18633,"articleLive":2,"columnArticles":242,"formTitle":"[1583]统计不开心的朋友","frequency":0.0,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27190,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6642386314088589,"acs":25898,"articleLive":2,"columnArticles":327,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":38989,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.42999456620177506,"acs":2374,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5521,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6180904522613065,"acs":369,"articleLive":2,"columnArticles":23,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","submitted":597,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8240250361097737,"acs":3423,"articleLive":2,"columnArticles":41,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","submitted":4154,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8393158783783784,"acs":43725,"articleLive":2,"columnArticles":694,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.0,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":52096,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.29329952358998,"acs":3817,"articleLive":2,"columnArticles":56,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13014,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2668903803131991,"acs":3579,"articleLive":2,"columnArticles":56,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.0,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13410,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5783132530120482,"acs":1104,"articleLive":2,"columnArticles":32,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1909,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.444644412191582,"acs":7659,"articleLive":2,"columnArticles":126,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17225,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5309831181727904,"acs":5347,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.0,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10070,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3140919366993218,"acs":4168,"articleLive":2,"columnArticles":99,"formTitle":"[1594]矩阵的最大非负积","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13270,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4642152023692004,"acs":1881,"articleLive":2,"columnArticles":39,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4052,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7537831021437579,"acs":2391,"articleLive":2,"columnArticles":39,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","submitted":3172,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6628175519630485,"acs":287,"articleLive":2,"columnArticles":20,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"lock","submitted":433,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6718232044198895,"acs":10944,"articleLive":2,"columnArticles":148,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16290,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4195408551844195,"acs":3856,"articleLive":2,"columnArticles":69,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9191,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6788994521430873,"acs":16853,"articleLive":2,"columnArticles":205,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24824,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.48951048951048953,"acs":2170,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4433,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7868663594470046,"acs":683,"articleLive":2,"columnArticles":29,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","submitted":868,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8444708503527665,"acs":56854,"articleLive":2,"columnArticles":455,"formTitle":"[1603]设计停车系统","frequency":0.0,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":67325,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4155454242188369,"acs":3737,"articleLive":2,"columnArticles":63,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":8993,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7346053772766695,"acs":3388,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4612,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.34070330595914927,"acs":1618,"articleLive":2,"columnArticles":33,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4749,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5452445128994994,"acs":2832,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","submitted":5194,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6389891696750902,"acs":9735,"articleLive":2,"columnArticles":161,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15235,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.512072795013255,"acs":7147,"articleLive":2,"columnArticles":122,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":13957,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.27076566125290025,"acs":2334,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8620,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6101694915254238,"acs":2088,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3422,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7342192691029901,"acs":442,"articleLive":2,"columnArticles":20,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","submitted":602,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7220026350461133,"acs":1644,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","submitted":2277,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8209867488142389,"acs":16790,"articleLive":2,"columnArticles":285,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":20451,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.4959174096668231,"acs":5284,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10655,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.27559185475415265,"acs":4994,"articleLive":2,"columnArticles":93,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.0,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18121,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6198435277382646,"acs":1743,"articleLive":2,"columnArticles":32,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2812,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5946969696969697,"acs":314,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","submitted":528,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6742704100480237,"acs":7301,"articleLive":2,"columnArticles":128,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10828,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3716277659896938,"acs":2452,"articleLive":2,"columnArticles":42,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6598,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.43859649122807015,"acs":1750,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":3990,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14910681735326284,"acs":2454,"articleLive":2,"columnArticles":54,"formTitle":"[1622]奇妙序列","frequency":0.0,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":16458,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7825080981027303,"acs":3382,"articleLive":2,"columnArticles":43,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","submitted":4322,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6257840871574777,"acs":11373,"articleLive":2,"columnArticles":196,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.0,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":18174,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5428040854224698,"acs":2923,"articleLive":2,"columnArticles":66,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5385,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.386001386001386,"acs":3899,"articleLive":2,"columnArticles":84,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10101,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.38044666562548807,"acs":2436,"articleLive":2,"columnArticles":37,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6403,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8431372549019608,"acs":387,"articleLive":2,"columnArticles":18,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","submitted":459,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5234519187933558,"acs":8225,"articleLive":2,"columnArticles":98,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":15713,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7695194412592515,"acs":7382,"articleLive":2,"columnArticles":114,"formTitle":"[1630]等差子数组","frequency":0.0,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9593,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.492978985918803,"acs":25172,"articleLive":2,"columnArticles":299,"formTitle":"[1631]最小体力消耗路径","frequency":0.0,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":51061,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31819169745707454,"acs":1464,"articleLive":2,"columnArticles":26,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4601,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6552650867334473,"acs":2682,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","submitted":4093,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5265151515151515,"acs":417,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","submitted":792,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5464114832535886,"acs":1142,"articleLive":2,"columnArticles":31,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","submitted":2090,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7068883984867591,"acs":8969,"articleLive":2,"columnArticles":172,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.0,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12688,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.806838905775076,"acs":5309,"articleLive":2,"columnArticles":70,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6580,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7104325699745547,"acs":2792,"articleLive":2,"columnArticles":47,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3930,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.40339634732457547,"acs":1259,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3121,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6606124051295472,"acs":12621,"articleLive":2,"columnArticles":216,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":19105,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7705190488366147,"acs":12054,"articleLive":2,"columnArticles":277,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":0.0,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15644,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4513893749562539,"acs":6449,"articleLive":2,"columnArticles":106,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14287,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4516193924763629,"acs":2245,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":4971,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5444388014220416,"acs":1072,"articleLive":2,"columnArticles":22,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","submitted":1969,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4132841328413284,"acs":784,"articleLive":2,"columnArticles":24,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","submitted":1897,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5368893011750154,"acs":34726,"articleLive":2,"columnArticles":354,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":64680,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5138770281810419,"acs":7221,"articleLive":2,"columnArticles":107,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.0,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":14052,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2773088979985532,"acs":3450,"articleLive":2,"columnArticles":89,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.0,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12441,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4733893557422969,"acs":2535,"articleLive":2,"columnArticles":64,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5355,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7935356200527705,"acs":1203,"articleLive":2,"columnArticles":28,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.0,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","submitted":1516,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6804788213627992,"acs":739,"articleLive":2,"columnArticles":23,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","submitted":1086,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6579023126379426,"acs":6856,"articleLive":2,"columnArticles":176,"formTitle":"[1652]拆炸弹","frequency":0.0,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":10421,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.505939226519337,"acs":3663,"articleLive":2,"columnArticles":86,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7240,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2735781137508999,"acs":3420,"articleLive":2,"columnArticles":49,"formTitle":"[1654]到家的最少跳跃次数","frequency":0.0,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":12501,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.38308457711442784,"acs":2002,"articleLive":2,"columnArticles":32,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5226,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7814503205128205,"acs":7802,"articleLive":2,"columnArticles":92,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":9984,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.4644683026584867,"acs":5451,"articleLive":2,"columnArticles":76,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.0,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11736,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.29919119146333173,"acs":8804,"articleLive":2,"columnArticles":150,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":29426,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4115112342259157,"acs":1337,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3249,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7396226415094339,"acs":392,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","submitted":530,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7260034904013961,"acs":2496,"articleLive":2,"columnArticles":53,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.0,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","submitted":3438,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8119779915291138,"acs":20513,"articleLive":2,"columnArticles":282,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":25263,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5727914663461539,"acs":7625,"articleLive":2,"columnArticles":131,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13312,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5448737450562823,"acs":5373,"articleLive":2,"columnArticles":106,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9861,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6644753802526424,"acs":5155,"articleLive":2,"columnArticles":80,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7758,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6960227272727273,"acs":245,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","submitted":352,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6026434195725534,"acs":2143,"articleLive":2,"columnArticles":32,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","submitted":3556,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4424389603570491,"acs":6741,"articleLive":2,"columnArticles":128,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":15236,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7581933023477535,"acs":12724,"articleLive":2,"columnArticles":233,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":16782,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5265844851201594,"acs":4229,"articleLive":2,"columnArticles":76,"formTitle":"[1670]设计前中后队列","frequency":0.0,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":8031,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46634504939122445,"acs":2030,"articleLive":2,"columnArticles":40,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.0,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4353,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8506448972367868,"acs":38450,"articleLive":2,"columnArticles":441,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":45201,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.3530022658610272,"acs":7478,"articleLive":2,"columnArticles":167,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21184,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.36355672360928604,"acs":2490,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.0,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6849,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.43611670020120724,"acs":2601,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":5964,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7629558541266794,"acs":795,"articleLive":2,"columnArticles":21,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","submitted":1042,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.3903690546674561,"acs":1978,"articleLive":2,"columnArticles":32,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","submitted":5067,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8306640531624994,"acs":17375,"articleLive":2,"columnArticles":281,"formTitle":"[1678]设计 Goal 解析器","frequency":0.0,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":20917,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4964671953857246,"acs":6886,"articleLive":2,"columnArticles":109,"formTitle":"[1679]K 和数对的最大数目","frequency":0.0,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":13870,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4644120438271072,"acs":5383,"articleLive":2,"columnArticles":71,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11591,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3845654993514916,"acs":2372,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6168,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5238095238095238,"acs":319,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","submitted":609,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8954794878494905,"acs":3427,"articleLive":2,"columnArticles":36,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","submitted":3827,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8279654747225648,"acs":16787,"articleLive":2,"columnArticles":353,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":20275,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.599967277486911,"acs":3667,"articleLive":2,"columnArticles":84,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6112,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.47023916561769463,"acs":2615,"articleLive":2,"columnArticles":48,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5561,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.40262489415749364,"acs":951,"articleLive":2,"columnArticles":21,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2362,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.805430232085518,"acs":19816,"articleLive":2,"columnArticles":265,"formTitle":"[1688]比赛中的配对次数","frequency":0.0,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":24603,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8668373117447468,"acs":14562,"articleLive":2,"columnArticles":190,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":16799,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5182297913168625,"acs":4321,"articleLive":2,"columnArticles":106,"formTitle":"[1690]石子游戏 VII","frequency":0.0,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8338,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.48821277453153333,"acs":2423,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":4963,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6407407407407407,"acs":173,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","submitted":270,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8037585833032165,"acs":2224,"articleLive":2,"columnArticles":33,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","submitted":2767,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6356211846229995,"acs":7705,"articleLive":2,"columnArticles":137,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12122,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.46101364522417154,"acs":6149,"articleLive":2,"columnArticles":130,"formTitle":"[1695]删除子数组的最大得分","frequency":0.0,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":13338,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.3978078658929723,"acs":6170,"articleLive":2,"columnArticles":110,"formTitle":"[1696]跳跃游戏 VI","frequency":0.0,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":15510,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5256782945736435,"acs":2170,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4128,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.540162980209546,"acs":464,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","submitted":859,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.7975206611570248,"acs":1737,"articleLive":2,"columnArticles":41,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","submitted":2178,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7113130395274875,"acs":7828,"articleLive":2,"columnArticles":180,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.0,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":11005,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6100599180069379,"acs":3869,"articleLive":2,"columnArticles":79,"formTitle":"[1701]平均等待时间","frequency":0.0,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6342,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4769105691056911,"acs":2933,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6150,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3844759891271519,"acs":1273,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3311,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7816211305081446,"acs":12044,"articleLive":2,"columnArticles":182,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":15409,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.34705167173252277,"acs":5709,"articleLive":2,"columnArticles":118,"formTitle":"[1705]吃苹果的最大数目","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16450,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5844031685331876,"acs":4279,"articleLive":2,"columnArticles":111,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7322,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5030788396511835,"acs":14134,"articleLive":2,"columnArticles":150,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28095,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6981132075471698,"acs":925,"articleLive":2,"columnArticles":25,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","submitted":1325,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.716030534351145,"acs":1407,"articleLive":2,"columnArticles":36,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","submitted":1965,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6938985929160602,"acs":11441,"articleLive":2,"columnArticles":184,"formTitle":"[1710]卡车上的最大单元数","frequency":0.0,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":16488,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3589642528694447,"acs":30055,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":0.0,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":83727,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.2628549823559066,"acs":6257,"articleLive":2,"columnArticles":104,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":23804,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.49633018778000193,"acs":15621,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":0.0,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31473,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6380697050938338,"acs":238,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"lock","submitted":373,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.733510402833112,"acs":1657,"articleLive":2,"columnArticles":36,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","submitted":2259,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6739398929600658,"acs":8185,"articleLive":2,"columnArticles":191,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":12145,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43231961836613,"acs":2175,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5031,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4892432295621362,"acs":1933,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":3951,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.368141592920354,"acs":624,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1695,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8693435309114086,"acs":46376,"articleLive":2,"columnArticles":486,"formTitle":"[1720]解码异或后的数组","frequency":0.0,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53346,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6454523434661499,"acs":10659,"articleLive":2,"columnArticles":165,"formTitle":"[1721]交换链表中的节点","frequency":0.0,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":16514,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5144880174291939,"acs":4723,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9180,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5066034022827656,"acs":23169,"articleLive":2,"columnArticles":175,"formTitle":"[1723]完成所有工作的最短时间","frequency":0.0,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":45734,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5604026845637584,"acs":334,"articleLive":2,"columnArticles":10,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"lock","submitted":596,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.787936882465713,"acs":10686,"articleLive":2,"columnArticles":143,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13562,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.47975267787163633,"acs":5509,"articleLive":2,"columnArticles":107,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11483,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5750928113398582,"acs":3408,"articleLive":2,"columnArticles":83,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5926,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.35813652539631186,"acs":1107,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3091,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6214306741242273,"acs":2111,"articleLive":2,"columnArticles":22,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","submitted":3397,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5295154185022026,"acs":601,"articleLive":2,"columnArticles":23,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","submitted":1135,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.46976866456361727,"acs":1787,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","submitted":3804,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7926394402206822,"acs":11781,"articleLive":2,"columnArticles":203,"formTitle":"[1732]找到最高海拔","frequency":0.0,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":14863,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4575461454940282,"acs":2107,"articleLive":2,"columnArticles":54,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4605,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7231024127575851,"acs":27932,"articleLive":2,"columnArticles":366,"formTitle":"[1734]解码异或后的排列","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38628,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4871306005719733,"acs":1022,"articleLive":2,"columnArticles":25,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2098,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4491063266399773,"acs":28494,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":0.0,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":63446,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3099551414768806,"acs":3593,"articleLive":2,"columnArticles":102,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11592,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6539240506329114,"acs":28413,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43450,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4704748554406869,"acs":2685,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5707,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.705955334987593,"acs":569,"articleLive":2,"columnArticles":19,"formTitle":"[1740]找到二叉树中的距离","frequency":0.0,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","submitted":806,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8412035102381947,"acs":2013,"articleLive":2,"columnArticles":31,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","submitted":2393,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7085160202360877,"acs":8403,"articleLive":2,"columnArticles":129,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11860,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6967977300364816,"acs":22347,"articleLive":2,"columnArticles":326,"formTitle":"[1743]从相邻元素对还原数组","frequency":0.0,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32071,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3627794236466469,"acs":28287,"articleLive":2,"columnArticles":368,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":77973,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4850940665701881,"acs":3352,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":6910,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5908408408408409,"acs":787,"articleLive":2,"columnArticles":32,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","submitted":1332,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7075575027382256,"acs":1292,"articleLive":2,"columnArticles":34,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","submitted":1826,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7498463009768427,"acs":10977,"articleLive":2,"columnArticles":221,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":14639,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5316196874543596,"acs":3640,"articleLive":2,"columnArticles":84,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6847,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4571791972866026,"acs":3235,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7076,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.47089487402258906,"acs":2168,"articleLive":2,"columnArticles":33,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.0,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4604,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6817393816815949,"acs":9438,"articleLive":2,"columnArticles":111,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":13844,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6298646362098139,"acs":5956,"articleLive":2,"columnArticles":127,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9456,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.42152602324406263,"acs":4171,"articleLive":2,"columnArticles":90,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.0,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":9895,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.40145361265498075,"acs":2817,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.0,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":7017,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7931034482758621,"acs":368,"articleLive":2,"columnArticles":13,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","submitted":464,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9210687960687961,"acs":2999,"articleLive":2,"columnArticles":31,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","submitted":3256,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6378354203935599,"acs":7131,"articleLive":2,"columnArticles":114,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11180,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.42893234771217364,"acs":4584,"articleLive":2,"columnArticles":95,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10687,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5387008945935434,"acs":4155,"articleLive":2,"columnArticles":77,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7713,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.42902524661427854,"acs":2566,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.0,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":5981,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6935300794551645,"acs":611,"articleLive":2,"columnArticles":21,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","submitted":881,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.609436237564064,"acs":4043,"articleLive":2,"columnArticles":79,"formTitle":"[1763]最长的美好子字符串","frequency":0.0,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":6634,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.47549723190485954,"acs":2319,"articleLive":2,"columnArticles":55,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4877,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.551618346372143,"acs":3596,"articleLive":2,"columnArticles":82,"formTitle":"[1765]地图中的最高点","frequency":0.0,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6519,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37530136619341015,"acs":1401,"articleLive":2,"columnArticles":26,"formTitle":"[1766]互质树","frequency":0.0,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3733,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7872954764196343,"acs":818,"articleLive":2,"columnArticles":21,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","submitted":1039,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7648330855521016,"acs":11318,"articleLive":2,"columnArticles":201,"formTitle":"[1768]交替合并字符串","frequency":0.0,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":14798,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8559835995558213,"acs":10021,"articleLive":2,"columnArticles":168,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11707,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.3700170970934941,"acs":4112,"articleLive":2,"columnArticles":102,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11113,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3656505342551854,"acs":2327,"articleLive":2,"columnArticles":47,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6364,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5152905198776758,"acs":337,"articleLive":2,"columnArticles":11,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","submitted":654,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8425862342190059,"acs":15951,"articleLive":2,"columnArticles":198,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":18931,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5510392609699769,"acs":5965,"articleLive":2,"columnArticles":90,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10825,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4741004790018937,"acs":4256,"articleLive":2,"columnArticles":92,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":8977,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4640021175224987,"acs":1753,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":0.0,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3778,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7813651776500073,"acs":5300,"articleLive":2,"columnArticles":61,"formTitle":"[1777]每家商店的产品价格","frequency":0.0,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","submitted":6783,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5145348837209303,"acs":177,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","submitted":344,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6467507736253273,"acs":5434,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.0,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8402,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6651944546681389,"acs":5422,"articleLive":2,"columnArticles":110,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8151,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5186933775679469,"acs":4065,"articleLive":2,"columnArticles":60,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7837,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2914020517830972,"acs":1193,"articleLive":2,"columnArticles":33,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4094,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7984972677595629,"acs":1169,"articleLive":2,"columnArticles":29,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","submitted":1464,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42135559073247947,"acs":8784,"articleLive":2,"columnArticles":101,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":20847,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.3492691504560941,"acs":6356,"articleLive":2,"columnArticles":62,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18198,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3414143446333367,"acs":3394,"articleLive":2,"columnArticles":88,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9941,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541692162207264,"acs":11760,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":0.0,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":17977,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.7133550488599348,"acs":219,"articleLive":2,"columnArticles":16,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","submitted":307,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7109227871939736,"acs":1510,"articleLive":2,"columnArticles":30,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","submitted":2124,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6455558306511513,"acs":13037,"articleLive":2,"columnArticles":143,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":20195,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8099193946372759,"acs":9847,"articleLive":2,"columnArticles":136,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":12158,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5134753995612661,"acs":6554,"articleLive":2,"columnArticles":104,"formTitle":"[1792]最大平均通过率","frequency":0.0,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12764,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4134953629677007,"acs":3879,"articleLive":2,"columnArticles":93,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9381,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5763888888888888,"acs":166,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","submitted":288,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7871873628784555,"acs":1794,"articleLive":2,"columnArticles":28,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.0,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","submitted":2279,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48764044943820223,"acs":6510,"articleLive":2,"columnArticles":121,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":13350,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5730759264058046,"acs":4423,"articleLive":2,"columnArticles":71,"formTitle":"[1797]设计一个验证系统","frequency":0.0,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":7718,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5220588235294118,"acs":3053,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5848,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5186252771618626,"acs":2339,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.0,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4510,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6835595137121855,"acs":9671,"articleLive":2,"columnArticles":155,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":14148,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.3770885258007939,"acs":4085,"articleLive":2,"columnArticles":109,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10833,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2625275764260952,"acs":4165,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":15865,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.4089060987415295,"acs":2112,"articleLive":2,"columnArticles":54,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5165,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5701530612244898,"acs":447,"articleLive":2,"columnArticles":26,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","submitted":784,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.48903489687581586,"acs":11239,"articleLive":2,"columnArticles":147,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":22982,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6631050463439753,"acs":5151,"articleLive":2,"columnArticles":81,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7768,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5857451848800083,"acs":5687,"articleLive":2,"columnArticles":87,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9709,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.26757619100011004,"acs":2432,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9089,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6279333838001514,"acs":1659,"articleLive":2,"columnArticles":31,"formTitle":"[1809]没有广告的剧集","frequency":0.0,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","submitted":2642,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6232876712328768,"acs":182,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","submitted":292,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6595407759303247,"acs":833,"articleLive":2,"columnArticles":27,"formTitle":"[1811]寻找面试候选人","frequency":0.0,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","submitted":1263,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.793823705776534,"acs":7943,"articleLive":2,"columnArticles":186,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":10006,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5138137557959814,"acs":5319,"articleLive":2,"columnArticles":72,"formTitle":"[1813]句子相似性 III","frequency":0.0,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10352,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.34352711284807036,"acs":3516,"articleLive":2,"columnArticles":79,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10235,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.30039956411187796,"acs":1654,"articleLive":2,"columnArticles":38,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5506,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7526496601125648,"acs":10297,"articleLive":2,"columnArticles":151,"formTitle":"[1816]截断句子","frequency":0.0,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":13681,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.697250939849624,"acs":5935,"articleLive":2,"columnArticles":96,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8512,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37398054293370614,"acs":25679,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":0.0,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":68664,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.36704418567554636,"acs":2301,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6269,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5128205128205128,"acs":100,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","submitted":195,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9014722536806342,"acs":2388,"articleLive":2,"columnArticles":21,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","submitted":2649,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8105555782674462,"acs":19827,"articleLive":2,"columnArticles":197,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":24461,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7126356925749023,"acs":8206,"articleLive":2,"columnArticles":103,"formTitle":"[1823]找出游戏的获胜者","frequency":0.0,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":11515,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6572110060482154,"acs":7715,"articleLive":2,"columnArticles":153,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11739,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.28591595178629603,"acs":2633,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9209,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.43782837127845886,"acs":250,"articleLive":2,"columnArticles":20,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","submitted":571,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7949112021857924,"acs":9310,"articleLive":2,"columnArticles":137,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":11712,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8681019830028328,"acs":7661,"articleLive":2,"columnArticles":101,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8825,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6823123382226057,"acs":3954,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5795,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4863325740318907,"acs":854,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1756,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7386070507308684,"acs":859,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","submitted":1163,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8236067626800251,"acs":13153,"articleLive":2,"columnArticles":210,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":15970,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6847171324766833,"acs":43535,"articleLive":2,"columnArticles":389,"formTitle":"[1833]雪糕的最大数量","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":63581,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3515992614211686,"acs":5903,"articleLive":2,"columnArticles":127,"formTitle":"[1834]单线程 CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":16789,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5092474939997176,"acs":3607,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.0,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7083,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7096774193548387,"acs":396,"articleLive":2,"columnArticles":27,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.0,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","submitted":558,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7961286294099282,"acs":7650,"articleLive":2,"columnArticles":86,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9609,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42936168309302636,"acs":28796,"articleLive":2,"columnArticles":307,"formTitle":"[1838]最高频元素的频数","frequency":0.0,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":67067,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5751065340909091,"acs":6478,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11264,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3888999403222598,"acs":1955,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5027,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5132743362831859,"acs":870,"articleLive":2,"columnArticles":28,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","submitted":1695,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6707317073170732,"acs":110,"articleLive":2,"columnArticles":11,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","submitted":164,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5045342126957956,"acs":612,"articleLive":2,"columnArticles":22,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","submitted":1213,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.7995274660366214,"acs":6768,"articleLive":2,"columnArticles":110,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":8465,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5383772853652372,"acs":6390,"articleLive":2,"columnArticles":61,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":11869,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.633646495348623,"acs":27518,"articleLive":2,"columnArticles":376,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":0.0,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43428,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.36123621680385154,"acs":2326,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.0,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6439,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6828272065352513,"acs":7690,"articleLive":2,"columnArticles":99,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11262,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3287469865349562,"acs":5591,"articleLive":2,"columnArticles":108,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.0,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17007,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6077975729408727,"acs":2354,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.0,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3873,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40320616883116883,"acs":1987,"articleLive":2,"columnArticles":48,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4928,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7176470588235294,"acs":183,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","submitted":255,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6466453674121406,"acs":1012,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","submitted":1565,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7896241830065359,"acs":11598,"articleLive":2,"columnArticles":120,"formTitle":"[1854]人口最多的年份","frequency":0.0,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":14688,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6821892756841487,"acs":10445,"articleLive":2,"columnArticles":99,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15311,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35610899975741894,"acs":4404,"articleLive":2,"columnArticles":83,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.0,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12367,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.45118898623279097,"acs":2163,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4794,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6262230919765166,"acs":320,"articleLive":2,"columnArticles":16,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","submitted":511,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7675155631013016,"acs":6781,"articleLive":2,"columnArticles":145,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":8835,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.77256038647343,"acs":3998,"articleLive":2,"columnArticles":66,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5175,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6181205540995882,"acs":3302,"articleLive":2,"columnArticles":67,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5342,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3117993273542601,"acs":2225,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7136,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9084246426239024,"acs":12519,"articleLive":2,"columnArticles":141,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.0,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":13781,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3875755421258443,"acs":4361,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.0,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11252,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5134264232008593,"acs":5258,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10241,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5975148568341437,"acs":2212,"articleLive":2,"columnArticles":49,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":0.0,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3702,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7457627118644068,"acs":484,"articleLive":2,"columnArticles":14,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","submitted":649,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5361216730038023,"acs":141,"articleLive":2,"columnArticles":11,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"lock","submitted":263,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7891810856393279,"acs":12634,"articleLive":2,"columnArticles":139,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.0,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":16009,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.45671933142194837,"acs":7487,"articleLive":2,"columnArticles":70,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.0,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16393,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2764186046511628,"acs":5943,"articleLive":2,"columnArticles":126,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":21500,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6211699164345403,"acs":2007,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3231,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.808502024291498,"acs":1997,"articleLive":2,"columnArticles":32,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","submitted":2470,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8892307692307693,"acs":289,"articleLive":2,"columnArticles":18,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","submitted":325,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7476459510357816,"acs":397,"articleLive":2,"columnArticles":18,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","submitted":531,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7279862644101055,"acs":5936,"articleLive":2,"columnArticles":93,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":8154,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8205420298301852,"acs":30973,"articleLive":2,"columnArticles":400,"formTitle":"[1877]数组中最大数对和的最小值","frequency":0.0,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":37747,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.4285426731078905,"acs":2129,"articleLive":2,"columnArticles":55,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":4968,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.4122905027932961,"acs":1845,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4475,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7714076092652762,"acs":7360,"articleLive":2,"columnArticles":98,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":9541,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.35320452403393027,"acs":5996,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":16976,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2782708492731446,"acs":3637,"articleLive":2,"columnArticles":109,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13070,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.37491877842755034,"acs":1731,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4617,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6887565152643336,"acs":1850,"articleLive":2,"columnArticles":37,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":0.0,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":2686,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5188470066518847,"acs":234,"articleLive":2,"columnArticles":11,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"lock","submitted":451,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5714133105437453,"acs":5349,"articleLive":2,"columnArticles":77,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.0,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9361,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6453451551614946,"acs":5095,"articleLive":2,"columnArticles":64,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7895,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3165575089049753,"acs":2755,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8703,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.26992519989682745,"acs":2093,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.0,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7754,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7038167938931298,"acs":922,"articleLive":2,"columnArticles":20,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","submitted":1310,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.4672897196261682,"acs":250,"articleLive":2,"columnArticles":10,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","submitted":535,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3326133909287257,"acs":462,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","submitted":1389,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5916083916083916,"acs":31302,"articleLive":2,"columnArticles":409,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":0.0,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":52910,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.4582440848366288,"acs":37011,"articleLive":2,"columnArticles":512,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":80767,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.530346444386559,"acs":2036,"articleLive":2,"columnArticles":39,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3839,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5063063063063064,"acs":843,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1665,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5306696200374851,"acs":6229,"articleLive":2,"columnArticles":78,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.0,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11738,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.30947288006111534,"acs":4051,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13090,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6301416623997269,"acs":3692,"articleLive":2,"columnArticles":42,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5859,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.43472173608680437,"acs":1242,"articleLive":2,"columnArticles":34,"formTitle":"[1900]最佳运动员的比拼回合","frequency":0.0,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2857,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6588785046728972,"acs":705,"articleLive":2,"columnArticles":26,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":1070,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.43859649122807015,"acs":75,"articleLive":2,"columnArticles":3,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"lock","submitted":171,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6432266549758878,"acs":7336,"articleLive":2,"columnArticles":101,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":11405,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.278211555847785,"acs":3385,"articleLive":2,"columnArticles":69,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":12167,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5702408607409218,"acs":4664,"articleLive":2,"columnArticles":91,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":8179,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4239204934886909,"acs":2474,"articleLive":2,"columnArticles":55,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.0,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5836,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.592020592020592,"acs":460,"articleLive":2,"columnArticles":17,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","submitted":777,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6541666666666667,"acs":157,"articleLive":2,"columnArticles":7,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","submitted":240,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.32561783348764334,"acs":4572,"articleLive":2,"columnArticles":72,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.0,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":14041,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.674392523364486,"acs":3608,"articleLive":2,"columnArticles":56,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5350,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.571072319201995,"acs":3206,"articleLive":2,"columnArticles":69,"formTitle":"[1911]最大子序列交替和","frequency":0.0,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5614,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2723964650840409,"acs":1572,"articleLive":2,"columnArticles":38,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":5771,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8386389729673311,"acs":8035,"articleLive":2,"columnArticles":82,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.0,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":9581,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.44072657743785854,"acs":3227,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.0,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7322,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.39108227498619547,"acs":2833,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7244,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5509433962264151,"acs":1168,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2120,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.28369565217391307,"acs":261,"articleLive":2,"columnArticles":10,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"lock","submitted":920,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.47876447876447875,"acs":124,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","submitted":259,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3942307692307692,"acs":369,"articleLive":2,"columnArticles":12,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"lock","submitted":936,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9181991122384274,"acs":10136,"articleLive":2,"columnArticles":88,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":11039,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.34438375086331385,"acs":5485,"articleLive":2,"columnArticles":90,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.0,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":15927,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3607148455870826,"acs":4602,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.0,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12758,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23711671215283353,"acs":1477,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":0.0,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6229,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.39705882352941174,"acs":54,"articleLive":2,"columnArticles":4,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"lock","submitted":136,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6985083622118426,"acs":4636,"articleLive":2,"columnArticles":58,"formTitle":"[1925]统计平方和三元组的数目","frequency":0.0,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":6637,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.34364726358538,"acs":3554,"articleLive":2,"columnArticles":59,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10342,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4127810650887574,"acs":1744,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":0.0,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4225,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.3956615274291861,"acs":2207,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":0.0,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5578,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9167950693374423,"acs":11900,"articleLive":2,"columnArticles":106,"formTitle":"[1929]数组串联","frequency":0.0,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":12980,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4784354810546534,"acs":5480,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.0,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11454,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5583911234396671,"acs":2013,"articleLive":2,"columnArticles":62,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.0,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3605,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3269113149847095,"acs":1069,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.0,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3270,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5437262357414449,"acs":429,"articleLive":2,"columnArticles":24,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"lock","submitted":789,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7478991596638656,"acs":267,"articleLive":2,"columnArticles":10,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","submitted":357,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7392419175027871,"acs":6631,"articleLive":2,"columnArticles":93,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":8970,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.4500201369311317,"acs":5587,"articleLive":2,"columnArticles":63,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12415,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.2419604205318491,"acs":3130,"articleLive":2,"columnArticles":63,"formTitle":"[1937]扣分后的最大得分","frequency":0.0,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":12936,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3430232558139535,"acs":1121,"articleLive":2,"columnArticles":41,"formTitle":"[1938]查询最大基因差","frequency":0.0,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3268,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6242424242424243,"acs":412,"articleLive":2,"columnArticles":13,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"lock","submitted":660,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.801762114537445,"acs":364,"articleLive":2,"columnArticles":24,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"lock","submitted":454,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.772448132780083,"acs":4654,"articleLive":2,"columnArticles":82,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":6025,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.39120242691671264,"acs":2837,"articleLive":2,"columnArticles":68,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7252,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.406857392443765,"acs":1863,"articleLive":2,"columnArticles":51,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4579,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5753873659117997,"acs":1931,"articleLive":2,"columnArticles":51,"formTitle":"[1944]队列中可以看到的人数","frequency":0.0,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3356,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6636913922232481,"acs":6469,"articleLive":2,"columnArticles":73,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.0,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":9747,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.3036134888263342,"acs":5285,"articleLive":2,"columnArticles":80,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.0,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17407,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5409189777052746,"acs":3979,"articleLive":2,"columnArticles":89,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7356,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5164954029204976,"acs":955,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.0,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1849,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5367647058823529,"acs":219,"articleLive":2,"columnArticles":12,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","submitted":408,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5442477876106194,"acs":123,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"lock","submitted":226,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6811594202898551,"acs":282,"articleLive":2,"columnArticles":12,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"lock","submitted":414,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5447647951441578,"acs":6821,"articleLive":2,"columnArticles":79,"formTitle":"[1952]三除数","frequency":0.0,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":12521,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.324934504546155,"acs":4217,"articleLive":2,"columnArticles":83,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":12978,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4811519550456568,"acs":4110,"articleLive":2,"columnArticles":68,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8542,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4953038144527506,"acs":2584,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5217,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.44224422442244227,"acs":134,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":0.0,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"lock","submitted":303,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6041926974871581,"acs":4352,"articleLive":2,"columnArticles":58,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":7203,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.42314925628312533,"acs":2475,"articleLive":2,"columnArticles":43,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5849,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.41225071225071225,"acs":1447,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3510,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.27467030468394726,"acs":604,"articleLive":2,"columnArticles":19,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2199,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5356752537080406,"acs":6862,"articleLive":2,"columnArticles":63,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.0,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":12810,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.429215930304916,"acs":5518,"articleLive":2,"columnArticles":73,"formTitle":"[1962]移除石子使总数最小","frequency":0.0,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":12856,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6147980796385202,"acs":4354,"articleLive":2,"columnArticles":54,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.0,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7082,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.38300234365363267,"acs":3105,"articleLive":2,"columnArticles":47,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8107,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7308533916849015,"acs":334,"articleLive":2,"columnArticles":12,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"lock","submitted":457,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7272727272727273,"acs":40,"articleLive":2,"columnArticles":6,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"lock","submitted":55,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7772994129158513,"acs":5958,"articleLive":2,"columnArticles":56,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":7665,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3573366405704984,"acs":4610,"articleLive":2,"columnArticles":67,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":12901,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.27885912507226823,"acs":2894,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":0.0,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10378,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.47873283119184756,"acs":2161,"articleLive":2,"columnArticles":49,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":0.0,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4514,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5548469387755102,"acs":435,"articleLive":2,"columnArticles":18,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":784,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4489247311827957,"acs":167,"articleLive":2,"columnArticles":7,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.0,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"lock","submitted":372,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5517241379310345,"acs":64,"articleLive":2,"columnArticles":9,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"lock","submitted":116,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7453838678328474,"acs":3835,"articleLive":2,"columnArticles":54,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.0,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":5145,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.38107348413866954,"acs":2847,"articleLive":2,"columnArticles":45,"formTitle":"[1975]最大方阵和","frequency":0.0,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":7471,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.2874832164702372,"acs":1927,"articleLive":2,"columnArticles":37,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":6703,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.24652895360650187,"acs":728,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":2953,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5308056872037915,"acs":224,"articleLive":2,"columnArticles":9,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"lock","submitted":422,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8165442863698944,"acs":7117,"articleLive":2,"columnArticles":77,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":8716,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5804132064006482,"acs":5731,"articleLive":2,"columnArticles":91,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":9874,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.2989614740368509,"acs":4462,"articleLive":2,"columnArticles":82,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":0.0,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":14925,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.45572476029328823,"acs":808,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1773,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6567164179104478,"acs":44,"articleLive":2,"columnArticles":3,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"lock","submitted":67,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5799856159457516,"acs":5645,"articleLive":2,"columnArticles":63,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":9733,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.4110429447852761,"acs":5494,"articleLive":2,"columnArticles":79,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":13366,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.274662715433206,"acs":3522,"articleLive":2,"columnArticles":74,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.0,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":12823,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.4576047509072913,"acs":1387,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3031,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6555023923444976,"acs":137,"articleLive":2,"columnArticles":4,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":0.0,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"lock","submitted":209,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.43023255813953487,"acs":37,"articleLive":2,"columnArticles":2,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"lock","submitted":86,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.5968379446640316,"acs":151,"articleLive":2,"columnArticles":8,"formTitle":"[1990]Count the Number of Experiments","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"lock","submitted":253,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6607447898872566,"acs":3868,"articleLive":2,"columnArticles":53,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":5854,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5958818635607321,"acs":2865,"articleLive":2,"columnArticles":55,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":4808,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.38274044795783924,"acs":1743,"articleLive":2,"columnArticles":41,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4554,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.3608534322820037,"acs":1167,"articleLive":2,"columnArticles":35,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3234,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.550080612656187,"acs":5459,"articleLive":2,"columnArticles":44,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":9924,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.24578629561564716,"acs":4681,"articleLive":2,"columnArticles":95,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":19045,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.34156515935257803,"acs":2047,"articleLive":2,"columnArticles":36,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.0,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":5993,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.4181147972617167,"acs":1588,"articleLive":2,"columnArticles":32,"formTitle":"[1998]数组的最大公因数排序","frequency":0.0,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3798,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6506024096385542,"acs":54,"articleLive":2,"columnArticles":5,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"lock","submitted":83,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7798657718120805,"acs":6391,"articleLive":2,"columnArticles":81,"formTitle":"[2000]反转单词前缀","frequency":0.0,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":8195,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.3567292846114256,"acs":5545,"articleLive":2,"columnArticles":120,"formTitle":"[2001]可互换矩形的组数","frequency":0.0,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":15544,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5710714880853192,"acs":3427,"articleLive":2,"columnArticles":86,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6001,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.39155593656236604,"acs":1827,"articleLive":2,"columnArticles":38,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4666,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.40764331210191085,"acs":64,"articleLive":2,"columnArticles":3,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"lock","submitted":157,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6666666666666666,"acs":24,"articleLive":2,"columnArticles":3,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"lock","submitted":36,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8876103826598876,"acs":3317,"articleLive":2,"columnArticles":44,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":3737,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.29329801934592353,"acs":2547,"articleLive":2,"columnArticles":48,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.0,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":8684,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.41832324978392393,"acs":1936,"articleLive":2,"columnArticles":38,"formTitle":"[2008]出租车的最大盈利","frequency":0.0,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":4628,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.4192900200937709,"acs":1252,"articleLive":2,"columnArticles":39,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":2986,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6031746031746031,"acs":38,"articleLive":2,"columnArticles":2,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"lock","submitted":63,"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.9051973784484073,"acs":5939,"articleLive":2,"columnArticles":51,"formTitle":"[2011]执行操作后的变量值","frequency":0.0,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":6561,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.35335814283182704,"acs":3988,"articleLive":2,"columnArticles":73,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":11286,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.32432101786151213,"acs":2651,"articleLive":2,"columnArticles":50,"formTitle":"[2013]检测正方形","frequency":0.0,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8174,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5200772200772201,"acs":1347,"articleLive":2,"columnArticles":24,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2590,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.8484848484848485,"acs":28,"articleLive":2,"columnArticles":2,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"lock","submitted":33,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5494179139938228,"acs":4625,"articleLive":2,"columnArticles":62,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.0,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":8418,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.34015287769784175,"acs":3026,"articleLive":2,"columnArticles":85,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":8896,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.4103624422281683,"acs":1687,"articleLive":2,"columnArticles":44,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.0,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":4111,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.3300356153541749,"acs":834,"articleLive":2,"columnArticles":29,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.0,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":2527,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.8571428571428571,"acs":48,"articleLive":2,"columnArticles":3,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"lock","submitted":56,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.9545454545454546,"acs":21,"articleLive":2,"columnArticles":3,"formTitle":"[2021]Brightest Position on Street","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"lock","submitted":22,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.8450945207194425,"acs":81004,"articleLive":2,"columnArticles":625,"formTitle":"[LCP 01]猜数字","frequency":0.0,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":95852,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6908332909654786,"acs":13588,"articleLive":2,"columnArticles":234,"formTitle":"[LCP 02]分式化简","frequency":0.0,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":19669,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.2190447938297241,"acs":11076,"articleLive":2,"columnArticles":181,"formTitle":"[LCP 03]机器人大冒险","frequency":0.0,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":50565,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.37715959004392385,"acs":2576,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6830,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19933554817275748,"acs":2040,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10234,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.83986713529798,"acs":43490,"articleLive":2,"columnArticles":655,"formTitle":"[LCP 06]拿硬币","frequency":0.0,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":51782,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7697122145417814,"acs":38862,"articleLive":2,"columnArticles":468,"formTitle":"[LCP 07]传递信息","frequency":0.0,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":50489,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2873694423834256,"acs":5035,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17521,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.27341218064733364,"acs":6496,"articleLive":2,"columnArticles":104,"formTitle":"[LCP 09]最小跳跃次数","frequency":0.0,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":23759,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5882547014186738,"acs":1783,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.0,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3031,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6885907394330677,"acs":6826,"articleLive":2,"columnArticles":67,"formTitle":"[LCP 11]期望个数统计","frequency":0.0,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":9913,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.40981801696781295,"acs":6328,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 12]小张刷题计划","frequency":0.0,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":15441,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6125389408099688,"acs":9438,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15408,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21057118499573743,"acs":2717,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":0.0,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12903,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5752032520325203,"acs":849,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.0,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1476,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.3093154915079774,"acs":601,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1943,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7988794567062818,"acs":23527,"articleLive":2,"columnArticles":248,"formTitle":"[LCP 17]速算机器人","frequency":0.0,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":29450,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2862906545903664,"acs":17385,"articleLive":2,"columnArticles":224,"formTitle":"[LCP 18]早餐组合","frequency":0.0,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":60725,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5163359179918517,"acs":19644,"articleLive":2,"columnArticles":204,"formTitle":"[LCP 19]秋叶收藏集","frequency":0.0,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38045,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.31100141043723556,"acs":1764,"articleLive":2,"columnArticles":31,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5672,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3341677096370463,"acs":801,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2397,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3332587120364152,"acs":8932,"articleLive":2,"columnArticles":185,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26802,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3412583738342309,"acs":2598,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7613,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2808814400993172,"acs":905,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3222,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.3315170633782621,"acs":1156,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3487,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3325227963525836,"acs":547,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1645,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32839375496163004,"acs":1241,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3779,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.2810550753825068,"acs":10048,"articleLive":2,"columnArticles":171,"formTitle":"[LCP 28]采购方案","frequency":0.0,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":35751,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.18629304273694355,"acs":5026,"articleLive":2,"columnArticles":122,"formTitle":"[LCP 29]乐团站位","frequency":0.0,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":26979,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3484182776801406,"acs":5551,"articleLive":2,"columnArticles":96,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":15932,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.25173176123802504,"acs":1708,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6785,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.4053738317757009,"acs":1041,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":0.0,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2568,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.21546881053855094,"acs":4449,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 33]蓄水","frequency":0.0,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":20648,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.48003362757461115,"acs":2284,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 34]二叉树染色","frequency":0.0,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4758,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.39631176061238693,"acs":1139,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 35]电动车游城市","frequency":0.0,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2874,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.26008202323991797,"acs":761,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":0.0,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":2926,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19325386761349225,"acs":762,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 37]最小矩形面积","frequency":0.0,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":3943,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5637254901960784,"acs":460,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":816,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5014330558209362,"acs":3674,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7327,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.22787051087506321,"acs":2703,"articleLive":2,"columnArticles":59,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":11862,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.4131933048900558,"acs":1259,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3047,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.19870027569909413,"acs":1009,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5078,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.39525283797729616,"acs":383,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":969,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.857581069237511,"acs":1957,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":2282,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.18259101829606358,"acs":988,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5411,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.3622674933569531,"acs":818,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2258,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.3500697350069735,"acs":753,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2151,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.1466359976998275,"acs":255,"articleLive":2,"columnArticles":8,"formTitle":"[LCP 48]无限棋局","frequency":0.0,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":1739,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.20390070921985815,"acs":230,"articleLive":2,"columnArticles":8,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1128,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5419258858533946,"acs":4007,"articleLive":2,"columnArticles":94,"formTitle":"[LCS 01]下载插件","frequency":0.0,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":7394,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6959088991986504,"acs":3300,"articleLive":2,"columnArticles":67,"formTitle":"[LCS 02]完成一半题目","frequency":0.0,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":4742,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4150099403578529,"acs":1670,"articleLive":2,"columnArticles":54,"formTitle":"[LCS 03]主题空间","frequency":0.0,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4024,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6781134313705438,"acs":397860,"articleLive":2,"columnArticles":2775,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":586716,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4031309206412414,"acs":259164,"articleLive":2,"columnArticles":2072,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":0.0,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":642878,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7606995741115689,"acs":283283,"articleLive":2,"columnArticles":1928,"formTitle":"[剑指 Offer 05]替换空格","frequency":0.0,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":372398,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7514683633863809,"acs":299515,"articleLive":2,"columnArticles":2070,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":398573,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6975003153357027,"acs":188014,"articleLive":2,"columnArticles":1443,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":269554,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7160569939202448,"acs":260170,"articleLive":2,"columnArticles":1646,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":0.0,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":363337,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.35988477339042313,"acs":261231,"articleLive":2,"columnArticles":1853,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":725874,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4434455008628858,"acs":193744,"articleLive":2,"columnArticles":1307,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":436906,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.4929572652817189,"acs":259717,"articleLive":2,"columnArticles":1622,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":526855,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.4522230988326224,"acs":169093,"articleLive":2,"columnArticles":1129,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":373915,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5263469011147285,"acs":175413,"articleLive":2,"columnArticles":1704,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":0.0,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":333265,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.569080260398145,"acs":156826,"articleLive":2,"columnArticles":1302,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":275578,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.31183816823810495,"acs":82750,"articleLive":2,"columnArticles":486,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":265362,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7470438568386136,"acs":198187,"articleLive":2,"columnArticles":1247,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":265295,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.33947751483205046,"acs":123138,"articleLive":2,"columnArticles":755,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":0.0,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":362728,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7771615398209849,"acs":149515,"articleLive":2,"columnArticles":1117,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":192386,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5963647829188748,"acs":187249,"articleLive":2,"columnArticles":1450,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":313984,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.37622192416113487,"acs":66197,"articleLive":2,"columnArticles":443,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":0.0,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":175952,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24154055594250617,"acs":76293,"articleLive":2,"columnArticles":848,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":315860,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6429785809906292,"acs":192122,"articleLive":2,"columnArticles":1622,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":0.0,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":298800,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7977921262556628,"acs":259225,"articleLive":2,"columnArticles":2434,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":324928,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7428324334311934,"acs":289461,"articleLive":2,"columnArticles":1817,"formTitle":"[剑指 Offer 24]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":389672,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7287213354182707,"acs":183613,"articleLive":2,"columnArticles":1182,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":251966,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.46533712279204215,"acs":143919,"articleLive":2,"columnArticles":1178,"formTitle":"[剑指 Offer 26]树的子结构","frequency":0.0,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":309279,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7916897691695188,"acs":189905,"articleLive":2,"columnArticles":1396,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":0.0,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":239873,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5800392979495533,"acs":148486,"articleLive":2,"columnArticles":1082,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":255993,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.44014616781869825,"acs":144419,"articleLive":2,"columnArticles":1480,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":0.0,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":328116,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5694147659925272,"acs":138833,"articleLive":2,"columnArticles":927,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":0.0,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":243817,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6151559443479789,"acs":111951,"articleLive":2,"columnArticles":942,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":181988,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6443394209988837,"acs":135656,"articleLive":2,"columnArticles":946,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":210535,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6864517826335521,"acs":135682,"articleLive":2,"columnArticles":1088,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":197657,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5886632026452527,"acs":118389,"articleLive":2,"columnArticles":1132,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":201115,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5510152895874418,"acs":112044,"articleLive":2,"columnArticles":948,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":203341,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5763691400457107,"acs":132143,"articleLive":2,"columnArticles":865,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":229268,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7201413729535716,"acs":117975,"articleLive":2,"columnArticles":820,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":0.0,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":163822,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6543463251176609,"acs":103301,"articleLive":2,"columnArticles":892,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":157869,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5608109094625571,"acs":76821,"articleLive":2,"columnArticles":557,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":136982,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5790962640021541,"acs":157004,"articleLive":2,"columnArticles":1111,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":0.0,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":271119,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.690718367279433,"acs":167053,"articleLive":2,"columnArticles":1022,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":241854,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5699989783882682,"acs":245494,"articleLive":2,"columnArticles":1809,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":430692,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5812170223061819,"acs":62457,"articleLive":2,"columnArticles":457,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":107459,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6054009103400421,"acs":219858,"articleLive":2,"columnArticles":1515,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":0.0,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":363161,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.485027146671431,"acs":48866,"articleLive":2,"columnArticles":506,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":100749,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41447873252787265,"acs":55095,"articleLive":2,"columnArticles":458,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":132926,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5612106476892094,"acs":107565,"articleLive":2,"columnArticles":805,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":0.0,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":191666,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5361432409534295,"acs":118337,"articleLive":2,"columnArticles":1429,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":220719,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6886285821490549,"acs":117458,"articleLive":2,"columnArticles":985,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":0.0,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":170568,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46446054435089096,"acs":149436,"articleLive":2,"columnArticles":1028,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":321741,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.65130257528355,"acs":87227,"articleLive":2,"columnArticles":515,"formTitle":"[剑指 Offer 49]丑数","frequency":0.0,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":133927,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6144761502091659,"acs":151147,"articleLive":2,"columnArticles":1049,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":0.0,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":245977,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4823449535494174,"acs":100881,"articleLive":2,"columnArticles":842,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":0.0,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":209147,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6493110678448405,"acs":173418,"articleLive":2,"columnArticles":1043,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":267080,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5380624820865577,"acs":187730,"articleLive":2,"columnArticles":1577,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":348900,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44715125053902544,"acs":165911,"articleLive":2,"columnArticles":1460,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":371040,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7563842552290426,"acs":160743,"articleLive":2,"columnArticles":1138,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":212515,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7898361156809335,"acs":175718,"articleLive":2,"columnArticles":1265,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":222474,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5877332455300474,"acs":135660,"articleLive":2,"columnArticles":936,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":230819,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6992731417925083,"acs":114099,"articleLive":2,"columnArticles":1024,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":163168,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.8001630955901462,"acs":89291,"articleLive":2,"columnArticles":691,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":111591,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6656123704094183,"acs":132580,"articleLive":2,"columnArticles":834,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":199185,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7071937697318262,"acs":138209,"articleLive":2,"columnArticles":1856,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":195433,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4416848996468257,"acs":128188,"articleLive":2,"columnArticles":969,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":290225,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8574461875536644,"acs":202720,"articleLive":2,"columnArticles":1775,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":236423,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44414693388111615,"acs":130378,"articleLive":2,"columnArticles":1182,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":293547,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.47518449436379856,"acs":93752,"articleLive":2,"columnArticles":1063,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":197296,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.561295804935574,"acs":64732,"articleLive":2,"columnArticles":585,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":0.0,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":115326,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.45946250874382294,"acs":101810,"articleLive":2,"columnArticles":974,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":0.0,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":221585,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6554937170920312,"acs":109181,"articleLive":2,"columnArticles":761,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":166563,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6337420058353718,"acs":129021,"articleLive":2,"columnArticles":941,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":0.0,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":203586,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8570765195346327,"acs":136582,"articleLive":2,"columnArticles":1291,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":0.0,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":159358,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.583452376037323,"acs":70659,"articleLive":2,"columnArticles":491,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":0.0,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":121105,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5976750356538755,"acs":72082,"articleLive":2,"columnArticles":522,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":0.0,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":120604,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.286467983809359,"acs":67872,"articleLive":2,"columnArticles":552,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":0.0,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":236927,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6936528882390004,"acs":116696,"articleLive":2,"columnArticles":684,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":168234,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7003187327956729,"acs":116012,"articleLive":2,"columnArticles":679,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":165656,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20291619325867014,"acs":7501,"articleLive":2,"columnArticles":101,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":36966,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5780678417026938,"acs":6953,"articleLive":2,"columnArticles":116,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":12028,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.781718963165075,"acs":8595,"articleLive":2,"columnArticles":131,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":10995,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6838414337196844,"acs":7021,"articleLive":2,"columnArticles":86,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":10267,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7095956037762435,"acs":5036,"articleLive":2,"columnArticles":79,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":7097,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6621014337684571,"acs":6188,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":9346,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4557334487234963,"acs":5266,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":11555,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5059518048969321,"acs":5228,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":10333,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5421409387389692,"acs":4239,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":7819,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.43849773922672325,"acs":4752,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":10837,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5654761904761905,"acs":3420,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":6048,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6609313338595106,"acs":4187,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.0,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":6335,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6595598349381018,"acs":2877,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":4362,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5044894232232537,"acs":3315,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":6571,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6386174016686531,"acs":2679,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":4195,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.4941825596737435,"acs":4120,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":8337,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.525375939849624,"acs":2236,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":4256,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5301336242159803,"acs":3888,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":7334,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4695765284000578,"acs":3249,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":6919,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.6987303636754896,"acs":3247,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":4647,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.533030597902476,"acs":4930,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":9249,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5190497534737786,"acs":5790,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":11155,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7037100949094046,"acs":4078,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":5795,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7682184802603651,"acs":10858,"articleLive":2,"columnArticles":113,"formTitle":"[剑指 Offer II 024]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":14134,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6048158640226629,"acs":3416,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":0.0,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":5648,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6482993197278911,"acs":3812,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":5880,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6026691887347625,"acs":5735,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":9516,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6198116498081618,"acs":1777,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":2867,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.29009255044758003,"acs":1912,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":6591,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5403407264545163,"acs":1681,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":3111,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.559020618556701,"acs":2169,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":3880,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.6016780746301612,"acs":2725,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":4529,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7946969696969697,"acs":2098,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":2640,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5750827565452904,"acs":1911,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":3323,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6804229195088677,"acs":1995,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":2932,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.585698982324585,"acs":2187,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":3734,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4398105991622655,"acs":2415,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":5491,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7733297985153764,"acs":2917,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":3772,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5105335157318741,"acs":1866,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":3655,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.573394495412844,"acs":1250,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.0,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":2180,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7829319060362772,"acs":2633,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":3363,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8516355140186916,"acs":2187,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":2568,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6499752107089737,"acs":1311,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":2017,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6446153846153846,"acs":2514,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":3900,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8071917808219178,"acs":2357,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":2920,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7208346506481189,"acs":2280,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":3163,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6828110161443495,"acs":2157,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":3159,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6616062683643487,"acs":1351,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":2042,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7458937198067633,"acs":2316,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":3105,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6129779837775203,"acs":1587,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":2589,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.4128081779915815,"acs":1373,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":3326,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7341434499110847,"acs":2477,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":3374,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6283598464070214,"acs":2291,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":3646,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8400174367916303,"acs":1927,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":2294,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8951376684241359,"acs":1528,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":1707,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7240990990990991,"acs":2572,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":3552,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3576017130620985,"acs":1002,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":2802,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5903614457831325,"acs":980,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":1660,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6216628527841342,"acs":1630,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":2622,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6793893129770993,"acs":1780,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":2620,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5363636363636364,"acs":1180,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":2200,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7527056277056277,"acs":1391,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":1848,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7228514323784144,"acs":1085,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":1501,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.624910007199424,"acs":868,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":1389,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6369376479873717,"acs":807,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":1267,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6454749439042633,"acs":863,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":1337,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6465661641541038,"acs":772,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":1194,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5079433233147274,"acs":2366,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":4658,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7240734973528495,"acs":2325,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"","submitted":3211,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6697809278350515,"acs":2079,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":3104,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5043859649122807,"acs":805,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":1596,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.42108354133020115,"acs":2868,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":6811,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5388109000825764,"acs":1305,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":2422,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5449152542372881,"acs":1929,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.0,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":3540,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7087172218284904,"acs":2000,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":2822,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6728093947606143,"acs":3724,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":5535,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5846667838930895,"acs":3325,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":5687,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6304454233969653,"acs":2576,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":4086,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8535901926444833,"acs":2437,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":2855,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.7965641952983725,"acs":1762,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":2212,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7813829787234042,"acs":2938,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":3760,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6380839739798936,"acs":2158,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":3382,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8537524053880693,"acs":2662,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":3118,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6728198599618078,"acs":2114,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":3142,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8588696504410324,"acs":2629,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.0,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":3061,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7589285714285714,"acs":1700,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":2240,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6335381279363932,"acs":1753,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":2767,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7377375165709236,"acs":3339,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":4526,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6251958633657161,"acs":1995,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":3191,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5221080839660562,"acs":1169,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":2239,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7576045627376425,"acs":1594,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.0,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":2104,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6655755591925805,"acs":1220,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":1833,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5612565445026177,"acs":1072,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":1910,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5821596244131455,"acs":868,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":1491,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6606526930220218,"acs":4980,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":7538,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.4834224598930481,"acs":904,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":1870,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.537077033837293,"acs":746,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":1389,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7670970827355332,"acs":1604,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":2091,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6867030965391621,"acs":2262,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":3294,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7355013550135502,"acs":1357,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":1845,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.4702983848891322,"acs":1718,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":3653,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.589798087141339,"acs":1110,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":1882,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.4967423050999775,"acs":2211,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":4451,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.578979717271051,"acs":942,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":1627,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6932160804020101,"acs":2759,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":3980,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5524822695035461,"acs":779,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":1410,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5432266848196051,"acs":798,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":1469,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5584577114427861,"acs":449,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":804,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.6152796725784447,"acs":902,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":1466,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8373143963847643,"acs":1297,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":1549,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6836248012718601,"acs":430,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":629,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5612822124450031,"acs":893,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":1591,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5836477987421383,"acs":928,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":1590,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.4261780104712042,"acs":407,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":955,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.28361458900381054,"acs":521,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":1837,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6308674427337589,"acs":3360,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 116]朋友圈","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":5326,"title":"朋友圈","titleSlug":"bLyHh0"},{"acceptance":0.6464379947229552,"acs":490,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":758,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.689401888772298,"acs":657,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":953,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.4526122823098075,"acs":2469,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":5455,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7197439765175915,"acs":88273,"articleLive":2,"columnArticles":1518,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":0.0,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":122645,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6482875187008211,"acs":56766,"articleLive":2,"columnArticles":1096,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":0.0,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":87563,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5791582366095197,"acs":43511,"articleLive":2,"columnArticles":477,"formTitle":"[面试题 01.03]URL化","frequency":0.0,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":75128,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.550776764840151,"acs":39814,"articleLive":2,"columnArticles":766,"formTitle":"[面试题 01.04]回文排列","frequency":0.0,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":72287,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.33217802202377233,"acs":31915,"articleLive":2,"columnArticles":548,"formTitle":"[面试题 01.05]一次编辑","frequency":0.0,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":96078,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4719477321729841,"acs":72452,"articleLive":2,"columnArticles":1161,"formTitle":"[面试题 01.06]字符串压缩","frequency":0.0,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":153517,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7535558814628582,"acs":64741,"articleLive":2,"columnArticles":954,"formTitle":"[面试题 01.07]旋转矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":85914,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6213322530239018,"acs":42944,"articleLive":2,"columnArticles":481,"formTitle":"[面试题 01.08]零矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":69116,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5504106653969766,"acs":32368,"articleLive":2,"columnArticles":409,"formTitle":"[面试题 01.09]字符串轮转","frequency":0.0,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":58807,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6829839368363735,"acs":62715,"articleLive":2,"columnArticles":682,"formTitle":"[面试题 02.01]移除重复节点","frequency":0.0,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":91825,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7802370395428351,"acs":64581,"articleLive":2,"columnArticles":941,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":0.0,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":82771,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8544252839031424,"acs":71101,"articleLive":2,"columnArticles":678,"formTitle":"[面试题 02.03]删除中间节点","frequency":0.0,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":83215,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6547962448208947,"acs":24970,"articleLive":2,"columnArticles":355,"formTitle":"[面试题 02.04]分割链表","frequency":0.0,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":38134,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4668152360460053,"acs":36448,"articleLive":2,"columnArticles":516,"formTitle":"[面试题 02.05]链表求和","frequency":0.0,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":78078,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4835443670862343,"acs":38685,"articleLive":2,"columnArticles":500,"formTitle":"[面试题 02.06]回文链表","frequency":0.0,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":80003,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6847924649720654,"acs":46822,"articleLive":2,"columnArticles":416,"formTitle":"[面试题 02.07]链表相交","frequency":0.0,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":68374,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5317641952412895,"acs":26953,"articleLive":2,"columnArticles":279,"formTitle":"[面试题 02.08]环路检测","frequency":0.0,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":50686,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5384309238346351,"acs":10823,"articleLive":2,"columnArticles":174,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":20101,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6133982305128636,"acs":25583,"articleLive":2,"columnArticles":290,"formTitle":"[面试题 03.02]栈的最小值","frequency":0.0,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":41707,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3863078375826251,"acs":8182,"articleLive":2,"columnArticles":122,"formTitle":"[面试题 03.03]堆盘子","frequency":0.0,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":21180,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7128657858994938,"acs":23094,"articleLive":2,"columnArticles":338,"formTitle":"[面试题 03.04]化栈为队","frequency":0.0,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":32396,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5435197192768327,"acs":14250,"articleLive":2,"columnArticles":190,"formTitle":"[面试题 03.05]栈排序","frequency":0.0,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":26218,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5878035320088301,"acs":10651,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 03.06]动物收容所","frequency":0.0,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":18120,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5319800373534185,"acs":17375,"articleLive":2,"columnArticles":241,"formTitle":"[面试题 04.01]节点间通路","frequency":0.0,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":32661,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.79004329004329,"acs":34310,"articleLive":2,"columnArticles":416,"formTitle":"[面试题 04.02]最小高度树","frequency":0.0,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":43428,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8057992615426307,"acs":23788,"articleLive":2,"columnArticles":517,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":0.0,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":29521,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.584439889492915,"acs":32790,"articleLive":2,"columnArticles":381,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":56105,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35159479387777903,"acs":25177,"articleLive":2,"columnArticles":318,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":0.0,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":71608,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5900062535362258,"acs":19813,"articleLive":2,"columnArticles":239,"formTitle":"[面试题 04.06]后继者","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":33581,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7168989547038328,"acs":16460,"articleLive":2,"columnArticles":174,"formTitle":"[面试题 04.08]首个共同祖先","frequency":0.0,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":22960,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47609403254972876,"acs":6582,"articleLive":2,"columnArticles":109,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.0,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":13825,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7171613479134122,"acs":16068,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 04.10]检查子树","frequency":0.0,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":22405,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.4864244527794883,"acs":17378,"articleLive":2,"columnArticles":255,"formTitle":"[面试题 04.12]求和路径","frequency":0.0,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":35726,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5053220375801021,"acs":9305,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":18414,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6892307692307692,"acs":7616,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.0,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11050,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.38723728628988346,"acs":10668,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 05.03]翻转数位","frequency":0.0,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":27549,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.38747030878859856,"acs":5220,"articleLive":2,"columnArticles":136,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":13472,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5278083700440529,"acs":11502,"articleLive":2,"columnArticles":224,"formTitle":"[面试题 05.06]整数转换","frequency":0.0,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":21792,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.703125974917327,"acs":11269,"articleLive":2,"columnArticles":201,"formTitle":"[面试题 05.07]配对交换","frequency":0.0,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":16027,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5529281066497381,"acs":3484,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 05.08]绘制直线","frequency":0.0,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6301,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.3631127871100446,"acs":42368,"articleLive":2,"columnArticles":469,"formTitle":"[面试题 08.01]三步问题","frequency":0.0,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":116680,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3612495151714056,"acs":12108,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":33517,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6759266515163388,"acs":51753,"articleLive":2,"columnArticles":432,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":76566,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8200348984771574,"acs":20678,"articleLive":2,"columnArticles":322,"formTitle":"[面试题 08.04]幂集","frequency":0.0,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":25216,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6805980617189492,"acs":21349,"articleLive":2,"columnArticles":471,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":31368,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.656354328956154,"acs":23592,"articleLive":2,"columnArticles":265,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":0.0,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":35944,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8129808791041365,"acs":21344,"articleLive":2,"columnArticles":312,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":26254,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7186951176677204,"acs":16369,"articleLive":2,"columnArticles":235,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":22776,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8129626150666918,"acs":21637,"articleLive":2,"columnArticles":343,"formTitle":"[面试题 08.09]括号","frequency":0.0,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":26615,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5591819871927288,"acs":13535,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 08.10]颜色填充","frequency":0.0,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":24205,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49481755761913787,"acs":33943,"articleLive":2,"columnArticles":324,"formTitle":"[面试题 08.11]硬币","frequency":0.0,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":68597,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7606074551311551,"acs":16528,"articleLive":2,"columnArticles":295,"formTitle":"[面试题 08.12]八皇后","frequency":0.0,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":21730,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5013321492007105,"acs":6774,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 08.13]堆箱子","frequency":0.0,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":13512,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5338676318510859,"acs":4130,"articleLive":2,"columnArticles":74,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7736,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5548460841117812,"acs":56308,"articleLive":2,"columnArticles":2372,"formTitle":"[面试题 10.01]合并排序的数组","frequency":0.0,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":101484,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7395175616960253,"acs":34551,"articleLive":2,"columnArticles":426,"formTitle":"[面试题 10.02]变位词组","frequency":0.0,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46721,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3952936884348778,"acs":13002,"articleLive":2,"columnArticles":207,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":0.0,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":32892,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5531112326873794,"acs":19209,"articleLive":2,"columnArticles":253,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.0,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":34729,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.455562241177928,"acs":12871,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":0.0,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":28253,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6283577956244808,"acs":4538,"articleLive":2,"columnArticles":83,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7222,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6667834925085429,"acs":7610,"articleLive":2,"columnArticles":94,"formTitle":"[面试题 10.11]峰与谷","frequency":0.0,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":11413,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8323204967302992,"acs":25201,"articleLive":2,"columnArticles":399,"formTitle":"[面试题 16.01]交换数字","frequency":0.0,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":30278,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7657360936846508,"acs":14647,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":19128,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44253803820006476,"acs":9569,"articleLive":2,"columnArticles":232,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21623,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.46026532715095314,"acs":7147,"articleLive":2,"columnArticles":155,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":15528,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46394074587430156,"acs":10711,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.0,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":23087,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4235475028414789,"acs":12670,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 16.06]最小差","frequency":0.0,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":29914,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7331023835523591,"acs":19469,"articleLive":2,"columnArticles":284,"formTitle":"[面试题 16.07]最大数值","frequency":0.0,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":26557,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.37533068783068785,"acs":2270,"articleLive":2,"columnArticles":62,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6048,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.551653422199436,"acs":2152,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3901,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6825216811207472,"acs":10231,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 16.10]生存人数","frequency":0.0,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":14990,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4409862570735651,"acs":50186,"articleLive":2,"columnArticles":580,"formTitle":"[面试题 16.11]跳水板","frequency":0.0,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":113804,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4315463003987594,"acs":1948,"articleLive":2,"columnArticles":52,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4514,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5487616099071208,"acs":3545,"articleLive":2,"columnArticles":58,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6460,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.503371295824126,"acs":8884,"articleLive":2,"columnArticles":224,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.0,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":17649,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4533178540877429,"acs":14838,"articleLive":2,"columnArticles":210,"formTitle":"[面试题 16.16]部分排序","frequency":0.0,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":32732,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.600688438084255,"acs":34378,"articleLive":2,"columnArticles":374,"formTitle":"[面试题 16.17]连续数列","frequency":0.0,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":57231,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3440081706763504,"acs":15157,"articleLive":2,"columnArticles":312,"formTitle":"[面试题 16.18]模式匹配","frequency":0.0,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":44060,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.611333714939897,"acs":20292,"articleLive":2,"columnArticles":357,"formTitle":"[面试题 16.19]水域大小","frequency":0.0,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":33193,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7219845318413691,"acs":8775,"articleLive":2,"columnArticles":172,"formTitle":"[面试题 16.20]T9键盘","frequency":0.0,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12154,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4649997543842413,"acs":9466,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":20357,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5834049871023216,"acs":2714,"articleLive":2,"columnArticles":58,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4652,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.4720425850160574,"acs":10730,"articleLive":2,"columnArticles":160,"formTitle":"[面试题 16.24]数对和","frequency":0.0,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":22731,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5456051351071539,"acs":31620,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 16.25]LRU 缓存","frequency":0.0,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":57954,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3880349204648921,"acs":14490,"articleLive":2,"columnArticles":202,"formTitle":"[面试题 16.26]计算器","frequency":0.0,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":37342,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5968635138446459,"acs":12179,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 17.01]不用加号的加法","frequency":0.0,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":20405,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6447362283688605,"acs":27645,"articleLive":2,"columnArticles":451,"formTitle":"[面试题 17.04]消失的数字","frequency":0.0,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":42878,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38727662616154396,"acs":5418,"articleLive":2,"columnArticles":92,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":13990,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.44964168119310477,"acs":4643,"articleLive":2,"columnArticles":107,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.0,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10326,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.41159998101476103,"acs":8672,"articleLive":2,"columnArticles":216,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.0,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":21069,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27163659073727114,"acs":8264,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.08]马戏团人塔","frequency":0.0,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":30423,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5492474982270901,"acs":13941,"articleLive":2,"columnArticles":145,"formTitle":"[面试题 17.09]第 k 个数","frequency":0.0,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":25382,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.570919891465304,"acs":66700,"articleLive":2,"columnArticles":925,"formTitle":"[面试题 17.10]主要元素","frequency":0.0,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":116829,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.686440273200554,"acs":14372,"articleLive":2,"columnArticles":261,"formTitle":"[面试题 17.11]单词距离","frequency":0.0,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":20937,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6313938912159477,"acs":20651,"articleLive":2,"columnArticles":289,"formTitle":"[面试题 17.12]BiNode","frequency":0.0,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":32707,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5526582449503479,"acs":24543,"articleLive":2,"columnArticles":270,"formTitle":"[面试题 17.13]恢复空格","frequency":0.0,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":44409,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5976382623355134,"acs":76573,"articleLive":2,"columnArticles":759,"formTitle":"[面试题 17.14]最小K个数","frequency":0.0,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":128126,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.402393469839513,"acs":5817,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.15]最长单词","frequency":0.0,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":14456,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5184140082863037,"acs":60811,"articleLive":2,"columnArticles":1136,"formTitle":"[面试题 17.16]按摩师","frequency":0.0,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":117302,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4449383827584267,"acs":7907,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 17.17]多次搜索","frequency":0.0,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":17771,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.44517215568862273,"acs":7137,"articleLive":2,"columnArticles":119,"formTitle":"[面试题 17.18]最短超串","frequency":0.0,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":16032,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5790112632359884,"acs":8585,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.0,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":14827,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5696425944991911,"acs":3873,"articleLive":2,"columnArticles":68,"formTitle":"[面试题 17.20]连续中值","frequency":0.0,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6799,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6358703453819873,"acs":44296,"articleLive":2,"columnArticles":534,"formTitle":"[面试题 17.21]直方图的水量","frequency":0.0,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":69662,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3742687561381784,"acs":8765,"articleLive":2,"columnArticles":152,"formTitle":"[面试题 17.22]单词转换","frequency":0.0,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":23419,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3786677908937605,"acs":4491,"articleLive":2,"columnArticles":100,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.0,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":11860,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5216683119447186,"acs":10569,"articleLive":2,"columnArticles":119,"formTitle":"[面试题 17.24]最大子矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":20260,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5050145583953413,"acs":1561,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 17.25]单词矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3091,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.34227650415457,"acs":3419,"articleLive":2,"columnArticles":52,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.0,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":9989,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}]
\ No newline at end of file
+[{"acceptance":0.46499720601421685,"acs":35782,"articleLive":2,"columnArticles":404,"formTitle":"[482]密钥格式化","frequency":0.0,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"","submitted":76951,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5205072211786542,"acs":2540158,"articleLive":2,"columnArticles":14317,"formTitle":"[1]两数之和","frequency":0.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4880159,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.40883532255798516,"acs":1012690,"articleLive":2,"columnArticles":7199,"formTitle":"[2]两数相加","frequency":0.0,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2477012,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.38069095721880714,"acs":1255818,"articleLive":2,"columnArticles":7495,"formTitle":"[3]无重复字符的最长子串","frequency":0.0,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3298786,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4085851057211727,"acs":518861,"articleLive":2,"columnArticles":3856,"formTitle":"[4]寻找两个正序数组的中位数","frequency":0.0,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1269897,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35498081088251837,"acs":745235,"articleLive":2,"columnArticles":4034,"formTitle":"[5]最长回文子串","frequency":0.0,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2099367,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5069349585823113,"acs":306173,"articleLive":2,"columnArticles":2479,"formTitle":"[6]Z 字形变换","frequency":0.0,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":603969,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35269032975833287,"acs":842938,"articleLive":2,"columnArticles":5301,"formTitle":"[7]整数反转","frequency":0.0,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2390023,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21720436105790983,"acs":350431,"articleLive":2,"columnArticles":2693,"formTitle":"[8]字符串转换整数 (atoi)","frequency":0.0,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1613370,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5839789105593032,"acs":776887,"articleLive":2,"columnArticles":4949,"formTitle":"[9]回文数","frequency":0.0,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1330334,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3161141283936764,"acs":206218,"articleLive":2,"columnArticles":1241,"formTitle":"[10]正则表达式匹配","frequency":0.0,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":652353,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6277365141493272,"acs":540478,"articleLive":2,"columnArticles":3064,"formTitle":"[11]盛最多水的容器","frequency":0.0,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":860995,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6646916122726797,"acs":228513,"articleLive":2,"columnArticles":1783,"formTitle":"[12]整数转罗马数字","frequency":0.0,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":343788,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6319794366544853,"acs":471080,"articleLive":2,"columnArticles":3906,"formTitle":"[13]罗马数字转整数","frequency":0.0,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":745404,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4095010518970599,"acs":629105,"articleLive":2,"columnArticles":3927,"formTitle":"[14]最长公共前缀","frequency":0.0,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1536272,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.336058848436104,"acs":663524,"articleLive":2,"columnArticles":3119,"formTitle":"[15]三数之和","frequency":0.0,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":1974428,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4591448199593338,"acs":262393,"articleLive":2,"columnArticles":1436,"formTitle":"[16]最接近的三数之和","frequency":0.0,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":571482,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5727001428576208,"acs":342359,"articleLive":2,"columnArticles":3083,"formTitle":"[17]电话号码的字母组合","frequency":0.0,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":597798,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.3988842373953861,"acs":223151,"articleLive":2,"columnArticles":1531,"formTitle":"[18]四数之和","frequency":0.0,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":559438,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.42929077163480894,"acs":522525,"articleLive":2,"columnArticles":3909,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":0.0,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1217182,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44492379005939653,"acs":789374,"articleLive":2,"columnArticles":5603,"formTitle":"[20]有效的括号","frequency":0.0,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1774178,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6672965326203287,"acs":720763,"articleLive":2,"columnArticles":3505,"formTitle":"[21]合并两个有序链表","frequency":0.0,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1080124,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.772436974789916,"acs":353892,"articleLive":2,"columnArticles":2655,"formTitle":"[22]括号生成","frequency":0.0,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":458150,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5597464861278587,"acs":328190,"articleLive":2,"columnArticles":2114,"formTitle":"[23]合并K个升序链表","frequency":0.0,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":586319,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7031570035474675,"acs":318926,"articleLive":2,"columnArticles":2533,"formTitle":"[24]两两交换链表中的节点","frequency":0.0,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":453563,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6575568255838322,"acs":232182,"articleLive":2,"columnArticles":2212,"formTitle":"[25]K 个一组翻转链表","frequency":0.0,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":353098,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5391481378881963,"acs":819372,"articleLive":2,"columnArticles":4564,"formTitle":"[26]删除有序数组中的重复项","frequency":0.0,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1519753,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5972659878802793,"acs":485413,"articleLive":2,"columnArticles":4108,"formTitle":"[27]移除元素","frequency":0.0,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":812725,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4059468926262652,"acs":472851,"articleLive":2,"columnArticles":3254,"formTitle":"[28]实现 strStr()","frequency":0.0,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1164810,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.2076437349616763,"acs":110720,"articleLive":2,"columnArticles":900,"formTitle":"[29]两数相除","frequency":0.0,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","submitted":533221,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.35851653261840927,"acs":80236,"articleLive":2,"columnArticles":592,"formTitle":"[30]串联所有单词的子串","frequency":0.0,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":223800,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37313810731115826,"acs":216641,"articleLive":2,"columnArticles":1754,"formTitle":"[31]下一个排列","frequency":0.0,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":580592,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3565380178465287,"acs":192548,"articleLive":2,"columnArticles":1306,"formTitle":"[32]最长有效括号","frequency":0.0,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":540049,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4274684315501493,"acs":369060,"articleLive":2,"columnArticles":2436,"formTitle":"[33]搜索旋转排序数组","frequency":0.0,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":863362,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4235432147047321,"acs":345477,"articleLive":2,"columnArticles":3327,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":0.0,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":815683,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4632048827729105,"acs":514169,"articleLive":2,"columnArticles":3965,"formTitle":"[35]搜索插入位置","frequency":0.0,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1110025,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6406141072092885,"acs":204919,"articleLive":2,"columnArticles":1456,"formTitle":"[36]有效的数独","frequency":0.0,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":319879,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.670735247545656,"acs":101662,"articleLive":2,"columnArticles":858,"formTitle":"[37]解数独","frequency":0.0,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":151568,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5804021714689538,"acs":216822,"articleLive":2,"columnArticles":2276,"formTitle":"[38]外观数列","frequency":0.0,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":373572,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7277013177789392,"acs":338344,"articleLive":2,"columnArticles":1972,"formTitle":"[39]组合总和","frequency":0.0,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":464949,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.623164879253144,"acs":201921,"articleLive":2,"columnArticles":1404,"formTitle":"[40]组合总和 II","frequency":0.0,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":324025,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4194399662940341,"acs":166253,"articleLive":2,"columnArticles":1421,"formTitle":"[41]缺失的第一个正数","frequency":0.0,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":396369,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5810801235722586,"acs":328036,"articleLive":2,"columnArticles":2448,"formTitle":"[42]接雨水","frequency":0.0,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":564528,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.448907489517504,"acs":171405,"articleLive":2,"columnArticles":1152,"formTitle":"[43]字符串相乘","frequency":0.0,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":381827,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32817318295254494,"acs":84818,"articleLive":2,"columnArticles":551,"formTitle":"[44]通配符匹配","frequency":0.0,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":258455,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.42938770866385606,"acs":203799,"articleLive":2,"columnArticles":1632,"formTitle":"[45]跳跃游戏 II","frequency":0.0,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":474627,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7829060049430372,"acs":425107,"articleLive":2,"columnArticles":2721,"formTitle":"[46]全排列","frequency":0.0,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":542986,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6376748174732304,"acs":217127,"articleLive":2,"columnArticles":1496,"formTitle":"[47]全排列 II","frequency":0.0,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":340498,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7350919201573991,"acs":223798,"articleLive":2,"columnArticles":1891,"formTitle":"[48]旋转图像","frequency":0.0,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":304449,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6651510698662808,"acs":235381,"articleLive":2,"columnArticles":1331,"formTitle":"[49]字母异位词分组","frequency":0.0,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":353876,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37629742860692056,"acs":218105,"articleLive":2,"columnArticles":1291,"formTitle":"[50]Pow(x, n)","frequency":0.0,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":579608,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.738652553474274,"acs":154501,"articleLive":2,"columnArticles":1542,"formTitle":"[51]N 皇后","frequency":0.0,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":209166,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.822660535209707,"acs":74241,"articleLive":2,"columnArticles":610,"formTitle":"[52]N皇后 II","frequency":0.0,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":90245,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5526042235689543,"acs":687895,"articleLive":2,"columnArticles":3807,"formTitle":"[53]最大子序和","frequency":0.0,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1244824,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.4811491848910578,"acs":190486,"articleLive":2,"columnArticles":2022,"formTitle":"[54]螺旋矩阵","frequency":0.0,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":395898,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4324861618991837,"acs":327847,"articleLive":2,"columnArticles":2517,"formTitle":"[55]跳跃游戏","frequency":0.0,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":758052,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.469147653875893,"acs":303980,"articleLive":2,"columnArticles":2326,"formTitle":"[56]合并区间","frequency":0.0,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":647941,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4111688582166558,"acs":86866,"articleLive":2,"columnArticles":931,"formTitle":"[57]插入区间","frequency":0.0,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":211266,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.37592812279824883,"acs":249708,"articleLive":2,"columnArticles":2684,"formTitle":"[58]最后一个单词的长度","frequency":0.0,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":664244,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7901422889750748,"acs":127943,"articleLive":2,"columnArticles":1587,"formTitle":"[59]螺旋矩阵 II","frequency":0.0,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":161924,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5241397288842544,"acs":90477,"articleLive":2,"columnArticles":955,"formTitle":"[60]排列序列","frequency":0.0,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":172620,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4175335169222795,"acs":198166,"articleLive":2,"columnArticles":2016,"formTitle":"[61]旋转链表","frequency":0.0,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":474611,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6621487824738189,"acs":316329,"articleLive":2,"columnArticles":2437,"formTitle":"[62]不同路径","frequency":0.0,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":477731,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.39163195662028205,"acs":183160,"articleLive":2,"columnArticles":1728,"formTitle":"[63]不同路径 II","frequency":0.0,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":467684,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6882639561394813,"acs":270783,"articleLive":2,"columnArticles":2093,"formTitle":"[64]最小路径和","frequency":0.0,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":393429,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2693182746269353,"acs":46166,"articleLive":2,"columnArticles":639,"formTitle":"[65]有效数字","frequency":0.0,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":171418,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.45745751726520684,"acs":352197,"articleLive":2,"columnArticles":3190,"formTitle":"[66]加一","frequency":0.0,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":769901,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5429134404573586,"acs":195628,"articleLive":2,"columnArticles":1788,"formTitle":"[67]二进制求和","frequency":0.0,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":360330,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5242967817177131,"acs":37763,"articleLive":2,"columnArticles":575,"formTitle":"[68]文本左右对齐","frequency":0.0,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":72026,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3921097213856787,"acs":389303,"articleLive":2,"columnArticles":1952,"formTitle":"[69]Sqrt(x)","frequency":0.0,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":992842,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5299049789422198,"acs":578528,"articleLive":2,"columnArticles":3611,"formTitle":"[70]爬楼梯","frequency":0.0,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1091758,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42149147670209297,"acs":94428,"articleLive":2,"columnArticles":830,"formTitle":"[71]简化路径","frequency":0.0,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":224033,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6139517656059069,"acs":177359,"articleLive":2,"columnArticles":1240,"formTitle":"[72]编辑距离","frequency":0.0,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":288881,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6043478064285682,"acs":133663,"articleLive":2,"columnArticles":986,"formTitle":"[73]矩阵置零","frequency":0.0,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":221169,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4608799608353326,"acs":170397,"articleLive":2,"columnArticles":1712,"formTitle":"[74]搜索二维矩阵","frequency":0.0,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":369721,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5961647149375996,"acs":271091,"articleLive":2,"columnArticles":1873,"formTitle":"[75]颜色分类","frequency":0.0,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":454725,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4266830005495512,"acs":186341,"articleLive":2,"columnArticles":1272,"formTitle":"[76]最小覆盖子串","frequency":0.0,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":436720,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7697868178065751,"acs":221928,"articleLive":2,"columnArticles":1307,"formTitle":"[77]组合","frequency":0.0,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":288298,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8013190352898004,"acs":314444,"articleLive":2,"columnArticles":2058,"formTitle":"[78]子集","frequency":0.0,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":392408,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45854940697813773,"acs":225748,"articleLive":2,"columnArticles":1417,"formTitle":"[79]单词搜索","frequency":0.0,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":492309,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6166876616057814,"acs":148824,"articleLive":2,"columnArticles":1330,"formTitle":"[80]删除有序数组中的重复项 II","frequency":0.0,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":241328,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4149016503055444,"acs":124724,"articleLive":2,"columnArticles":999,"formTitle":"[81]搜索旋转排序数组 II","frequency":0.0,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":300611,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5305389534731686,"acs":182594,"articleLive":2,"columnArticles":1695,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":0.0,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":344167,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5386049136752527,"acs":318734,"articleLive":2,"columnArticles":1955,"formTitle":"[83]删除排序链表中的重复元素","frequency":0.0,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":591777,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43327752227143956,"acs":183990,"articleLive":2,"columnArticles":1164,"formTitle":"[84]柱状图中最大的矩形","frequency":0.0,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":424647,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5158042428414531,"acs":98156,"articleLive":2,"columnArticles":695,"formTitle":"[85]最大矩形","frequency":0.0,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":190297,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.632572069203278,"acs":120183,"articleLive":2,"columnArticles":1108,"formTitle":"[86]分隔链表","frequency":0.0,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":189991,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48748263909151385,"acs":41768,"articleLive":2,"columnArticles":312,"formTitle":"[87]扰乱字符串","frequency":0.0,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":85681,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5170202590838958,"acs":468121,"articleLive":2,"columnArticles":3276,"formTitle":"[88]合并两个有序数组","frequency":0.0,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":905421,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.71006892238113,"acs":59033,"articleLive":2,"columnArticles":479,"formTitle":"[89]格雷编码","frequency":0.0,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":83137,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6337502853229856,"acs":138823,"articleLive":2,"columnArticles":1223,"formTitle":"[90]子集 II","frequency":0.0,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":219050,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3089615723085949,"acs":164307,"articleLive":2,"columnArticles":1528,"formTitle":"[91]解码方法","frequency":0.0,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":531804,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5486294552029775,"acs":213300,"articleLive":2,"columnArticles":2042,"formTitle":"[92]反转链表 II","frequency":0.0,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":388787,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5402895163998657,"acs":154445,"articleLive":2,"columnArticles":1340,"formTitle":"[93]复原 IP 地址","frequency":0.0,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":285856,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7555892136136633,"acs":567211,"articleLive":2,"columnArticles":2325,"formTitle":"[94]二叉树的中序遍历","frequency":0.0,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":750687,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7020949010373487,"acs":100778,"articleLive":2,"columnArticles":629,"formTitle":"[95]不同的二叉搜索树 II","frequency":0.0,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":143539,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6993704943797192,"acs":163759,"articleLive":2,"columnArticles":1295,"formTitle":"[96]不同的二叉搜索树","frequency":0.0,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":234152,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4559456248201147,"acs":61782,"articleLive":2,"columnArticles":546,"formTitle":"[97]交错字符串","frequency":0.0,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":135503,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.3500281423734168,"acs":350123,"articleLive":2,"columnArticles":1947,"formTitle":"[98]验证二叉搜索树","frequency":0.0,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1000271,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6110817176406336,"acs":71609,"articleLive":2,"columnArticles":591,"formTitle":"[99]恢复二叉搜索树","frequency":0.0,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":117184,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6023188989787058,"acs":251120,"articleLive":2,"columnArticles":1894,"formTitle":"[100]相同的树","frequency":0.0,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":416922,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5635047607636284,"acs":413861,"articleLive":2,"columnArticles":2274,"formTitle":"[101]对称二叉树","frequency":0.0,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":734441,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6418628759965593,"acs":399973,"articleLive":2,"columnArticles":2515,"formTitle":"[102]二叉树的层序遍历","frequency":0.0,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":623144,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5715489315011234,"acs":175022,"articleLive":2,"columnArticles":1597,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":0.0,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":306224,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7661682414457389,"acs":517824,"articleLive":2,"columnArticles":2571,"formTitle":"[104]二叉树的最大深度","frequency":0.0,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":675862,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.704337542763019,"acs":250149,"articleLive":2,"columnArticles":1440,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":355155,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7211908931698774,"acs":133835,"articleLive":2,"columnArticles":890,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":185575,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6969704708155638,"acs":163756,"articleLive":2,"columnArticles":1314,"formTitle":"[107]二叉树的层序遍历 II","frequency":0.0,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":234954,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7602003984299494,"acs":192707,"articleLive":2,"columnArticles":1193,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":0.0,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":253495,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7630760280226573,"acs":94436,"articleLive":2,"columnArticles":729,"formTitle":"[109]有序链表转换二叉搜索树","frequency":0.0,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":123757,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5632546241379235,"acs":257836,"articleLive":2,"columnArticles":1474,"formTitle":"[110]平衡二叉树","frequency":0.0,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":457761,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4860070886725579,"acs":272736,"articleLive":2,"columnArticles":1800,"formTitle":"[111]二叉树的最小深度","frequency":0.0,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":561177,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5259986787907049,"acs":270721,"articleLive":2,"columnArticles":1697,"formTitle":"[112]路径总和","frequency":0.0,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":514680,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6274757295056886,"acs":180457,"articleLive":2,"columnArticles":1274,"formTitle":"[113]路径总和 II","frequency":0.0,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":287592,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.72576960907842,"acs":178564,"articleLive":2,"columnArticles":1331,"formTitle":"[114]二叉树展开为链表","frequency":0.0,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":246034,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5223022555882453,"acs":61780,"articleLive":2,"columnArticles":683,"formTitle":"[115]不同的子序列","frequency":0.0,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":118284,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7039915567468746,"acs":159421,"articleLive":2,"columnArticles":1223,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":0.0,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":226453,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6140167364016736,"acs":90398,"articleLive":2,"columnArticles":768,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":0.0,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":147224,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7304243551136173,"acs":216844,"articleLive":2,"columnArticles":1745,"formTitle":"[118]杨辉三角","frequency":0.0,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":296874,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6667432932576263,"acs":145020,"articleLive":2,"columnArticles":1204,"formTitle":"[119]杨辉三角 II","frequency":0.0,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":217505,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.681159365344151,"acs":179666,"articleLive":2,"columnArticles":1581,"formTitle":"[120]三角形最小路径和","frequency":0.0,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":263765,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5733282997785506,"acs":566469,"articleLive":2,"columnArticles":3407,"formTitle":"[121]买卖股票的最佳时机","frequency":0.0,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":988036,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6891975102564674,"acs":464495,"articleLive":2,"columnArticles":2660,"formTitle":"[122]买卖股票的最佳时机 II","frequency":0.0,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":673965,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5363591678887268,"acs":132035,"articleLive":2,"columnArticles":820,"formTitle":"[123]买卖股票的最佳时机 III","frequency":0.0,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":246169,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4445016782426639,"acs":160506,"articleLive":2,"columnArticles":1101,"formTitle":"[124]二叉树中的最大路径和","frequency":0.0,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":361092,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47303994340093214,"acs":278814,"articleLive":2,"columnArticles":1839,"formTitle":"[125]验证回文串","frequency":0.0,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":589409,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3951559672096242,"acs":37117,"articleLive":2,"columnArticles":329,"formTitle":"[126]单词接龙 II","frequency":0.0,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":93930,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46795703153062884,"acs":123762,"articleLive":2,"columnArticles":653,"formTitle":"[127]单词接龙","frequency":0.0,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":264473,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5430844990685715,"acs":171713,"articleLive":2,"columnArticles":1115,"formTitle":"[128]最长连续序列","frequency":0.0,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":316181,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6822957406459091,"acs":121246,"articleLive":2,"columnArticles":1119,"formTitle":"[129]求根节点到叶节点数字之和","frequency":0.0,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":177703,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.4450140963081752,"acs":129593,"articleLive":2,"columnArticles":1180,"formTitle":"[130]被围绕的区域","frequency":0.0,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":291211,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7229862898622524,"acs":134260,"articleLive":2,"columnArticles":872,"formTitle":"[131]分割回文串","frequency":0.0,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":185702,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4921768100422393,"acs":49638,"articleLive":2,"columnArticles":438,"formTitle":"[132]分割回文串 II","frequency":0.0,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":100854,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6762733218461082,"acs":73001,"articleLive":2,"columnArticles":527,"formTitle":"[133]克隆图","frequency":0.0,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":107946,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5756904006654905,"acs":125953,"articleLive":2,"columnArticles":974,"formTitle":"[134]加油站","frequency":0.0,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":218786,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4859456536038472,"acs":99735,"articleLive":2,"columnArticles":796,"formTitle":"[135]分发糖果","frequency":0.0,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":205239,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7192233209665009,"acs":502868,"articleLive":2,"columnArticles":2276,"formTitle":"[136]只出现一次的数字","frequency":0.0,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":699182,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7197276868398659,"acs":100646,"articleLive":2,"columnArticles":756,"formTitle":"[137]只出现一次的数字 II","frequency":0.0,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":139839,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6609580613787366,"acs":112811,"articleLive":2,"columnArticles":855,"formTitle":"[138]复制带随机指针的链表","frequency":0.0,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":170678,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5149264183202396,"acs":194860,"articleLive":2,"columnArticles":1213,"formTitle":"[139]单词拆分","frequency":0.0,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":378423,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.4891750311378123,"acs":53414,"articleLive":2,"columnArticles":543,"formTitle":"[140]单词拆分 II","frequency":0.0,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":109192,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5123988788237647,"acs":533067,"articleLive":2,"columnArticles":2745,"formTitle":"[141]环形链表","frequency":0.0,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1040336,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5526245729245242,"acs":298908,"articleLive":2,"columnArticles":1740,"formTitle":"[142]环形链表 II","frequency":0.0,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":540888,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6205181457776311,"acs":127877,"articleLive":2,"columnArticles":1082,"formTitle":"[143]重排链表","frequency":0.0,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":206081,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7035472229557257,"acs":415636,"articleLive":2,"columnArticles":1844,"formTitle":"[144]二叉树的前序遍历","frequency":0.0,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":590772,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7503172022759264,"acs":302774,"articleLive":2,"columnArticles":1560,"formTitle":"[145]二叉树的后序遍历","frequency":0.0,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":403528,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.525913581929183,"acs":235431,"articleLive":2,"columnArticles":1390,"formTitle":"[146]LRU 缓存机制","frequency":0.0,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":447661,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6812351737685307,"acs":100224,"articleLive":2,"columnArticles":786,"formTitle":"[147]对链表进行插入排序","frequency":0.0,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":147121,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6668620388664631,"acs":211624,"articleLive":2,"columnArticles":1255,"formTitle":"[148]排序链表","frequency":0.0,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":317343,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3407190149843187,"acs":46932,"articleLive":2,"columnArticles":513,"formTitle":"[149]直线上最多的点数","frequency":0.0,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":137744,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.535398247845926,"acs":133410,"articleLive":2,"columnArticles":1054,"formTitle":"[150]逆波兰表达式求值","frequency":0.0,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":249179,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.4835136140054098,"acs":170352,"articleLive":2,"columnArticles":1428,"formTitle":"[151]翻转字符串里的单词","frequency":0.0,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":352321,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.421210857282215,"acs":184805,"articleLive":2,"columnArticles":1242,"formTitle":"[152]乘积最大子数组","frequency":0.0,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":438747,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5667933477730209,"acs":212225,"articleLive":2,"columnArticles":1503,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":0.0,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":374431,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5317773687242683,"acs":113535,"articleLive":2,"columnArticles":897,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":0.0,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":213501,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.573277720703517,"acs":288498,"articleLive":2,"columnArticles":1600,"formTitle":"[155]最小栈","frequency":0.0,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":503243,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7236580516898609,"acs":6552,"articleLive":2,"columnArticles":113,"formTitle":"[156]上下翻转二叉树","frequency":0.0,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","submitted":9054,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5336505778382054,"acs":5495,"articleLive":2,"columnArticles":82,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","submitted":10297,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5907270811380401,"acs":2803,"articleLive":2,"columnArticles":66,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.0,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"lock","submitted":4745,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5460181868283274,"acs":15852,"articleLive":2,"columnArticles":191,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","submitted":29032,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6141214837785651,"acs":337453,"articleLive":2,"columnArticles":1976,"formTitle":"[160]相交链表","frequency":0.0,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":549489,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33623970965743116,"acs":7597,"articleLive":2,"columnArticles":104,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.0,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","submitted":22594,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.4974116122663047,"acs":161231,"articleLive":2,"columnArticles":1091,"formTitle":"[162]寻找峰值","frequency":0.0,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":324140,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3255574857304924,"acs":9183,"articleLive":2,"columnArticles":144,"formTitle":"[163]缺失的区间","frequency":0.0,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","submitted":28207,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6103514416532607,"acs":59187,"articleLive":2,"columnArticles":490,"formTitle":"[164]最大间距","frequency":0.0,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":96972,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5189994870711764,"acs":86006,"articleLive":2,"columnArticles":920,"formTitle":"[165]比较版本号","frequency":0.0,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":165715,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.3300582450894214,"acs":40177,"articleLive":2,"columnArticles":364,"formTitle":"[166]分数到小数","frequency":0.0,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":121727,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5865625554428149,"acs":294245,"articleLive":2,"columnArticles":1930,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":0.0,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":501643,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43243118584306633,"acs":84379,"articleLive":2,"columnArticles":753,"formTitle":"[168]Excel表列名称","frequency":0.0,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":195127,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6646497425130453,"acs":388743,"articleLive":2,"columnArticles":2198,"formTitle":"[169]多数元素","frequency":0.0,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":584884,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.41857073407875545,"acs":8610,"articleLive":2,"columnArticles":87,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.0,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","submitted":20570,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.717978219570278,"acs":107332,"articleLive":2,"columnArticles":915,"formTitle":"[171]Excel 表列序号","frequency":0.0,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":149492,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.43972187847591715,"acs":91321,"articleLive":2,"columnArticles":597,"formTitle":"[172]阶乘后的零","frequency":0.0,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":207679,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8044330084026435,"acs":75344,"articleLive":2,"columnArticles":627,"formTitle":"[173]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":93661,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4805351422649331,"acs":38253,"articleLive":2,"columnArticles":406,"formTitle":"[174]地下城游戏","frequency":0.0,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":79605,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7395636018351202,"acs":305317,"articleLive":2,"columnArticles":1467,"formTitle":"[175]组合两个表","frequency":0.0,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":412834,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3559490102916169,"acs":253068,"articleLive":2,"columnArticles":1017,"formTitle":"[176]第二高的薪水","frequency":0.0,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":710967,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46282121377802077,"acs":128668,"articleLive":2,"columnArticles":501,"formTitle":"[177]第N高的薪水","frequency":0.0,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":278008,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.603212697516361,"acs":119640,"articleLive":2,"columnArticles":671,"formTitle":"[178]分数排名","frequency":0.0,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":198338,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4097231818748673,"acs":121562,"articleLive":2,"columnArticles":962,"formTitle":"[179]最大数","frequency":0.0,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":296693,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.4867652783184118,"acs":87535,"articleLive":2,"columnArticles":513,"formTitle":"[180]连续出现的数字","frequency":0.0,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":179830,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7021469778278392,"acs":163945,"articleLive":2,"columnArticles":677,"formTitle":"[181]超过经理收入的员工","frequency":0.0,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":233491,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7968114020259145,"acs":181473,"articleLive":2,"columnArticles":586,"formTitle":"[182]查找重复的电子邮箱","frequency":0.0,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":227749,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6769982293885548,"acs":150647,"articleLive":2,"columnArticles":541,"formTitle":"[183]从不订购的客户","frequency":0.0,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":222522,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.4762549435060991,"acs":102722,"articleLive":2,"columnArticles":676,"formTitle":"[184]部门工资最高的员工","frequency":0.0,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":215687,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49611028086984454,"acs":71042,"articleLive":2,"columnArticles":629,"formTitle":"[185]部门工资前三高的所有员工","frequency":0.0,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":143198,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7558648111332008,"acs":7604,"articleLive":2,"columnArticles":115,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.0,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","submitted":10060,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.48537043416417563,"acs":43678,"articleLive":2,"columnArticles":288,"formTitle":"[187]重复的DNA序列","frequency":0.0,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"","submitted":89989,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.39198260952903713,"acs":89980,"articleLive":2,"columnArticles":694,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":0.0,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":229551,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.45063316275673043,"acs":344934,"articleLive":2,"columnArticles":1713,"formTitle":"[189]旋转数组","frequency":0.0,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":765443,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6980927062894277,"acs":132350,"articleLive":2,"columnArticles":833,"formTitle":"[190]颠倒二进制位","frequency":0.0,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":189588,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7489834090793235,"acs":191005,"articleLive":2,"columnArticles":1203,"formTitle":"[191]位1的个数","frequency":0.0,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":255019,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3559297050297263,"acs":21732,"articleLive":2,"columnArticles":177,"formTitle":"[192]统计词频","frequency":0.0,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":61057,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.32496389981576457,"acs":26105,"articleLive":2,"columnArticles":140,"formTitle":"[193]有效电话号码","frequency":0.0,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":80332,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34475015918764035,"acs":10287,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":0.0,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":29839,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4362034529658992,"acs":35599,"articleLive":2,"columnArticles":142,"formTitle":"[195]第十行","frequency":0.0,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":81611,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6653605527474107,"acs":101884,"articleLive":2,"columnArticles":390,"formTitle":"[196]删除重复的电子邮箱","frequency":0.0,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":153126,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5335298868687554,"acs":94462,"articleLive":2,"columnArticles":507,"formTitle":"[197]上升的温度","frequency":0.0,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":177051,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.515256269410348,"acs":390218,"articleLive":2,"columnArticles":2688,"formTitle":"[198]打家劫舍","frequency":0.0,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":757328,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6521856882519543,"acs":142078,"articleLive":2,"columnArticles":1593,"formTitle":"[199]二叉树的右视图","frequency":0.0,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":217849,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5565280755688906,"acs":331462,"articleLive":2,"columnArticles":2123,"formTitle":"[200]岛屿数量","frequency":0.0,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":595589,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.523972133514613,"acs":49715,"articleLive":2,"columnArticles":323,"formTitle":"[201]数字范围按位与","frequency":0.0,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":94881,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6191199337334515,"acs":170414,"articleLive":2,"columnArticles":1387,"formTitle":"[202]快乐数","frequency":0.0,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":275252,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5161832841795282,"acs":234181,"articleLive":2,"columnArticles":1671,"formTitle":"[203]移除链表元素","frequency":0.0,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":453678,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37781344739673794,"acs":169237,"articleLive":2,"columnArticles":733,"formTitle":"[204]计数质数","frequency":0.0,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":447938,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5007224767116549,"acs":114009,"articleLive":2,"columnArticles":874,"formTitle":"[205]同构字符串","frequency":0.0,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":227689,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7231193458946389,"acs":714601,"articleLive":2,"columnArticles":7382,"formTitle":"[206]反转链表","frequency":0.0,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":988220,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5433051089334983,"acs":142767,"articleLive":2,"columnArticles":936,"formTitle":"[207]课程表","frequency":0.0,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":262775,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7168752654819176,"acs":145140,"articleLive":2,"columnArticles":981,"formTitle":"[208]实现 Trie (前缀树)","frequency":0.0,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":202462,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.47228622353606053,"acs":195552,"articleLive":2,"columnArticles":1388,"formTitle":"[209]长度最小的子数组","frequency":0.0,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":414054,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.542249068057404,"acs":90041,"articleLive":2,"columnArticles":674,"formTitle":"[210]课程表 II","frequency":0.0,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":166051,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4818766130225371,"acs":29314,"articleLive":2,"columnArticles":324,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":0.0,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":60833,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4626837795840306,"acs":61933,"articleLive":2,"columnArticles":573,"formTitle":"[212]单词搜索 II","frequency":0.0,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":133856,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4329565364100035,"acs":166803,"articleLive":2,"columnArticles":1533,"formTitle":"[213]打家劫舍 II","frequency":0.0,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":385265,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3712946284787251,"acs":31126,"articleLive":2,"columnArticles":304,"formTitle":"[214]最短回文串","frequency":0.0,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":83831,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6462319828067938,"acs":442919,"articleLive":2,"columnArticles":2302,"formTitle":"[215]数组中的第K个最大元素","frequency":0.0,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":685387,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.737218429908469,"acs":100115,"articleLive":2,"columnArticles":1034,"formTitle":"[216]组合总和 III","frequency":0.0,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":135801,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5584116823364673,"acs":368478,"articleLive":2,"columnArticles":1718,"formTitle":"[217]存在重复元素","frequency":0.0,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":659868,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5424881618596642,"acs":31505,"articleLive":2,"columnArticles":279,"formTitle":"[218]天际线问题","frequency":0.0,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":58075,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.42484354750536163,"acs":111131,"articleLive":2,"columnArticles":891,"formTitle":"[219]存在重复元素 II","frequency":0.0,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":261581,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28666127943736014,"acs":64563,"articleLive":2,"columnArticles":419,"formTitle":"[220]存在重复元素 III","frequency":0.0,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":225224,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4764465073860949,"acs":140010,"articleLive":2,"columnArticles":987,"formTitle":"[221]最大正方形","frequency":0.0,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":293863,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7813072734812913,"acs":116807,"articleLive":2,"columnArticles":878,"formTitle":"[222]完全二叉树的节点个数","frequency":0.0,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":149502,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5229130479207111,"acs":40942,"articleLive":2,"columnArticles":514,"formTitle":"[223]矩形面积","frequency":0.0,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":78296,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4180920648119411,"acs":71398,"articleLive":2,"columnArticles":657,"formTitle":"[224]基本计算器","frequency":0.0,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":170771,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6756131420638594,"acs":135780,"articleLive":2,"columnArticles":4758,"formTitle":"[225]用队列实现栈","frequency":0.0,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":200973,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7878110040474184,"acs":306761,"articleLive":2,"columnArticles":1865,"formTitle":"[226]翻转二叉树","frequency":0.0,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":389384,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4373167229558922,"acs":86496,"articleLive":2,"columnArticles":702,"formTitle":"[227]基本计算器 II","frequency":0.0,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":197788,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5802452841682064,"acs":57153,"articleLive":2,"columnArticles":643,"formTitle":"[228]汇总区间","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":98498,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.46379677325910906,"acs":36825,"articleLive":2,"columnArticles":314,"formTitle":"[229]求众数 II","frequency":0.0,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":79399,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7415455314772958,"acs":138451,"articleLive":2,"columnArticles":868,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.0,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":186706,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5043971937010986,"acs":168450,"articleLive":2,"columnArticles":1217,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":333963,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6911427438267347,"acs":160323,"articleLive":2,"columnArticles":1275,"formTitle":"[232]用栈实现队列","frequency":0.0,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":231968,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4770682830966813,"acs":34472,"articleLive":2,"columnArticles":415,"formTitle":"[233]数字 1 的个数","frequency":0.0,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":72258,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.4962952127152116,"acs":312128,"articleLive":2,"columnArticles":1998,"formTitle":"[234]回文链表","frequency":0.0,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":628916,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6660942166976257,"acs":171047,"articleLive":2,"columnArticles":980,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":256791,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6807059904205761,"acs":259366,"articleLive":2,"columnArticles":1394,"formTitle":"[236]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":381025,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8480959394066905,"acs":209612,"articleLive":2,"columnArticles":1014,"formTitle":"[237]删除链表中的节点","frequency":0.0,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":247156,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7230513493156022,"acs":139191,"articleLive":2,"columnArticles":873,"formTitle":"[238]除自身以外数组的乘积","frequency":0.0,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":192505,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4966543836153143,"acs":193949,"articleLive":2,"columnArticles":1321,"formTitle":"[239]滑动窗口最大值","frequency":0.0,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":390511,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4780589979815293,"acs":169579,"articleLive":2,"columnArticles":766,"formTitle":"[240]搜索二维矩阵 II","frequency":0.0,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":354724,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7378893537889354,"acs":31744,"articleLive":2,"columnArticles":285,"formTitle":"[241]为运算表达式设计优先级","frequency":0.0,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":43020,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6453645166056218,"acs":292667,"articleLive":2,"columnArticles":1695,"formTitle":"[242]有效的字母异位词","frequency":0.0,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":453491,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6557279679263494,"acs":8832,"articleLive":2,"columnArticles":105,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","submitted":13469,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5513668430335097,"acs":5002,"articleLive":2,"columnArticles":58,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","submitted":9072,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6034675615212528,"acs":4316,"articleLive":2,"columnArticles":59,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","submitted":7152,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.47667493796526056,"acs":5763,"articleLive":2,"columnArticles":108,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","submitted":12090,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5240170247263883,"acs":5171,"articleLive":2,"columnArticles":92,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","submitted":9868,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4636842105263158,"acs":2643,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","submitted":5700,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6387782204515272,"acs":5772,"articleLive":2,"columnArticles":101,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","submitted":9036,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6343612334801763,"acs":4464,"articleLive":2,"columnArticles":77,"formTitle":"[250]统计同值子树","frequency":0.0,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","submitted":7037,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5433308214016579,"acs":3605,"articleLive":2,"columnArticles":68,"formTitle":"[251]展开二维向量","frequency":0.0,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","submitted":6635,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5631704689183492,"acs":12022,"articleLive":2,"columnArticles":157,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","submitted":21347,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5003750468808601,"acs":32020,"articleLive":2,"columnArticles":344,"formTitle":"[253]会议室 II","frequency":0.0,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","submitted":63992,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5694874060980999,"acs":5155,"articleLive":2,"columnArticles":75,"formTitle":"[254]因子的组合","frequency":0.0,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","submitted":9052,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47348242811501595,"acs":5187,"articleLive":2,"columnArticles":59,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","submitted":10955,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.639864161691406,"acs":11682,"articleLive":2,"columnArticles":185,"formTitle":"[256]粉刷房子","frequency":0.0,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","submitted":18257,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6825578730231492,"acs":142944,"articleLive":2,"columnArticles":1061,"formTitle":"[257]二叉树的所有路径","frequency":0.0,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":209424,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6919894001954449,"acs":78601,"articleLive":2,"columnArticles":653,"formTitle":"[258]各位相加","frequency":0.0,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":113587,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5646383284153441,"acs":7080,"articleLive":2,"columnArticles":84,"formTitle":"[259]较小的三数之和","frequency":0.0,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","submitted":12539,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7231503579952268,"acs":52116,"articleLive":2,"columnArticles":442,"formTitle":"[260]只出现一次的数字 III","frequency":0.0,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":72068,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.4948875255623722,"acs":8470,"articleLive":2,"columnArticles":117,"formTitle":"[261]以图判树","frequency":0.0,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","submitted":17115,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.4349817472734281,"acs":38368,"articleLive":2,"columnArticles":372,"formTitle":"[262]行程和用户","frequency":0.0,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":88206,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5151449359271267,"acs":106771,"articleLive":2,"columnArticles":834,"formTitle":"[263]丑数","frequency":0.0,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":207264,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5798280928252469,"acs":100243,"articleLive":2,"columnArticles":614,"formTitle":"[264]丑数 II","frequency":0.0,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":172884,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5885867682715622,"acs":6797,"articleLive":2,"columnArticles":153,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","submitted":11548,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6739152320547669,"acs":6694,"articleLive":2,"columnArticles":103,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","submitted":9933,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44766146993318484,"acs":3417,"articleLive":2,"columnArticles":77,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","submitted":7633,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6253306510998391,"acs":152006,"articleLive":2,"columnArticles":1098,"formTitle":"[268]丢失的数字","frequency":0.0,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":243081,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3386327503974563,"acs":6390,"articleLive":2,"columnArticles":104,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","submitted":18870,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5528985096616988,"acs":9757,"articleLive":2,"columnArticles":138,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.0,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","submitted":17647,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.552968323893434,"acs":2636,"articleLive":2,"columnArticles":45,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","submitted":4767,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6474032105760151,"acs":3428,"articleLive":2,"columnArticles":75,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","submitted":5295,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3104580943477272,"acs":12287,"articleLive":2,"columnArticles":161,"formTitle":"[273]整数转换英文表示","frequency":0.0,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"","submitted":39577,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4399682037581847,"acs":53688,"articleLive":2,"columnArticles":563,"formTitle":"[274]H 指数","frequency":0.0,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":122027,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.46212540990307666,"acs":50874,"articleLive":2,"columnArticles":414,"formTitle":"[275]H 指数 II","frequency":0.0,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":110087,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.491491282906161,"acs":7076,"articleLive":2,"columnArticles":128,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","submitted":14397,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5694657660423703,"acs":7419,"articleLive":2,"columnArticles":84,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","submitted":13028,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4536062157275249,"acs":184136,"articleLive":2,"columnArticles":1046,"formTitle":"[278]第一个错误的版本","frequency":0.0,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":405938,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6318947862379305,"acs":203333,"articleLive":2,"columnArticles":1197,"formTitle":"[279]完全平方数","frequency":0.0,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":321783,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.68529843444227,"acs":5603,"articleLive":2,"columnArticles":70,"formTitle":"[280]摆动排序","frequency":0.0,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","submitted":8176,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7580357142857143,"acs":2547,"articleLive":2,"columnArticles":64,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","submitted":3360,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.3914196319669088,"acs":7381,"articleLive":2,"columnArticles":79,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":18857,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6387446997785757,"acs":491843,"articleLive":2,"columnArticles":3379,"formTitle":"[283]移动零","frequency":0.0,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":770015,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.735102618542109,"acs":10387,"articleLive":2,"columnArticles":105,"formTitle":"[284]窥探迭代器","frequency":0.0,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"","submitted":14130,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.635041716328963,"acs":7992,"articleLive":2,"columnArticles":102,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","submitted":12585,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5092879256965944,"acs":11515,"articleLive":2,"columnArticles":150,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","submitted":22610,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6598337134868663,"acs":179356,"articleLive":2,"columnArticles":1223,"formTitle":"[287]寻找重复数","frequency":0.0,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":271820,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.43133366385721367,"acs":3480,"articleLive":2,"columnArticles":54,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","submitted":8068,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7530309706212601,"acs":52981,"articleLive":2,"columnArticles":828,"formTitle":"[289]生命游戏","frequency":0.0,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":70357,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45686218207118956,"acs":82735,"articleLive":2,"columnArticles":1095,"formTitle":"[290]单词规律","frequency":0.0,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":181094,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5319730753050063,"acs":2529,"articleLive":2,"columnArticles":55,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","submitted":4754,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7084211371964974,"acs":114636,"articleLive":2,"columnArticles":766,"formTitle":"[292]Nim 游戏","frequency":0.0,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":161819,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7123406720741599,"acs":4918,"articleLive":2,"columnArticles":84,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","submitted":6904,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5823538882627596,"acs":3617,"articleLive":2,"columnArticles":55,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","submitted":6211,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5230539435343666,"acs":64083,"articleLive":2,"columnArticles":501,"formTitle":"[295]数据流的中位数","frequency":0.0,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":122517,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6191794613642084,"acs":2460,"articleLive":2,"columnArticles":46,"formTitle":"[296]最佳的碰头地点","frequency":0.0,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","submitted":3973,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5598531497882785,"acs":105375,"articleLive":2,"columnArticles":757,"formTitle":"[297]二叉树的序列化与反序列化","frequency":0.0,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":188219,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5772732647510938,"acs":4882,"articleLive":2,"columnArticles":82,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","submitted":8457,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5041952581122169,"acs":30346,"articleLive":2,"columnArticles":359,"formTitle":"[299]猜数字游戏","frequency":0.0,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":60187,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.516226332450674,"acs":362999,"articleLive":2,"columnArticles":2017,"formTitle":"[300]最长递增子序列","frequency":0.0,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":703178,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5232348189679749,"acs":33036,"articleLive":2,"columnArticles":233,"formTitle":"[301]删除无效的括号","frequency":0.0,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":63138,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6560052219321149,"acs":2010,"articleLive":2,"columnArticles":38,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","submitted":3064,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7262071751596287,"acs":129429,"articleLive":2,"columnArticles":795,"formTitle":"[303]区域和检索 - 数组不可变","frequency":0.0,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":178226,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5461958632115768,"acs":63297,"articleLive":2,"columnArticles":561,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":0.0,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":115887,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3809821987655425,"acs":4259,"articleLive":2,"columnArticles":64,"formTitle":"[305]岛屿数量 II","frequency":0.0,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","submitted":11179,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3373168928235976,"acs":16879,"articleLive":2,"columnArticles":251,"formTitle":"[306]累加数","frequency":0.0,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":50039,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5409887924801157,"acs":23942,"articleLive":2,"columnArticles":231,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.0,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":44256,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6098023287300298,"acs":2252,"articleLive":2,"columnArticles":42,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","submitted":3693,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6078597827999959,"acs":117430,"articleLive":2,"columnArticles":933,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":0.0,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":193186,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3793792228996231,"acs":21842,"articleLive":2,"columnArticles":213,"formTitle":"[310]最小高度树","frequency":0.0,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":57573,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7608274078862314,"acs":3531,"articleLive":2,"columnArticles":44,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.0,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","submitted":4641,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6827679881635277,"acs":56299,"articleLive":2,"columnArticles":381,"formTitle":"[312]戳气球","frequency":0.0,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":82457,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6306944035688286,"acs":40717,"articleLive":2,"columnArticles":355,"formTitle":"[313]超级丑数","frequency":0.0,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":64559,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5461241246075828,"acs":4523,"articleLive":2,"columnArticles":87,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","submitted":8282,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41803923517087754,"acs":50482,"articleLive":2,"columnArticles":480,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":0.0,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":120759,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47642902564827244,"acs":67429,"articleLive":2,"columnArticles":530,"formTitle":"[316]去除重复字母","frequency":0.0,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":141530,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48345650938032975,"acs":4252,"articleLive":2,"columnArticles":64,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","submitted":8795,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.684403794498657,"acs":20129,"articleLive":2,"columnArticles":177,"formTitle":"[318]最大单词长度乘积","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":29411,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5182412626832018,"acs":22984,"articleLive":2,"columnArticles":227,"formTitle":"[319]灯泡开关","frequency":0.0,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":44350,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6760531135531136,"acs":2953,"articleLive":2,"columnArticles":49,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","submitted":4368,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42427096135736064,"acs":26581,"articleLive":2,"columnArticles":230,"formTitle":"[321]拼接最大数","frequency":0.0,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":62651,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.444739463295115,"acs":305854,"articleLive":2,"columnArticles":1821,"formTitle":"[322]零钱兑换","frequency":0.0,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":687715,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6319432224763916,"acs":10774,"articleLive":2,"columnArticles":147,"formTitle":"[323]无向图中连通分量的数目","frequency":0.0,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","submitted":17049,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.378315342523099,"acs":25304,"articleLive":2,"columnArticles":168,"formTitle":"[324]摆动排序 II","frequency":0.0,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":66886,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5382886776145203,"acs":9342,"articleLive":2,"columnArticles":103,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.0,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","submitted":17355,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5044935081366919,"acs":135568,"articleLive":2,"columnArticles":574,"formTitle":"[326]3的幂","frequency":0.0,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":268721,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42143198742911797,"acs":24674,"articleLive":2,"columnArticles":204,"formTitle":"[327]区间和的个数","frequency":0.0,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":58548,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6558145446226583,"acs":129002,"articleLive":2,"columnArticles":1067,"formTitle":"[328]奇偶链表","frequency":0.0,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":196705,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4854413377903311,"acs":56201,"articleLive":2,"columnArticles":490,"formTitle":"[329]矩阵中的最长递增路径","frequency":0.0,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":115773,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5337506344104213,"acs":18930,"articleLive":2,"columnArticles":149,"formTitle":"[330]按要求补齐数组","frequency":0.0,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35466,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4798313047191971,"acs":44941,"articleLive":2,"columnArticles":504,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.0,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":93660,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.44962568058076224,"acs":39639,"articleLive":2,"columnArticles":328,"formTitle":"[332]重新安排行程","frequency":0.0,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":88160,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4684283452098179,"acs":4733,"articleLive":2,"columnArticles":81,"formTitle":"[333]最大 BST 子树","frequency":0.0,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","submitted":10104,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4119908654618116,"acs":46185,"articleLive":2,"columnArticles":303,"formTitle":"[334]递增的三元子序列","frequency":0.0,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":112102,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.3687130177514793,"acs":2991,"articleLive":2,"columnArticles":37,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":8112,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.40127826763955027,"acs":22163,"articleLive":2,"columnArticles":192,"formTitle":"[336]回文对","frequency":0.0,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":55231,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6078633115295979,"acs":130566,"articleLive":2,"columnArticles":924,"formTitle":"[337]打家劫舍 III","frequency":0.0,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":214795,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7869038178316529,"acs":159758,"articleLive":2,"columnArticles":1373,"formTitle":"[338]比特位计数","frequency":0.0,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":203021,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.808168585704975,"acs":3720,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","submitted":4603,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.4943255580216927,"acs":11804,"articleLive":2,"columnArticles":176,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","submitted":23879,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.727334998216197,"acs":50968,"articleLive":2,"columnArticles":488,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":0.0,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":70075,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5160282210331929,"acs":87184,"articleLive":2,"columnArticles":766,"formTitle":"[342]4的幂","frequency":0.0,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":168952,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6058020852788978,"acs":110279,"articleLive":2,"columnArticles":1049,"formTitle":"[343]整数拆分","frequency":0.0,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":182038,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7685020364433736,"acs":368695,"articleLive":2,"columnArticles":1940,"formTitle":"[344]反转字符串","frequency":0.0,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":479758,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5391238174818705,"acs":108393,"articleLive":2,"columnArticles":1028,"formTitle":"[345]反转字符串中的元音字母","frequency":0.0,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":201054,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7076923076923077,"acs":12236,"articleLive":2,"columnArticles":135,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","submitted":17290,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6222538905456746,"acs":202604,"articleLive":2,"columnArticles":1489,"formTitle":"[347]前 K 个高频元素","frequency":0.0,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":325597,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.5992601726263872,"acs":4860,"articleLive":2,"columnArticles":80,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","submitted":8110,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7388807946791766,"acs":214520,"articleLive":2,"columnArticles":1507,"formTitle":"[349]两个数组的交集","frequency":0.0,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":290331,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5500147614158621,"acs":249644,"articleLive":2,"columnArticles":1399,"formTitle":"[350]两个数组的交集 II","frequency":0.0,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":453886,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5900627960779994,"acs":5356,"articleLive":2,"columnArticles":100,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","submitted":9077,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.5923344947735192,"acs":4420,"articleLive":2,"columnArticles":85,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"","submitted":7462,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4261529480443666,"acs":2190,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":0.0,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","submitted":5139,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.45340069957248347,"acs":69996,"articleLive":2,"columnArticles":541,"formTitle":"[354]俄罗斯套娃信封问题","frequency":0.0,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":154380,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4067263266151933,"acs":26497,"articleLive":2,"columnArticles":438,"formTitle":"[355]设计推特","frequency":0.0,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":65147,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.3531754813011728,"acs":1596,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","submitted":4519,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5203524526233689,"acs":24685,"articleLive":2,"columnArticles":387,"formTitle":"[357]计算各个位数不同的数字个数","frequency":0.0,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":47439,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.3521473366674605,"acs":4436,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","submitted":12597,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7265009096422074,"acs":4792,"articleLive":2,"columnArticles":56,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","submitted":6596,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6084804132587172,"acs":2827,"articleLive":2,"columnArticles":62,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","submitted":4646,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5648868152756178,"acs":3269,"articleLive":2,"columnArticles":64,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","submitted":5787,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6911733726564145,"acs":3281,"articleLive":2,"columnArticles":63,"formTitle":"[362]敲击计数器","frequency":0.0,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","submitted":4747,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.4899864500662607,"acs":32907,"articleLive":2,"columnArticles":214,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":67159,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7212073073868149,"acs":1816,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","submitted":2518,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.36525593211177776,"acs":33788,"articleLive":2,"columnArticles":482,"formTitle":"[365]水壶问题","frequency":0.0,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":92505,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7660839790953325,"acs":4251,"articleLive":2,"columnArticles":120,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","submitted":5549,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4389120982180919,"acs":77220,"articleLive":2,"columnArticles":611,"formTitle":"[367]有效的完全平方数","frequency":0.0,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":175935,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.45923153143234613,"acs":41712,"articleLive":2,"columnArticles":451,"formTitle":"[368]最大整除子集","frequency":0.0,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":90830,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.616898307417091,"acs":4483,"articleLive":2,"columnArticles":130,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","submitted":7267,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7217587373167982,"acs":3201,"articleLive":2,"columnArticles":48,"formTitle":"[370]区间加法","frequency":0.0,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","submitted":4435,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6130404670030671,"acs":80548,"articleLive":2,"columnArticles":506,"formTitle":"[371]两整数之和","frequency":0.0,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":131391,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5104200645137907,"acs":14083,"articleLive":2,"columnArticles":135,"formTitle":"[372]超级次方","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":27591,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4178911508783451,"acs":20363,"articleLive":2,"columnArticles":207,"formTitle":"[373]查找和最小的K对数字","frequency":0.0,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":48728,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5151524556786016,"acs":82989,"articleLive":2,"columnArticles":564,"formTitle":"[374]猜数字大小","frequency":0.0,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":161096,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.46859389603274354,"acs":14540,"articleLive":2,"columnArticles":121,"formTitle":"[375]猜数字大小 II","frequency":0.0,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":31029,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4638703374887104,"acs":75500,"articleLive":2,"columnArticles":810,"formTitle":"[376]摆动序列","frequency":0.0,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":162761,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5088466992279818,"acs":64593,"articleLive":2,"columnArticles":550,"formTitle":"[377]组合总和 Ⅳ","frequency":0.0,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":126940,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6389282824155309,"acs":79744,"articleLive":2,"columnArticles":564,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":0.0,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":124809,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6393575930067087,"acs":3145,"articleLive":2,"columnArticles":69,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","submitted":4919,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5029646704069355,"acs":34694,"articleLive":2,"columnArticles":216,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":0.0,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":68979,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.4416185213095537,"acs":21097,"articleLive":2,"columnArticles":176,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":47772,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6309035112191622,"acs":15830,"articleLive":2,"columnArticles":125,"formTitle":"[382]链表随机节点","frequency":0.0,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":25091,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6007428363156707,"acs":69226,"articleLive":2,"columnArticles":761,"formTitle":"[383]赎金信","frequency":0.0,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":115234,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5785540609873073,"acs":51872,"articleLive":2,"columnArticles":200,"formTitle":"[384]打乱数组","frequency":0.0,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":89658,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4168986874254219,"acs":7337,"articleLive":2,"columnArticles":84,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17599,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7494543134423587,"acs":22318,"articleLive":2,"columnArticles":240,"formTitle":"[386]字典序排数","frequency":0.0,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":29779,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5336589305285827,"acs":222032,"articleLive":2,"columnArticles":1203,"formTitle":"[387]字符串中的第一个唯一字符","frequency":0.0,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":416056,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5263618081664773,"acs":6020,"articleLive":2,"columnArticles":110,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":11437,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6919162397276759,"acs":100615,"articleLive":2,"columnArticles":987,"formTitle":"[389]找不同","frequency":0.0,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":145415,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46717607973421926,"acs":7031,"articleLive":2,"columnArticles":94,"formTitle":"[390]消除游戏","frequency":0.0,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":15050,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.3578906552927491,"acs":4615,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":12895,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5151966187611017,"acs":146762,"articleLive":2,"columnArticles":1578,"formTitle":"[392]判断子序列","frequency":0.0,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":284866,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3913535696596618,"acs":11062,"articleLive":2,"columnArticles":127,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":28266,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5525332075197793,"acs":121796,"articleLive":2,"columnArticles":1297,"formTitle":"[394]字符串解码","frequency":0.0,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":220432,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5204587755923337,"acs":51731,"articleLive":2,"columnArticles":429,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":0.0,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":99395,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.4279796648465449,"acs":9092,"articleLive":2,"columnArticles":146,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":21244,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.3775303396576563,"acs":15461,"articleLive":2,"columnArticles":192,"formTitle":"[397]整数替换","frequency":0.0,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":40953,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6572457491908648,"acs":14418,"articleLive":2,"columnArticles":121,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":21937,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5923059573148383,"acs":42017,"articleLive":2,"columnArticles":528,"formTitle":"[399]除法求值","frequency":0.0,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":70938,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4158748024849023,"acs":19213,"articleLive":2,"columnArticles":196,"formTitle":"[400]第 N 位数字","frequency":0.0,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":46199,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6137723183707019,"acs":53764,"articleLive":2,"columnArticles":656,"formTitle":"[401]二进制手表","frequency":0.0,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":87596,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.32692214171083983,"acs":80670,"articleLive":2,"columnArticles":587,"formTitle":"[402]移掉 K 位数字","frequency":0.0,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":246756,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4555928088903923,"acs":45793,"articleLive":2,"columnArticles":461,"formTitle":"[403]青蛙过河","frequency":0.0,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":100513,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5835364328550073,"acs":100321,"articleLive":2,"columnArticles":1125,"formTitle":"[404]左叶子之和","frequency":0.0,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":171919,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5621274064323415,"acs":44412,"articleLive":2,"columnArticles":453,"formTitle":"[405]数字转换为十六进制数","frequency":0.0,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":79007,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7373234402346736,"acs":119644,"articleLive":2,"columnArticles":791,"formTitle":"[406]根据身高重建队列","frequency":0.0,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":162268,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.48445133408493046,"acs":10313,"articleLive":2,"columnArticles":130,"formTitle":"[407]接雨水 II","frequency":0.0,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":21288,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.32380864595815284,"acs":3513,"articleLive":2,"columnArticles":82,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","submitted":10849,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5558218976382591,"acs":94373,"articleLive":2,"columnArticles":1321,"formTitle":"[409]最长回文串","frequency":0.0,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":169790,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5641775562246971,"acs":39159,"articleLive":2,"columnArticles":317,"formTitle":"[410]分割数组的最大值","frequency":0.0,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":69409,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.49773499433748586,"acs":879,"articleLive":2,"columnArticles":21,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","submitted":1766,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6744281642794504,"acs":73831,"articleLive":2,"columnArticles":376,"formTitle":"[412]Fizz Buzz","frequency":0.0,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":109472,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6878918325484644,"acs":71430,"articleLive":2,"columnArticles":928,"formTitle":"[413]等差数列划分","frequency":0.0,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":103839,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.36371228115572124,"acs":61846,"articleLive":2,"columnArticles":852,"formTitle":"[414]第三大的数","frequency":0.0,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":170041,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5380985757744362,"acs":148936,"articleLive":2,"columnArticles":1076,"formTitle":"[415]字符串相加","frequency":0.0,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":276782,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5074315180363059,"acs":173980,"articleLive":2,"columnArticles":984,"formTitle":"[416]分割等和子集","frequency":0.0,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":342864,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4802503550202493,"acs":27393,"articleLive":2,"columnArticles":320,"formTitle":"[417]太平洋大西洋水流问题","frequency":0.0,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":57039,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.36320834033966704,"acs":2160,"articleLive":2,"columnArticles":33,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","submitted":5947,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.756093023255814,"acs":12192,"articleLive":2,"columnArticles":157,"formTitle":"[419]甲板上的战舰","frequency":0.0,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":16125,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.2077430108341541,"acs":2742,"articleLive":2,"columnArticles":52,"formTitle":"[420]强密码检验器","frequency":0.0,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13199,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6222514317904422,"acs":33138,"articleLive":2,"columnArticles":306,"formTitle":"[421]数组中两个数的最大异或值","frequency":0.0,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":53255,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4268791729485247,"acs":1982,"articleLive":2,"columnArticles":48,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","submitted":4643,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5707125440260092,"acs":8426,"articleLive":2,"columnArticles":137,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14764,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5309873245392382,"acs":51484,"articleLive":2,"columnArticles":448,"formTitle":"[424]替换后的最长重复字符","frequency":0.0,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":96959,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6150121065375302,"acs":1524,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","submitted":2478,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6679333528208127,"acs":6855,"articleLive":2,"columnArticles":113,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":0.0,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","submitted":10263,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.61302339442706,"acs":4114,"articleLive":2,"columnArticles":67,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6711,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6507425742574258,"acs":2629,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","submitted":4040,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6993756640284592,"acs":58586,"articleLive":2,"columnArticles":473,"formTitle":"[429]N 叉树的层序遍历","frequency":0.0,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":83769,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5876461439450821,"acs":43829,"articleLive":2,"columnArticles":672,"formTitle":"[430]扁平化多级双向链表","frequency":0.0,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":74584,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7299145299145299,"acs":854,"articleLive":2,"columnArticles":29,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","submitted":1170,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.37788097695218437,"acs":6591,"articleLive":2,"columnArticles":85,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.0,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17442,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5320899801018515,"acs":15777,"articleLive":2,"columnArticles":211,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":29651,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.37406805260271864,"acs":38884,"articleLive":2,"columnArticles":534,"formTitle":"[434]字符串中的单词数","frequency":0.0,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"","submitted":103949,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5081307239137078,"acs":96430,"articleLive":2,"columnArticles":843,"formTitle":"[435]无重叠区间","frequency":0.0,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":189774,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4877734155916994,"acs":8697,"articleLive":2,"columnArticles":141,"formTitle":"[436]寻找右区间","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":17830,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5743236979214952,"acs":123900,"articleLive":2,"columnArticles":1023,"formTitle":"[437]路径总和 III","frequency":0.0,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":215732,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5183064233832152,"acs":94763,"articleLive":2,"columnArticles":828,"formTitle":"[438]找到字符串中所有字母异位词","frequency":0.0,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":182832,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5901840490797546,"acs":2886,"articleLive":2,"columnArticles":68,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","submitted":4890,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.38013398013398014,"acs":16456,"articleLive":2,"columnArticles":122,"formTitle":"[440]字典序的第K小数字","frequency":0.0,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":43290,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.42548277236332016,"acs":46975,"articleLive":2,"columnArticles":476,"formTitle":"[441]排列硬币","frequency":0.0,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":110404,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6975206345630943,"acs":43353,"articleLive":2,"columnArticles":435,"formTitle":"[442]数组中重复的数据","frequency":0.0,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":62153,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.47704200824024123,"acs":56155,"articleLive":2,"columnArticles":692,"formTitle":"[443]压缩字符串","frequency":0.0,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":117715,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.25191627358490565,"acs":3418,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":0.0,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","submitted":13568,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5887780388348128,"acs":82446,"articleLive":2,"columnArticles":932,"formTitle":"[445]两数相加 II","frequency":0.0,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":140029,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.551630201015112,"acs":19237,"articleLive":2,"columnArticles":171,"formTitle":"[446]等差数列划分 II - 子序列","frequency":0.0,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":34873,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6628670027036941,"acs":48789,"articleLive":2,"columnArticles":376,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":73603,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6484296227890803,"acs":137624,"articleLive":2,"columnArticles":1080,"formTitle":"[448]找到所有数组中消失的数字","frequency":0.0,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":212242,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5566935425292365,"acs":15328,"articleLive":2,"columnArticles":136,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":27534,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4857886116196165,"acs":60504,"articleLive":2,"columnArticles":616,"formTitle":"[450]删除二叉搜索树中的节点","frequency":0.0,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":124548,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7114646235470697,"acs":81531,"articleLive":2,"columnArticles":950,"formTitle":"[451]根据字符出现频率排序","frequency":0.0,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":114596,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5089318991900135,"acs":96950,"articleLive":2,"columnArticles":841,"formTitle":"[452]用最少数量的箭引爆气球","frequency":0.0,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":190497,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5556368216818025,"acs":27349,"articleLive":2,"columnArticles":307,"formTitle":"[453]最小操作次数使数组元素相等","frequency":0.0,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":49221,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6027367921858388,"acs":78800,"articleLive":2,"columnArticles":492,"formTitle":"[454]四数相加 II","frequency":0.0,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":130737,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5770122884074421,"acs":151996,"articleLive":2,"columnArticles":1240,"formTitle":"[455]分发饼干","frequency":0.0,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":263419,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.36241854190001016,"acs":56949,"articleLive":2,"columnArticles":458,"formTitle":"[456]132 模式","frequency":0.0,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":157136,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43593245027083616,"acs":28731,"articleLive":2,"columnArticles":332,"formTitle":"[457]环形数组是否存在循环","frequency":0.0,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":65907,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6108392242160594,"acs":6740,"articleLive":2,"columnArticles":63,"formTitle":"[458]可怜的小猪","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":11034,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5114608477358309,"acs":79458,"articleLive":2,"columnArticles":639,"formTitle":"[459]重复的子字符串","frequency":0.0,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":155355,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4378291851698854,"acs":33916,"articleLive":2,"columnArticles":403,"formTitle":"[460]LFU 缓存","frequency":0.0,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":77464,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8121093693874912,"acs":169566,"articleLive":2,"columnArticles":1353,"formTitle":"[461]汉明距离","frequency":0.0,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":208797,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6045275252958326,"acs":14100,"articleLive":2,"columnArticles":130,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":0.0,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":23324,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7089406969411721,"acs":77573,"articleLive":2,"columnArticles":932,"formTitle":"[463]岛屿的周长","frequency":0.0,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":109421,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.35704925368363855,"acs":11171,"articleLive":2,"columnArticles":111,"formTitle":"[464]我能赢吗","frequency":0.0,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":31287,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5318015318015318,"acs":1597,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","submitted":3003,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37393066186402524,"acs":11627,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31094,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.4414605775552521,"acs":8729,"articleLive":2,"columnArticles":112,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.0,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":19773,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.2510444665921698,"acs":24937,"articleLive":2,"columnArticles":297,"formTitle":"[468]验证IP地址","frequency":0.0,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":99333,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4351010840902432,"acs":1485,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.0,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","submitted":3413,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5467792467121119,"acs":63527,"articleLive":2,"columnArticles":334,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":0.0,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":116184,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6174757281553398,"acs":1272,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":0.0,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","submitted":2060,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.4000607164541591,"acs":6589,"articleLive":2,"columnArticles":81,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":16470,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.42043537633544864,"acs":20936,"articleLive":2,"columnArticles":179,"formTitle":"[473]火柴拼正方形","frequency":0.0,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":49796,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6116452037220481,"acs":75329,"articleLive":2,"columnArticles":596,"formTitle":"[474]一和零","frequency":0.0,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":123158,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.3337630066780556,"acs":21491,"articleLive":2,"columnArticles":239,"formTitle":"[475]供暖器","frequency":0.0,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":64390,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7014958571984652,"acs":37845,"articleLive":2,"columnArticles":482,"formTitle":"[476]数字的补数","frequency":0.0,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":53949,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6037407568508047,"acs":38864,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":0.0,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":64372,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4379417398771385,"acs":6630,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":0.0,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":15139,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.41702011219045015,"acs":3048,"articleLive":2,"columnArticles":25,"formTitle":"[479]最大回文数乘积","frequency":0.0,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","submitted":7309,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.44827115145259705,"acs":29533,"articleLive":2,"columnArticles":404,"formTitle":"[480]滑动窗口中位数","frequency":0.0,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":65882,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5392109578470146,"acs":5590,"articleLive":2,"columnArticles":95,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10367,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.5903857883501067,"acs":15487,"articleLive":2,"columnArticles":117,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":26232,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6344647519582245,"acs":1458,"articleLive":2,"columnArticles":34,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","submitted":2298,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6069659626738518,"acs":122544,"articleLive":2,"columnArticles":990,"formTitle":"[485]最大连续 1 的个数","frequency":0.0,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":201896,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.58642475500747,"acs":46317,"articleLive":2,"columnArticles":402,"formTitle":"[486]预测赢家","frequency":0.0,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":78982,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5786460425873845,"acs":5761,"articleLive":2,"columnArticles":110,"formTitle":"[487]最大连续1的个数 II","frequency":0.0,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","submitted":9956,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3879472693032015,"acs":3502,"articleLive":2,"columnArticles":73,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":9027,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7187639946260636,"acs":1605,"articleLive":2,"columnArticles":24,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","submitted":2233,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4828651483583591,"acs":6721,"articleLive":2,"columnArticles":79,"formTitle":"[490]迷宫","frequency":0.0,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","submitted":13919,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5467882907880133,"acs":47295,"articleLive":2,"columnArticles":397,"formTitle":"[491]递增子序列","frequency":0.0,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":86496,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5522202084277299,"acs":19500,"articleLive":2,"columnArticles":179,"formTitle":"[492]构造矩形","frequency":0.0,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":35312,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3455968688845401,"acs":26490,"articleLive":2,"columnArticles":267,"formTitle":"[493]翻转对","frequency":0.0,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":76650,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4936374114934958,"acs":149893,"articleLive":2,"columnArticles":1039,"formTitle":"[494]目标和","frequency":0.0,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":303650,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5424521102037702,"acs":28431,"articleLive":2,"columnArticles":433,"formTitle":"[495]提莫攻击","frequency":0.0,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":52412,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6876776964490956,"acs":102312,"articleLive":2,"columnArticles":1047,"formTitle":"[496]下一个更大元素 I","frequency":0.0,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":148779,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4049733570159858,"acs":2964,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7319,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.46774315005862926,"acs":43480,"articleLive":2,"columnArticles":453,"formTitle":"[498]对角线遍历","frequency":0.0,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":92957,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.37103174603174605,"acs":2618,"articleLive":2,"columnArticles":49,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","submitted":7056,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7090277777777778,"acs":30630,"articleLive":2,"columnArticles":472,"formTitle":"[500]键盘行","frequency":0.0,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":43200,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5126816132264529,"acs":65492,"articleLive":2,"columnArticles":538,"formTitle":"[501]二叉搜索树中的众数","frequency":0.0,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":127744,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4411285209673037,"acs":29223,"articleLive":2,"columnArticles":356,"formTitle":"[502]IPO","frequency":0.0,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":66246,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6354589175139987,"acs":102931,"articleLive":2,"columnArticles":968,"formTitle":"[503]下一个更大元素 II","frequency":0.0,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":161979,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5044850799084879,"acs":30651,"articleLive":2,"columnArticles":318,"formTitle":"[504]七进制数","frequency":0.0,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":60757,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.48287759855084966,"acs":5598,"articleLive":2,"columnArticles":66,"formTitle":"[505]迷宫 II","frequency":0.0,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","submitted":11593,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5638965471970592,"acs":21476,"articleLive":2,"columnArticles":284,"formTitle":"[506]相对名次","frequency":0.0,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":38085,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4126876908571509,"acs":29326,"articleLive":2,"columnArticles":230,"formTitle":"[507]完美数","frequency":0.0,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":71061,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6765318882867861,"acs":14607,"articleLive":2,"columnArticles":207,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.0,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":21591,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6749043034934437,"acs":242784,"articleLive":2,"columnArticles":1477,"formTitle":"[509]斐波那契数","frequency":0.0,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":359731,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.608411214953271,"acs":3255,"articleLive":2,"columnArticles":54,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","submitted":5350,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7334658613043811,"acs":19186,"articleLive":2,"columnArticles":106,"formTitle":"[511]游戏玩法分析 I","frequency":0.0,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","submitted":26158,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5380580556714549,"acs":18054,"articleLive":2,"columnArticles":148,"formTitle":"[512]游戏玩法分析 II","frequency":0.0,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","submitted":33554,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7309172685205207,"acs":50703,"articleLive":2,"columnArticles":566,"formTitle":"[513]找树左下角的值","frequency":0.0,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":69369,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5006772816725024,"acs":19590,"articleLive":2,"columnArticles":240,"formTitle":"[514]自由之路","frequency":0.0,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":39127,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6442506080684391,"acs":38407,"articleLive":2,"columnArticles":420,"formTitle":"[515]在每个树行中找最大值","frequency":0.0,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":59615,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6534696326450016,"acs":86043,"articleLive":2,"columnArticles":617,"formTitle":"[516]最长回文子序列","frequency":0.0,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":131671,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5109610333922925,"acs":19066,"articleLive":2,"columnArticles":165,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":37314,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6567358855115836,"acs":107750,"articleLive":2,"columnArticles":682,"formTitle":"[518]零钱兑换 II","frequency":0.0,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":164069,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.39793966151582044,"acs":2704,"articleLive":2,"columnArticles":39,"formTitle":"[519]随机翻转矩阵","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6795,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5638211038869656,"acs":40064,"articleLive":2,"columnArticles":643,"formTitle":"[520]检测大写字母","frequency":0.0,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":71058,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7131138330149455,"acs":25384,"articleLive":2,"columnArticles":252,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.0,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":35596,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3609561752988048,"acs":6795,"articleLive":2,"columnArticles":106,"formTitle":"[522]最长特殊序列 II","frequency":0.0,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":18825,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.274670691438177,"acs":68791,"articleLive":2,"columnArticles":605,"formTitle":"[523]连续的子数组和","frequency":0.0,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":250449,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.49489068115107127,"acs":72161,"articleLive":2,"columnArticles":755,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":0.0,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":145812,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5358495944132353,"acs":45118,"articleLive":2,"columnArticles":516,"formTitle":"[525]连续数组","frequency":0.0,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":84199,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7350236032002837,"acs":33165,"articleLive":2,"columnArticles":381,"formTitle":"[526]优美的排列","frequency":0.0,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":45121,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5781068524970964,"acs":1991,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","submitted":3444,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.4767656865716884,"acs":31457,"articleLive":2,"columnArticles":258,"formTitle":"[528]按权重随机选择","frequency":0.0,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":65980,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6450642380874939,"acs":39665,"articleLive":2,"columnArticles":462,"formTitle":"[529]扫雷游戏","frequency":0.0,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":61490,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6208902537476454,"acs":78447,"articleLive":2,"columnArticles":638,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.0,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":126346,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6593005046111015,"acs":3789,"articleLive":2,"columnArticles":77,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","submitted":5747,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37465199522736314,"acs":25434,"articleLive":2,"columnArticles":278,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":67887,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5247429305912596,"acs":1633,"articleLive":2,"columnArticles":34,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","submitted":3112,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6749929171782038,"acs":14295,"articleLive":2,"columnArticles":138,"formTitle":"[534]游戏玩法分析 III","frequency":0.0,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","submitted":21178,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8417900871517938,"acs":15744,"articleLive":2,"columnArticles":101,"formTitle":"[535]TinyURL 的加密与解密","frequency":0.0,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18703,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.537484565179044,"acs":3047,"articleLive":2,"columnArticles":50,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","submitted":5669,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7122117847993168,"acs":11676,"articleLive":2,"columnArticles":173,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16394,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7001798099152324,"acs":109032,"articleLive":2,"columnArticles":837,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":155720,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5974971268037288,"acs":14037,"articleLive":2,"columnArticles":184,"formTitle":"[539]最小时间差","frequency":0.0,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":23493,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.582086171224912,"acs":38544,"articleLive":2,"columnArticles":405,"formTitle":"[540]有序数组中的单一元素","frequency":0.0,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":66217,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6075564344488947,"acs":72507,"articleLive":2,"columnArticles":802,"formTitle":"[541]反转字符串 II","frequency":0.0,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":119342,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4582313250134352,"acs":69066,"articleLive":2,"columnArticles":644,"formTitle":"[542]01 矩阵","frequency":0.0,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":150723,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5519633556204055,"acs":149422,"articleLive":2,"columnArticles":1237,"formTitle":"[543]二叉树的直径","frequency":0.0,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":270710,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7104773713577185,"acs":2292,"articleLive":2,"columnArticles":53,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","submitted":3226,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.41839726362081603,"acs":3425,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","submitted":8186,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6286979776032091,"acs":15046,"articleLive":2,"columnArticles":120,"formTitle":"[546]移除盒子","frequency":0.0,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":23932,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6185520344779054,"acs":162613,"articleLive":2,"columnArticles":1140,"formTitle":"[547]省份数量","frequency":0.0,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":262893,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.35466017268098293,"acs":1602,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"lock","submitted":4517,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.4810981098109811,"acs":2138,"articleLive":2,"columnArticles":52,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","submitted":4444,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.43784928321010796,"acs":12614,"articleLive":2,"columnArticles":178,"formTitle":"[550]游戏玩法分析 IV","frequency":0.0,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","submitted":28809,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.567686812125893,"acs":58801,"articleLive":2,"columnArticles":755,"formTitle":"[551]学生出勤记录 I","frequency":0.0,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":103580,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5774977107330473,"acs":23965,"articleLive":2,"columnArticles":287,"formTitle":"[552]学生出勤记录 II","frequency":0.0,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":41498,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6045105074320861,"acs":5897,"articleLive":2,"columnArticles":86,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9755,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5029155797180875,"acs":45883,"articleLive":2,"columnArticles":488,"formTitle":"[554]砖墙","frequency":0.0,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":91234,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3427594779366066,"acs":1103,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","submitted":3218,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32602195644412707,"acs":14611,"articleLive":2,"columnArticles":214,"formTitle":"[556]下一个更大元素 III","frequency":0.0,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":44816,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7459590380268735,"acs":161386,"articleLive":2,"columnArticles":1317,"formTitle":"[557]反转字符串中的单词 III","frequency":0.0,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":216347,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.504251258025334,"acs":2906,"articleLive":2,"columnArticles":37,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5763,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7282852640626493,"acs":61007,"articleLive":2,"columnArticles":550,"formTitle":"[559]N 叉树的最大深度","frequency":0.0,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":83768,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.44662637871466393,"acs":150472,"articleLive":2,"columnArticles":926,"formTitle":"[560]和为 K 的子数组","frequency":0.0,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":336908,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7747039317858835,"acs":89947,"articleLive":2,"columnArticles":747,"formTitle":"[561]数组拆分 I","frequency":0.0,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":116105,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4656939587604003,"acs":3862,"articleLive":2,"columnArticles":59,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","submitted":8293,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6062012590435027,"acs":32259,"articleLive":2,"columnArticles":322,"formTitle":"[563]二叉树的坡度","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":53215,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17943018791675086,"acs":4440,"articleLive":2,"columnArticles":76,"formTitle":"[564]寻找最近的回文数","frequency":0.0,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":24745,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6105191081439637,"acs":14266,"articleLive":2,"columnArticles":139,"formTitle":"[565]数组嵌套","frequency":0.0,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":23367,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6902087480120428,"acs":69005,"articleLive":2,"columnArticles":642,"formTitle":"[566]重塑矩阵","frequency":0.0,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":99977,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4315921486277598,"acs":118384,"articleLive":2,"columnArticles":1078,"formTitle":"[567]字符串的排列","frequency":0.0,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":274296,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5070724389198457,"acs":1183,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","submitted":2333,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5642104050239096,"acs":9793,"articleLive":2,"columnArticles":154,"formTitle":"[569]员工薪水中位数","frequency":0.0,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","submitted":17357,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6612259702575263,"acs":12761,"articleLive":2,"columnArticles":112,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.0,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","submitted":19299,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4886248369801478,"acs":6744,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.0,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","submitted":13802,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47333325805140253,"acs":83833,"articleLive":2,"columnArticles":733,"formTitle":"[572]另一棵树的子树","frequency":0.0,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":177112,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6631989596879063,"acs":1020,"articleLive":2,"columnArticles":31,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","submitted":1538,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6480478621899015,"acs":12565,"articleLive":2,"columnArticles":113,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","submitted":19389,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6847102743061191,"acs":42185,"articleLive":2,"columnArticles":431,"formTitle":"[575]分糖果","frequency":0.0,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":61610,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.46860158311345645,"acs":25752,"articleLive":2,"columnArticles":279,"formTitle":"[576]出界的路径数","frequency":0.0,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":54955,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7037054453117653,"acs":14965,"articleLive":2,"columnArticles":84,"formTitle":"[577]员工奖金","frequency":0.0,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","submitted":21266,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4958177970371863,"acs":9840,"articleLive":2,"columnArticles":113,"formTitle":"[578]查询回答率最高的问题","frequency":0.0,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","submitted":19846,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.409775641025641,"acs":7671,"articleLive":2,"columnArticles":132,"formTitle":"[579]查询员工的累计薪水","frequency":0.0,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","submitted":18720,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5228596924045982,"acs":9961,"articleLive":2,"columnArticles":81,"formTitle":"[580]统计各专业学生人数","frequency":0.0,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","submitted":19051,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40492518065136845,"acs":98905,"articleLive":2,"columnArticles":856,"formTitle":"[581]最短无序连续子数组","frequency":0.0,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":244255,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.4076782449725777,"acs":8697,"articleLive":2,"columnArticles":134,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","submitted":21333,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6180068745457009,"acs":50163,"articleLive":2,"columnArticles":489,"formTitle":"[583]两个字符串的删除操作","frequency":0.0,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":81169,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7746303325590618,"acs":13673,"articleLive":2,"columnArticles":61,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","submitted":17651,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5959819832701795,"acs":8336,"articleLive":2,"columnArticles":99,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","submitted":13987,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7469891972915698,"acs":14452,"articleLive":2,"columnArticles":88,"formTitle":"[586]订单最多的客户","frequency":0.0,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","submitted":19347,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3842417701025364,"acs":2136,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5559,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.4258177570093458,"acs":1458,"articleLive":2,"columnArticles":29,"formTitle":"[588]设计内存文件系统","frequency":0.0,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","submitted":3424,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7451317731393633,"acs":88354,"articleLive":2,"columnArticles":563,"formTitle":"[589]N 叉树的前序遍历","frequency":0.0,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":118575,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7608616372079453,"acs":62590,"articleLive":2,"columnArticles":459,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":82262,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.34178674351585014,"acs":1779,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5205,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5220803560969896,"acs":4457,"articleLive":2,"columnArticles":110,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8537,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.4411764705882353,"acs":8310,"articleLive":2,"columnArticles":134,"formTitle":"[593]有效的正方形","frequency":0.0,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":18836,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5177322588661294,"acs":29168,"articleLive":2,"columnArticles":269,"formTitle":"[594]最长和谐子序列","frequency":0.0,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":56338,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7967176109526349,"acs":103061,"articleLive":2,"columnArticles":237,"formTitle":"[595]大的国家","frequency":0.0,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":129357,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.42108319722070986,"acs":81208,"articleLive":2,"columnArticles":284,"formTitle":"[596]超过5名学生的课","frequency":0.0,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":192855,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4416048957076366,"acs":10247,"articleLive":2,"columnArticles":80,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.0,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","submitted":23204,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5179454253611557,"acs":16134,"articleLive":2,"columnArticles":210,"formTitle":"[598]范围求和 II","frequency":0.0,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":31150,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5221062910254788,"acs":28873,"articleLive":2,"columnArticles":273,"formTitle":"[599]两个列表的最小索引总和","frequency":0.0,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":55301,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.4815611170837813,"acs":19261,"articleLive":2,"columnArticles":230,"formTitle":"[600]不含连续1的非负整数","frequency":0.0,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":39997,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.49979357215447157,"acs":31475,"articleLive":2,"columnArticles":374,"formTitle":"[601]体育馆的人流量","frequency":0.0,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":62976,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6288683963738668,"acs":8047,"articleLive":2,"columnArticles":88,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.0,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","submitted":12796,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6710722660413558,"acs":12592,"articleLive":2,"columnArticles":108,"formTitle":"[603]连续空余座位","frequency":0.0,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","submitted":18764,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37356057116536157,"acs":2433,"articleLive":2,"columnArticles":56,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","submitted":6513,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3335485983796969,"acs":108980,"articleLive":2,"columnArticles":1255,"formTitle":"[605]种花问题","frequency":0.0,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":326729,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.569391882421257,"acs":28436,"articleLive":2,"columnArticles":313,"formTitle":"[606]根据二叉树创建字符串","frequency":0.0,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":49941,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6612752379380535,"acs":12020,"articleLive":2,"columnArticles":84,"formTitle":"[607]销售员","frequency":0.0,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","submitted":18177,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.655687842183019,"acs":7545,"articleLive":2,"columnArticles":101,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","submitted":11507,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.48576779026217226,"acs":6485,"articleLive":2,"columnArticles":101,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13350,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6663469531299955,"acs":10421,"articleLive":2,"columnArticles":72,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","submitted":15639,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5319234557180527,"acs":50229,"articleLive":2,"columnArticles":390,"formTitle":"[611]有效三角形的个数","frequency":0.0,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":94429,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6677928956259702,"acs":7313,"articleLive":2,"columnArticles":63,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","submitted":10951,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8170705857415389,"acs":11564,"articleLive":2,"columnArticles":81,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","submitted":14153,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.34543969741253333,"acs":8037,"articleLive":2,"columnArticles":68,"formTitle":"[614]二级关注者","frequency":0.0,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","submitted":23266,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42555941513854106,"acs":5268,"articleLive":2,"columnArticles":91,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","submitted":12379,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.4615274599542334,"acs":3227,"articleLive":2,"columnArticles":55,"formTitle":"[616]给字符串添加加粗标签","frequency":0.0,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","submitted":6992,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7879472519365548,"acs":187979,"articleLive":2,"columnArticles":1244,"formTitle":"[617]合并二叉树","frequency":0.0,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":238568,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6181867242309768,"acs":4582,"articleLive":2,"columnArticles":45,"formTitle":"[618]学生地理信息报告","frequency":0.0,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","submitted":7412,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4660318774580832,"acs":11257,"articleLive":2,"columnArticles":79,"formTitle":"[619]只出现一次的最大数字","frequency":0.0,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","submitted":24155,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7735116300343454,"acs":93014,"articleLive":2,"columnArticles":309,"formTitle":"[620]有趣的电影","frequency":0.0,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":120249,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5707660698561785,"acs":77784,"articleLive":2,"columnArticles":498,"formTitle":"[621]任务调度器","frequency":0.0,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":136280,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4365057495984354,"acs":64949,"articleLive":2,"columnArticles":418,"formTitle":"[622]设计循环队列","frequency":0.0,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":148793,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5459254831639769,"acs":10960,"articleLive":2,"columnArticles":187,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":20076,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4184971098265896,"acs":2172,"articleLive":2,"columnArticles":49,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","submitted":5190,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3426191451590878,"acs":2509,"articleLive":2,"columnArticles":54,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","submitted":7323,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.684118039144398,"acs":45160,"articleLive":2,"columnArticles":350,"formTitle":"[626]换座位","frequency":0.0,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":66012,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.808169385682696,"acs":85156,"articleLive":2,"columnArticles":336,"formTitle":"[627]变更性别","frequency":0.0,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":105369,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5248042975727645,"acs":79913,"articleLive":2,"columnArticles":758,"formTitle":"[628]三个数的最大乘积","frequency":0.0,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":152272,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.4064598972738048,"acs":4115,"articleLive":2,"columnArticles":57,"formTitle":"[629]K个逆序对数组","frequency":0.0,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":10124,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.36765987105767556,"acs":6330,"articleLive":2,"columnArticles":75,"formTitle":"[630]课程表 III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":17217,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2880449317999465,"acs":1077,"articleLive":2,"columnArticles":35,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","submitted":3739,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5975749111223971,"acs":18826,"articleLive":2,"columnArticles":239,"formTitle":"[632]最小区间","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":31504,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.3981411567078706,"acs":93857,"articleLive":2,"columnArticles":764,"formTitle":"[633]平方数之和","frequency":0.0,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":235738,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.4406614785992218,"acs":1359,"articleLive":2,"columnArticles":21,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","submitted":3084,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5535862641927444,"acs":3998,"articleLive":2,"columnArticles":67,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","submitted":7222,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5506246820057663,"acs":9740,"articleLive":2,"columnArticles":112,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":17689,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6898261191268961,"acs":74584,"articleLive":2,"columnArticles":648,"formTitle":"[637]二叉树的层平均值","frequency":0.0,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":108120,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5935487222106794,"acs":11427,"articleLive":2,"columnArticles":119,"formTitle":"[638]大礼包","frequency":0.0,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":19252,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.3767944159093902,"acs":20027,"articleLive":2,"columnArticles":272,"formTitle":"[639]解码方法 II","frequency":0.0,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":53151,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4251264557110928,"acs":10842,"articleLive":2,"columnArticles":211,"formTitle":"[640]求解方程","frequency":0.0,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25503,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5325076627875103,"acs":21369,"articleLive":2,"columnArticles":240,"formTitle":"[641]设计循环双端队列","frequency":0.0,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":40129,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.48905402691303473,"acs":2435,"articleLive":2,"columnArticles":56,"formTitle":"[642]设计搜索自动补全系统","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","submitted":4979,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.45066230093763954,"acs":63588,"articleLive":2,"columnArticles":573,"formTitle":"[643]子数组最大平均数 I","frequency":0.0,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":141099,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.3992220650636492,"acs":1129,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","submitted":2828,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4342963653308481,"acs":68502,"articleLive":2,"columnArticles":695,"formTitle":"[645]错误的集合","frequency":0.0,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":157731,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5774097797219184,"acs":22176,"articleLive":2,"columnArticles":197,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":38406,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6566286500470117,"acs":123611,"articleLive":2,"columnArticles":913,"formTitle":"[647]回文子串","frequency":0.0,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":188251,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5846048298572997,"acs":21303,"articleLive":2,"columnArticles":278,"formTitle":"[648]单词替换","frequency":0.0,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":36440,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.481909148139558,"acs":29089,"articleLive":2,"columnArticles":309,"formTitle":"[649]Dota2 参议院","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":60362,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.56696655719506,"acs":49029,"articleLive":2,"columnArticles":651,"formTitle":"[650]只有两个键的键盘","frequency":0.0,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":86476,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5827629122588674,"acs":3746,"articleLive":2,"columnArticles":63,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","submitted":6428,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5713806556393101,"acs":32367,"articleLive":2,"columnArticles":234,"formTitle":"[652]寻找重复的子树","frequency":0.0,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":56647,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5972875041837047,"acs":41045,"articleLive":2,"columnArticles":388,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":68719,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8100569311650458,"acs":59476,"articleLive":2,"columnArticles":600,"formTitle":"[654]最大二叉树","frequency":0.0,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":73422,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5982363763243037,"acs":9430,"articleLive":2,"columnArticles":138,"formTitle":"[655]输出二叉树","frequency":0.0,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15763,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.30791788856304986,"acs":840,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","submitted":2728,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7834262704326118,"acs":81908,"articleLive":2,"columnArticles":623,"formTitle":"[657]机器人能否返回原点","frequency":0.0,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":104551,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45454545454545453,"acs":26675,"articleLive":2,"columnArticles":241,"formTitle":"[658]找到 K 个最接近的元素","frequency":0.0,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":58685,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5419892565617174,"acs":28352,"articleLive":2,"columnArticles":261,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":52311,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6540642722117203,"acs":692,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":0.0,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","submitted":1058,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5606946238020798,"acs":16499,"articleLive":2,"columnArticles":213,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":29426,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4084819194417833,"acs":28568,"articleLive":2,"columnArticles":270,"formTitle":"[662]二叉树最大宽度","frequency":0.0,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":69937,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.46368861024033436,"acs":1775,"articleLive":2,"columnArticles":35,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","submitted":3828,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6541536632486253,"acs":22009,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33645,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.27071731180070246,"acs":74764,"articleLive":2,"columnArticles":933,"formTitle":"[665]非递减数列","frequency":0.0,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":276170,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.617500731635938,"acs":2110,"articleLive":2,"columnArticles":76,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","submitted":3417,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.624022521113544,"acs":7980,"articleLive":2,"columnArticles":118,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12788,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5080874644301333,"acs":6785,"articleLive":2,"columnArticles":66,"formTitle":"[668]乘法表中第k小的数","frequency":0.0,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":13354,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6661134163208852,"acs":36120,"articleLive":2,"columnArticles":305,"formTitle":"[669]修剪二叉搜索树","frequency":0.0,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":54225,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.45106759438586425,"acs":18865,"articleLive":2,"columnArticles":282,"formTitle":"[670]最大交换","frequency":0.0,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":41823,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.4863048671517406,"acs":53335,"articleLive":2,"columnArticles":667,"formTitle":"[671]二叉树中第二小的节点","frequency":0.0,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":109674,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5483048304830483,"acs":3655,"articleLive":2,"columnArticles":42,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.0,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6666,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.4347012172630026,"acs":47139,"articleLive":2,"columnArticles":411,"formTitle":"[673]最长递增子序列的个数","frequency":0.0,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":108440,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4961754974001977,"acs":92372,"articleLive":2,"columnArticles":760,"formTitle":"[674]最长连续递增序列","frequency":0.0,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":186168,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.40063880016664355,"acs":2885,"articleLive":2,"columnArticles":48,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7201,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5867891730816985,"acs":7089,"articleLive":2,"columnArticles":129,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":12081,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6171618533139414,"acs":14852,"articleLive":2,"columnArticles":248,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":24065,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.3853566602659839,"acs":43348,"articleLive":2,"columnArticles":476,"formTitle":"[678]有效的括号字符串","frequency":0.0,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":112488,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5412010880937435,"acs":25864,"articleLive":2,"columnArticles":260,"formTitle":"[679]24 点游戏","frequency":0.0,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":47790,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4016602987794108,"acs":86414,"articleLive":2,"columnArticles":818,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":0.0,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":215142,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5028381287923273,"acs":2569,"articleLive":2,"columnArticles":62,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","submitted":5109,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6952740276073155,"acs":45886,"articleLive":2,"columnArticles":510,"formTitle":"[682]棒球比赛","frequency":0.0,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":65997,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.43383947939262474,"acs":2200,"articleLive":2,"columnArticles":50,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","submitted":5071,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6654090990028491,"acs":59791,"articleLive":2,"columnArticles":604,"formTitle":"[684]冗余连接","frequency":0.0,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":89856,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4311604352979205,"acs":20008,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":46405,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3558503724183465,"acs":17247,"articleLive":2,"columnArticles":194,"formTitle":"[686]重复叠加字符串匹配","frequency":0.0,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":48467,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4408976747954306,"acs":38094,"articleLive":2,"columnArticles":272,"formTitle":"[687]最长同值路径","frequency":0.0,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":86401,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5106410093029183,"acs":8014,"articleLive":2,"columnArticles":106,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.0,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15694,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.4847174593708066,"acs":3251,"articleLive":2,"columnArticles":69,"formTitle":"[689]三个无重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6707,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6476893095768375,"acs":55836,"articleLive":2,"columnArticles":565,"formTitle":"[690]员工的重要性","frequency":0.0,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":86208,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.49028791844606695,"acs":3559,"articleLive":2,"columnArticles":47,"formTitle":"[691]贴纸拼词","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7259,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.577914005959983,"acs":67876,"articleLive":2,"columnArticles":736,"formTitle":"[692]前K个高频单词","frequency":0.0,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":117450,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6095443667589507,"acs":25980,"articleLive":2,"columnArticles":283,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":42622,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5340924136104859,"acs":4034,"articleLive":2,"columnArticles":78,"formTitle":"[694]不同岛屿的数量","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","submitted":7553,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6647379502411753,"acs":129130,"articleLive":2,"columnArticles":1283,"formTitle":"[695]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":194257,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6317022257821792,"acs":52051,"articleLive":2,"columnArticles":474,"formTitle":"[696]计数二进制子串","frequency":0.0,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":82398,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6051606089300022,"acs":66466,"articleLive":2,"columnArticles":850,"formTitle":"[697]数组的度","frequency":0.0,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":109832,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.4464865840452412,"acs":29686,"articleLive":2,"columnArticles":217,"formTitle":"[698]划分为k个相等的子集","frequency":0.0,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":66488,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47710385346466216,"acs":2761,"articleLive":2,"columnArticles":41,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5787,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7599634215756716,"acs":81443,"articleLive":2,"columnArticles":515,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.0,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":107167,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7233139623795687,"acs":75676,"articleLive":2,"columnArticles":560,"formTitle":"[701]二叉搜索树中的插入操作","frequency":0.0,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":104624,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7403381642512077,"acs":4291,"articleLive":2,"columnArticles":76,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","submitted":5796,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5125992317541613,"acs":60051,"articleLive":2,"columnArticles":546,"formTitle":"[703]数据流中的第 K 大元素","frequency":0.0,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":117150,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.556528696518885,"acs":285881,"articleLive":2,"columnArticles":1418,"formTitle":"[704]二分查找","frequency":0.0,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":513686,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6454076706191341,"acs":66841,"articleLive":2,"columnArticles":433,"formTitle":"[705]设计哈希集合","frequency":0.0,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":103564,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6438915541671315,"acs":57712,"articleLive":2,"columnArticles":390,"formTitle":"[706]设计哈希映射","frequency":0.0,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":89630,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3207868500149524,"acs":63289,"articleLive":2,"columnArticles":437,"formTitle":"[707]设计链表","frequency":0.0,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":197293,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.3380024360535932,"acs":2220,"articleLive":2,"columnArticles":51,"formTitle":"[708]循环有序列表的插入","frequency":0.0,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","submitted":6568,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7588617502626895,"acs":70776,"articleLive":2,"columnArticles":509,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":93266,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3515274949083503,"acs":5178,"articleLive":2,"columnArticles":64,"formTitle":"[710]黑名单中的随机数","frequency":0.0,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":14730,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5576619273301737,"acs":706,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","submitted":1266,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6716883579960777,"acs":15070,"articleLive":2,"columnArticles":168,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.0,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":22436,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4128838924746436,"acs":23285,"articleLive":2,"columnArticles":214,"formTitle":"[713]乘积小于K的子数组","frequency":0.0,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":56396,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7212505433995073,"acs":99547,"articleLive":2,"columnArticles":665,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":0.0,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":138020,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.4068010075566751,"acs":2584,"articleLive":2,"columnArticles":43,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6352,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4622025198320112,"acs":3962,"articleLive":2,"columnArticles":72,"formTitle":"[716]最大栈","frequency":0.0,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","submitted":8572,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.511336032388664,"acs":31575,"articleLive":2,"columnArticles":381,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":61750,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5643200869816171,"acs":84082,"articleLive":2,"columnArticles":585,"formTitle":"[718]最长重复子数组","frequency":0.0,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":148997,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3700501253132832,"acs":8859,"articleLive":2,"columnArticles":85,"formTitle":"[719]找出第 k 小的距离对","frequency":0.0,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":23940,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4853441754916793,"acs":20532,"articleLive":2,"columnArticles":273,"formTitle":"[720]词典中最长的单词","frequency":0.0,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":42304,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4694528529114995,"acs":28846,"articleLive":2,"columnArticles":336,"formTitle":"[721]账户合并","frequency":0.0,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":61446,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3216261417728033,"acs":5000,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":0.0,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15546,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7209821428571429,"acs":1292,"articleLive":2,"columnArticles":41,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","submitted":1792,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.46188205062661025,"acs":137324,"articleLive":2,"columnArticles":858,"formTitle":"[724]寻找数组的中心下标","frequency":0.0,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":297314,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.60857932310616,"acs":48676,"articleLive":2,"columnArticles":624,"formTitle":"[725]分隔链表","frequency":0.0,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":79983,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5524319387004288,"acs":21773,"articleLive":2,"columnArticles":395,"formTitle":"[726]原子的数量","frequency":0.0,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39413,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4093550673281361,"acs":2888,"articleLive":2,"columnArticles":49,"formTitle":"[727]最小窗口子序列","frequency":0.0,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","submitted":7055,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7600699739840315,"acs":33890,"articleLive":2,"columnArticles":309,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":44588,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5120712359691478,"acs":8166,"articleLive":2,"columnArticles":92,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":15947,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4900438321853475,"acs":3913,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":0.0,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":7985,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5072261663286004,"acs":4001,"articleLive":2,"columnArticles":42,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":7888,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6106884057971015,"acs":3371,"articleLive":2,"columnArticles":53,"formTitle":"[732]我的日程安排表 III","frequency":0.0,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5520,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5805194345037735,"acs":65536,"articleLive":2,"columnArticles":557,"formTitle":"[733]图像渲染","frequency":0.0,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":112892,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4822778827977316,"acs":2041,"articleLive":2,"columnArticles":37,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","submitted":4232,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.40541439273908025,"acs":20726,"articleLive":2,"columnArticles":262,"formTitle":"[735]行星碰撞","frequency":0.0,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":51123,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.46245530393325385,"acs":1552,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3356,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.46081730769230766,"acs":3834,"articleLive":2,"columnArticles":65,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","submitted":8320,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5017158628775203,"acs":41082,"articleLive":2,"columnArticles":584,"formTitle":"[738]单调递增的数字","frequency":0.0,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":81883,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6796968616377054,"acs":211574,"articleLive":2,"columnArticles":1507,"formTitle":"[739]每日温度","frequency":0.0,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":311277,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6294994077675955,"acs":50489,"articleLive":2,"columnArticles":585,"formTitle":"[740]删除并获得点数","frequency":0.0,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":80205,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3671318975875774,"acs":3972,"articleLive":2,"columnArticles":46,"formTitle":"[741]摘樱桃","frequency":0.0,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10819,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.494641117245859,"acs":1523,"articleLive":2,"columnArticles":44,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","submitted":3079,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5198880781258572,"acs":56856,"articleLive":2,"columnArticles":518,"formTitle":"[743]网络延迟时间","frequency":0.0,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":109362,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4590298189324418,"acs":40917,"articleLive":2,"columnArticles":364,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.0,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":89138,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.391971502945609,"acs":2861,"articleLive":2,"columnArticles":55,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7299,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5871783505742838,"acs":133788,"articleLive":2,"columnArticles":1287,"formTitle":"[746]使用最小花费爬楼梯","frequency":0.0,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":227849,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.416173298453348,"acs":45340,"articleLive":2,"columnArticles":403,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":108945,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6015647638365691,"acs":12456,"articleLive":2,"columnArticles":175,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":20706,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5048872180451128,"acs":1343,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2660,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7219193020719739,"acs":1986,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.0,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","submitted":2751,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5027046520014424,"acs":1394,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","submitted":2773,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5301784731984598,"acs":69394,"articleLive":2,"columnArticles":587,"formTitle":"[752]打开转盘锁","frequency":0.0,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":130888,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5909846665435063,"acs":3199,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.0,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5413,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4307667421546425,"acs":7989,"articleLive":2,"columnArticles":95,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18546,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.49903660886319845,"acs":1295,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","submitted":2595,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5655676747645018,"acs":4563,"articleLive":2,"columnArticles":68,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8068,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4174153420870767,"acs":2416,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5788,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4608672659968271,"acs":3486,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","submitted":7564,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6588235294117647,"acs":1848,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","submitted":2805,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8391638225255973,"acs":3934,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","submitted":4688,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5904090267983074,"acs":2093,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3545,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.6999093738918003,"acs":17763,"articleLive":2,"columnArticles":140,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":25379,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7630771540359733,"acs":81328,"articleLive":2,"columnArticles":974,"formTitle":"[763]划分字母区间","frequency":0.0,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":106579,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4934834123222749,"acs":4165,"articleLive":2,"columnArticles":53,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8440,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6648422113314707,"acs":29031,"articleLive":2,"columnArticles":440,"formTitle":"[765]情侣牵手","frequency":0.0,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":43666,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7080430407183774,"acs":54879,"articleLive":2,"columnArticles":633,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":77508,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.4777249031517528,"acs":39955,"articleLive":2,"columnArticles":496,"formTitle":"[767]重构字符串","frequency":0.0,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":83636,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5056480949645797,"acs":5282,"articleLive":2,"columnArticles":80,"formTitle":"[768]最多能完成排序的块 II","frequency":0.0,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10446,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5871068586585828,"acs":12395,"articleLive":2,"columnArticles":145,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":21112,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.554520037278658,"acs":1190,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2146,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.851399624389075,"acs":152776,"articleLive":2,"columnArticles":1112,"formTitle":"[771]宝石与石头","frequency":0.0,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":179441,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4929554786249094,"acs":6123,"articleLive":2,"columnArticles":125,"formTitle":"[772]基本计算器 III","frequency":0.0,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","submitted":12421,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7136153114744042,"acs":23266,"articleLive":2,"columnArticles":330,"formTitle":"[773]滑动谜题","frequency":0.0,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":32603,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5889008620689655,"acs":1093,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","submitted":1856,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.46027846027846026,"acs":5058,"articleLive":2,"columnArticles":80,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":10989,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5683939491470872,"acs":1766,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","submitted":3107,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3235020901068277,"acs":5572,"articleLive":2,"columnArticles":61,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.0,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17224,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5942377863369147,"acs":23451,"articleLive":2,"columnArticles":347,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":39464,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4363984497554674,"acs":18917,"articleLive":2,"columnArticles":234,"formTitle":"[779]第K个语法符号","frequency":0.0,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43348,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2870386720819354,"acs":3251,"articleLive":2,"columnArticles":50,"formTitle":"[780]到达终点","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11326,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6174161721598628,"acs":43179,"articleLive":2,"columnArticles":658,"formTitle":"[781]森林中的兔子","frequency":0.0,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":69935,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42791630839782174,"acs":1493,"articleLive":2,"columnArticles":30,"formTitle":"[782]变为棋盘","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3489,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5958774373259053,"acs":69524,"articleLive":2,"columnArticles":669,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.0,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":116675,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6866239235652775,"acs":43694,"articleLive":2,"columnArticles":480,"formTitle":"[784]字母大小写全排列","frequency":0.0,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":63636,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5120910202833554,"acs":40193,"articleLive":2,"columnArticles":403,"formTitle":"[785]判断二分图","frequency":0.0,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":78488,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.4707134057565237,"acs":4203,"articleLive":2,"columnArticles":58,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":8929,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3909372126076415,"acs":42084,"articleLive":2,"columnArticles":396,"formTitle":"[787]K 站中转内最便宜的航班","frequency":0.0,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":107649,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6078515393236206,"acs":18441,"articleLive":2,"columnArticles":191,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30338,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6921242630986288,"acs":20898,"articleLive":2,"columnArticles":294,"formTitle":"[789]逃脱阻碍者","frequency":0.0,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30194,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.44997094712376523,"acs":3872,"articleLive":2,"columnArticles":66,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8605,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6952818627450981,"acs":11347,"articleLive":2,"columnArticles":201,"formTitle":"[791]自定义字符串排序","frequency":0.0,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16320,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.46414260762354875,"acs":9035,"articleLive":2,"columnArticles":98,"formTitle":"[792]匹配子序列的单词数","frequency":0.0,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":19466,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3944396177237185,"acs":4994,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":12661,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3408021614571202,"acs":7316,"articleLive":2,"columnArticles":102,"formTitle":"[794]有效的井字游戏","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21467,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5338880687156087,"acs":7956,"articleLive":2,"columnArticles":87,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":14902,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5298050642632874,"acs":23455,"articleLive":2,"columnArticles":276,"formTitle":"[796]旋转字符串","frequency":0.0,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":44271,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7936516739689055,"acs":42931,"articleLive":2,"columnArticles":534,"formTitle":"[797]所有可能的路径","frequency":0.0,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":54093,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4627820815089256,"acs":1374,"articleLive":2,"columnArticles":34,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2969,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4091191066997519,"acs":5276,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":0.0,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":12896,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7063453025086079,"acs":1436,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","submitted":2033,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.41916966253044186,"acs":7229,"articleLive":2,"columnArticles":87,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17246,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5765739059547189,"acs":31120,"articleLive":2,"columnArticles":333,"formTitle":"[802]找到最终的安全状态","frequency":0.0,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":53974,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48180850644487366,"acs":12223,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25369,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7712269652437602,"acs":39675,"articleLive":2,"columnArticles":398,"formTitle":"[804]唯一摩尔斯密码词","frequency":0.0,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":51444,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2909976746761156,"acs":2628,"articleLive":2,"columnArticles":41,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9031,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6572663849857522,"acs":13378,"articleLive":2,"columnArticles":151,"formTitle":"[806]写字符串需要的行数","frequency":0.0,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":20354,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8448381810733306,"acs":16498,"articleLive":2,"columnArticles":216,"formTitle":"[807]保持城市天际线","frequency":0.0,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":19528,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.48089591567852435,"acs":4380,"articleLive":2,"columnArticles":41,"formTitle":"[808]分汤","frequency":0.0,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9108,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4182899500086192,"acs":4853,"articleLive":2,"columnArticles":90,"formTitle":"[809]情感丰富的文字","frequency":0.0,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11602,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7337047846466791,"acs":16592,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":0.0,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22614,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7046162176797076,"acs":15615,"articleLive":2,"columnArticles":199,"formTitle":"[811]子域名访问计数","frequency":0.0,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22161,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6303558885506907,"acs":10769,"articleLive":2,"columnArticles":100,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":17084,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5500913641058235,"acs":6924,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":12587,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.7000583842915528,"acs":22782,"articleLive":2,"columnArticles":351,"formTitle":"[814]二叉树剪枝","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":32543,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4337019724090754,"acs":26628,"articleLive":2,"columnArticles":315,"formTitle":"[815]公交路线","frequency":0.0,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":61397,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5102626668580451,"acs":3555,"articleLive":2,"columnArticles":65,"formTitle":"[816]模糊坐标","frequency":0.0,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":6967,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5910844218462348,"acs":13485,"articleLive":2,"columnArticles":166,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22814,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.4326991676575505,"acs":3639,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8410,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.4212590060072241,"acs":21809,"articleLive":2,"columnArticles":248,"formTitle":"[819]最常见的单词","frequency":0.0,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":51771,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5073553871742746,"acs":54906,"articleLive":2,"columnArticles":602,"formTitle":"[820]单词的压缩编码","frequency":0.0,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":108220,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.693138182425288,"acs":24910,"articleLive":2,"columnArticles":337,"formTitle":"[821]字符的最短距离","frequency":0.0,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":35938,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5036212683271507,"acs":2851,"articleLive":2,"columnArticles":39,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5661,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.42945874001774625,"acs":2904,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":0.0,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6762,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6151587447238025,"acs":16760,"articleLive":2,"columnArticles":239,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":27245,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.39106311895955137,"acs":6555,"articleLive":2,"columnArticles":90,"formTitle":"[825]适龄的朋友","frequency":0.0,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":16762,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.37402825991297123,"acs":7650,"articleLive":2,"columnArticles":112,"formTitle":"[826]安排工作以达到最大收益","frequency":0.0,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":20453,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.39071927768372616,"acs":9001,"articleLive":2,"columnArticles":182,"formTitle":"[827]最大人工岛","frequency":0.0,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":23037,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.49204387455584736,"acs":3185,"articleLive":2,"columnArticles":53,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6473,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3653210075481299,"acs":8615,"articleLive":2,"columnArticles":100,"formTitle":"[829]连续整数求和","frequency":0.0,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":23582,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5432768314260886,"acs":51890,"articleLive":2,"columnArticles":582,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":95513,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.405277732529728,"acs":7464,"articleLive":2,"columnArticles":73,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18417,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.795788456355881,"acs":85634,"articleLive":2,"columnArticles":916,"formTitle":"[832]翻转图像","frequency":0.0,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":107609,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4297111185757474,"acs":5117,"articleLive":2,"columnArticles":77,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":11908,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5283846245012445,"acs":13375,"articleLive":2,"columnArticles":132,"formTitle":"[834]树中距离之和","frequency":0.0,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25313,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5736849150046848,"acs":4286,"articleLive":2,"columnArticles":49,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7471,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.47907124681933844,"acs":37655,"articleLive":2,"columnArticles":657,"formTitle":"[836]矩形重叠","frequency":0.0,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":78600,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39624070926923155,"acs":19352,"articleLive":2,"columnArticles":244,"formTitle":"[837]新21点","frequency":0.0,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":48839,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5006689669741567,"acs":7110,"articleLive":2,"columnArticles":123,"formTitle":"[838]推多米诺","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":14201,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5746396653928324,"acs":19097,"articleLive":2,"columnArticles":268,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33233,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3595119023804761,"acs":8986,"articleLive":2,"columnArticles":113,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":24995,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6577392627462169,"acs":55331,"articleLive":2,"columnArticles":541,"formTitle":"[841]钥匙和房间","frequency":0.0,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":84123,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.4882218124795368,"acs":28332,"articleLive":2,"columnArticles":321,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":0.0,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":58031,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.38028747433264887,"acs":2778,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7305,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5133312955262445,"acs":89006,"articleLive":2,"columnArticles":981,"formTitle":"[844]比较含退格的字符串","frequency":0.0,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":173389,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4212300387466685,"acs":37615,"articleLive":2,"columnArticles":554,"formTitle":"[845]数组中的最长山脉","frequency":0.0,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":89298,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5108066611550727,"acs":8650,"articleLive":2,"columnArticles":120,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":16934,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6818414135514018,"acs":18677,"articleLive":2,"columnArticles":158,"formTitle":"[847]访问所有节点的最短路径","frequency":0.0,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27392,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4488766849725412,"acs":8991,"articleLive":2,"columnArticles":96,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":20030,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42650918635170604,"acs":15925,"articleLive":2,"columnArticles":185,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":37338,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4489644970414201,"acs":2428,"articleLive":2,"columnArticles":42,"formTitle":"[850]矩形面积 II","frequency":0.0,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5408,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4803877366997295,"acs":4262,"articleLive":2,"columnArticles":71,"formTitle":"[851]喧闹和富有","frequency":0.0,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":8872,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7147395333429598,"acs":84147,"articleLive":2,"columnArticles":725,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":117731,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38343963467562364,"acs":10160,"articleLive":2,"columnArticles":123,"formTitle":"[853]车队","frequency":0.0,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":26497,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.35983125155099677,"acs":4350,"articleLive":2,"columnArticles":67,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12089,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4075030115298572,"acs":4736,"articleLive":2,"columnArticles":56,"formTitle":"[855]考场就座","frequency":0.0,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":11622,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6269099026286418,"acs":16289,"articleLive":2,"columnArticles":218,"formTitle":"[856]括号的分数","frequency":0.0,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":25983,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.4670909655386526,"acs":3009,"articleLive":2,"columnArticles":47,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.0,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6442,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5547162502421074,"acs":2864,"articleLive":2,"columnArticles":49,"formTitle":"[858]镜面反射","frequency":0.0,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5163,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3021614755789085,"acs":27833,"articleLive":2,"columnArticles":363,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":92113,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5875754166419939,"acs":89305,"articleLive":2,"columnArticles":768,"formTitle":"[860]柠檬水找零","frequency":0.0,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":151989,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8085051612737149,"acs":31408,"articleLive":2,"columnArticles":439,"formTitle":"[861]翻转矩阵后的得分","frequency":0.0,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":38847,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.1916707228758325,"acs":16145,"articleLive":2,"columnArticles":128,"formTitle":"[862]和至少为 K 的最短子数组","frequency":0.0,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":84233,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6041020872081009,"acs":35079,"articleLive":2,"columnArticles":561,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":0.0,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":58068,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.4554515252189671,"acs":3016,"articleLive":2,"columnArticles":44,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6622,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6571868357399399,"acs":8966,"articleLive":2,"columnArticles":128,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13643,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22453085122354,"acs":7478,"articleLive":2,"columnArticles":84,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":33305,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6702871560735312,"acs":83682,"articleLive":2,"columnArticles":752,"formTitle":"[867]转置矩阵","frequency":0.0,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":124845,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6242531024973188,"acs":16298,"articleLive":2,"columnArticles":235,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":26108,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5515671962215544,"acs":6423,"articleLive":2,"columnArticles":95,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.0,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11645,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.42879494683162866,"acs":14799,"articleLive":2,"columnArticles":189,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":34513,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.341706900932951,"acs":9413,"articleLive":2,"columnArticles":125,"formTitle":"[871]最低加油次数","frequency":0.0,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":27547,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6519838056680162,"acs":60390,"articleLive":2,"columnArticles":721,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":92625,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.510644049469487,"acs":15112,"articleLive":2,"columnArticles":112,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":0.0,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":29594,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4147966623460791,"acs":20481,"articleLive":2,"columnArticles":227,"formTitle":"[874]模拟行走机器人","frequency":0.0,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":49376,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.47895428780792687,"acs":44446,"articleLive":2,"columnArticles":351,"formTitle":"[875]爱吃香蕉的珂珂","frequency":0.0,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":92798,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7060577644411102,"acs":150588,"articleLive":2,"columnArticles":1628,"formTitle":"[876]链表的中间结点","frequency":0.0,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":213280,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.757262520049902,"acs":67984,"articleLive":2,"columnArticles":482,"formTitle":"[877]石子游戏","frequency":0.0,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":89776,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2806916426512968,"acs":4383,"articleLive":2,"columnArticles":62,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15615,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5544411126046944,"acs":21448,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":0.0,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":38684,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.25267974410032623,"acs":5964,"articleLive":2,"columnArticles":77,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23603,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5378211090823486,"acs":46834,"articleLive":2,"columnArticles":572,"formTitle":"[881]救生艇","frequency":0.0,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":87081,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.48683845940703796,"acs":1757,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3609,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6888321633694958,"acs":10794,"articleLive":2,"columnArticles":109,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15670,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6616449095061181,"acs":19412,"articleLive":2,"columnArticles":251,"formTitle":"[884]两句话中的不常见单词","frequency":0.0,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":29339,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6913968824940048,"acs":4613,"articleLive":2,"columnArticles":71,"formTitle":"[885]螺旋矩阵 III","frequency":0.0,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6672,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4237821633774669,"acs":8482,"articleLive":2,"columnArticles":114,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":20015,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.29140782619598543,"acs":51131,"articleLive":2,"columnArticles":336,"formTitle":"[887]鸡蛋掉落","frequency":0.0,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":175462,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6404426843929001,"acs":54339,"articleLive":2,"columnArticles":456,"formTitle":"[888]公平的糖果棒交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":84846,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6760625412904646,"acs":15350,"articleLive":2,"columnArticles":147,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":0.0,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":22705,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7262809917355372,"acs":8788,"articleLive":2,"columnArticles":121,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12100,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.33019416346936403,"acs":2840,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8601,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6386398110635356,"acs":33261,"articleLive":2,"columnArticles":681,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":52081,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7246611369613595,"acs":10746,"articleLive":2,"columnArticles":104,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14829,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7746044913195473,"acs":13073,"articleLive":2,"columnArticles":122,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":16877,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.54513835214098,"acs":7053,"articleLive":2,"columnArticles":82,"formTitle":"[895]最大频率栈","frequency":0.0,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":12938,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5865824782951855,"acs":59456,"articleLive":2,"columnArticles":716,"formTitle":"[896]单调数列","frequency":0.0,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":101360,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.744436838755389,"acs":61990,"articleLive":2,"columnArticles":706,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":83271,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3376900842025889,"acs":5374,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":0.0,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15914,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5373939861218195,"acs":4182,"articleLive":2,"columnArticles":46,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7782,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4929390997352162,"acs":3351,"articleLive":2,"columnArticles":46,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6798,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5451550443603156,"acs":18864,"articleLive":2,"columnArticles":231,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":34603,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.329727047146402,"acs":3322,"articleLive":2,"columnArticles":77,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10075,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5301379811183733,"acs":2920,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.0,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5508,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4534896831660841,"acs":20110,"articleLive":2,"columnArticles":275,"formTitle":"[904]水果成篮","frequency":0.0,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":44345,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7005782304696005,"acs":57914,"articleLive":2,"columnArticles":600,"formTitle":"[905]按奇偶排序数组","frequency":0.0,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":82666,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2766281579281452,"acs":2179,"articleLive":2,"columnArticles":38,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7877,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.31693834959670597,"acs":11238,"articleLive":2,"columnArticles":128,"formTitle":"[907]子数组的最小值之和","frequency":0.0,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":35458,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6984543893322558,"acs":20742,"articleLive":2,"columnArticles":190,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":29697,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.45931089198685254,"acs":16210,"articleLive":2,"columnArticles":192,"formTitle":"[909]蛇梯棋","frequency":0.0,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35292,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3191848140296782,"acs":6625,"articleLive":2,"columnArticles":69,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20756,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4247762330984574,"acs":4461,"articleLive":2,"columnArticles":68,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":10502,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5608103279605531,"acs":227583,"articleLive":2,"columnArticles":1050,"formTitle":"[912]排序数组","frequency":0.0,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":405811,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.4041095890410959,"acs":1888,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4672,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.38881344356292535,"acs":48959,"articleLive":2,"columnArticles":615,"formTitle":"[914]卡牌分组","frequency":0.0,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":125919,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46876408997545216,"acs":9357,"articleLive":2,"columnArticles":114,"formTitle":"[915]分割数组","frequency":0.0,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":19961,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44115197779319915,"acs":6357,"articleLive":2,"columnArticles":75,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14410,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5698807601781789,"acs":29297,"articleLive":2,"columnArticles":435,"formTitle":"[917]仅仅反转字母","frequency":0.0,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":51409,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.35741458259950687,"acs":20294,"articleLive":2,"columnArticles":222,"formTitle":"[918]环形子数组的最大和","frequency":0.0,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":56780,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6309765112674377,"acs":5292,"articleLive":2,"columnArticles":96,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8387,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.4832074980473835,"acs":1856,"articleLive":2,"columnArticles":20,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3841,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7371432608081379,"acs":20870,"articleLive":2,"columnArticles":307,"formTitle":"[921]使括号有效的最少添加","frequency":0.0,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":28312,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7140176661869817,"acs":89807,"articleLive":2,"columnArticles":825,"formTitle":"[922]按奇偶排序数组 II","frequency":0.0,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":125777,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.33864823683064865,"acs":6223,"articleLive":2,"columnArticles":82,"formTitle":"[923]三数之和的多种可能","frequency":0.0,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18376,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35898026126489035,"acs":6238,"articleLive":2,"columnArticles":94,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":17377,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3874713910316182,"acs":50281,"articleLive":2,"columnArticles":673,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":129767,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5214991058238084,"acs":6707,"articleLive":2,"columnArticles":122,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.0,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":12861,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3394477317554241,"acs":3442,"articleLive":2,"columnArticles":69,"formTitle":"[927]三等分","frequency":0.0,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10140,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.42015209125475284,"acs":2210,"articleLive":2,"columnArticles":42,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5260,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6440933789494868,"acs":25604,"articleLive":2,"columnArticles":231,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":39752,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5449899734782327,"acs":33700,"articleLive":2,"columnArticles":340,"formTitle":"[930]和相同的二元子数组","frequency":0.0,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":61836,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6634540750323416,"acs":20514,"articleLive":2,"columnArticles":260,"formTitle":"[931]下降路径最小和","frequency":0.0,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":30920,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.632335418528448,"acs":8491,"articleLive":2,"columnArticles":81,"formTitle":"[932]漂亮数组","frequency":0.0,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13428,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7247914014990807,"acs":35875,"articleLive":2,"columnArticles":310,"formTitle":"[933]最近的请求次数","frequency":0.0,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":49497,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4747501421954985,"acs":23371,"articleLive":2,"columnArticles":264,"formTitle":"[934]最短的桥","frequency":0.0,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":49228,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4751601312294954,"acs":6083,"articleLive":2,"columnArticles":80,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12802,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.381139489194499,"acs":1552,"articleLive":2,"columnArticles":25,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4072,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.587344643913987,"acs":11909,"articleLive":2,"columnArticles":127,"formTitle":"[937]重新排列日志文件","frequency":0.0,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":20276,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8185812666356838,"acs":96875,"articleLive":2,"columnArticles":800,"formTitle":"[938]二叉搜索树的范围和","frequency":0.0,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":118345,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.45296138058138563,"acs":5407,"articleLive":2,"columnArticles":63,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":11937,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.42072758037225044,"acs":4973,"articleLive":2,"columnArticles":65,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":11820,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.39239552394764005,"acs":61962,"articleLive":2,"columnArticles":614,"formTitle":"[941]有效的山脉数组","frequency":0.0,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":157907,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7302394918494993,"acs":22533,"articleLive":2,"columnArticles":212,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":30857,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.46994674106010653,"acs":1853,"articleLive":2,"columnArticles":42,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":3943,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6895149484368392,"acs":21195,"articleLive":2,"columnArticles":181,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30739,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4860897506316599,"acs":35399,"articleLive":2,"columnArticles":537,"formTitle":"[945]使数组唯一的最小增量","frequency":0.0,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":72824,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6241164145426078,"acs":27106,"articleLive":2,"columnArticles":299,"formTitle":"[946]验证栈序列","frequency":0.0,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":43431,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6123643227937706,"acs":25952,"articleLive":2,"columnArticles":334,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":42380,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3917537679736675,"acs":6784,"articleLive":2,"columnArticles":97,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17317,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.370641794359316,"acs":8345,"articleLive":2,"columnArticles":119,"formTitle":"[949]给定数字能组成的最大时间","frequency":0.0,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":22515,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.774390243902439,"acs":9779,"articleLive":2,"columnArticles":145,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.0,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12628,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.664043256233103,"acs":11053,"articleLive":2,"columnArticles":167,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":16645,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3508873012214796,"acs":3045,"articleLive":2,"columnArticles":57,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8678,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5529124855075361,"acs":13830,"articleLive":2,"columnArticles":168,"formTitle":"[953]验证外星语词典","frequency":0.0,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":25013,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.3004704875962361,"acs":7025,"articleLive":2,"columnArticles":105,"formTitle":"[954]二倍数对数组","frequency":0.0,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":23380,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3282875090104006,"acs":3188,"articleLive":2,"columnArticles":49,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9711,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.43726194362825116,"acs":4018,"articleLive":2,"columnArticles":51,"formTitle":"[956]最高的广告牌","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9189,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.3602834348635078,"acs":14135,"articleLive":2,"columnArticles":140,"formTitle":"[957]N 天后的牢房","frequency":0.0,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":39233,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5357197324560448,"acs":24589,"articleLive":2,"columnArticles":227,"formTitle":"[958]二叉树的完全性检验","frequency":0.0,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":45899,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7433903576982893,"acs":19598,"articleLive":2,"columnArticles":304,"formTitle":"[959]由斜杠划分区域","frequency":0.0,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26363,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5541830432341381,"acs":1974,"articleLive":2,"columnArticles":33,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3562,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.676412390198798,"acs":36577,"articleLive":2,"columnArticles":302,"formTitle":"[961]重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":54075,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.44256868586560744,"acs":13370,"articleLive":2,"columnArticles":129,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":30210,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5028936340051886,"acs":2520,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5011,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4304399524375743,"acs":1448,"articleLive":2,"columnArticles":27,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3364,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6833941605839416,"acs":32956,"articleLive":2,"columnArticles":391,"formTitle":"[965]单值二叉树","frequency":0.0,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":48224,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.40345100105374077,"acs":3063,"articleLive":2,"columnArticles":50,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7592,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.46315216734175685,"acs":7661,"articleLive":2,"columnArticles":152,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16541,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4986362907107332,"acs":24864,"articleLive":2,"columnArticles":326,"formTitle":"[968]监控二叉树","frequency":0.0,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":49864,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6526360908701243,"acs":15226,"articleLive":2,"columnArticles":195,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":23330,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41437234002485784,"acs":11002,"articleLive":2,"columnArticles":127,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26551,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.43980582524271844,"acs":6795,"articleLive":2,"columnArticles":107,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15450,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.41063420884048685,"acs":1282,"articleLive":2,"columnArticles":28,"formTitle":"[972]相等的有理数","frequency":0.0,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3122,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6407656157841664,"acs":67356,"articleLive":2,"columnArticles":635,"formTitle":"[973]最接近原点的 K 个点","frequency":0.0,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":105118,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4660088677949166,"acs":37311,"articleLive":2,"columnArticles":385,"formTitle":"[974]和可被 K 整除的子数组","frequency":0.0,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":80065,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4466637718917354,"acs":3086,"articleLive":2,"columnArticles":47,"formTitle":"[975]奇偶跳","frequency":0.0,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6909,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5972618941354995,"acs":53529,"articleLive":2,"columnArticles":500,"formTitle":"[976]三角形的最大周长","frequency":0.0,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":89624,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.710666342656991,"acs":169619,"articleLive":2,"columnArticles":1329,"formTitle":"[977]有序数组的平方","frequency":0.0,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":238676,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4735773918576459,"acs":43168,"articleLive":2,"columnArticles":600,"formTitle":"[978]最长湍流子数组","frequency":0.0,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":91153,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7117124735729387,"acs":8416,"articleLive":2,"columnArticles":133,"formTitle":"[979]在二叉树中分配硬币","frequency":0.0,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11825,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7343589215888042,"acs":14273,"articleLive":2,"columnArticles":212,"formTitle":"[980]不同路径 III","frequency":0.0,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":19436,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5323315802654646,"acs":21256,"articleLive":2,"columnArticles":314,"formTitle":"[981]基于时间的键值存储","frequency":0.0,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":39930,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5446716899892358,"acs":2530,"articleLive":2,"columnArticles":29,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4645,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6342926599749059,"acs":32354,"articleLive":2,"columnArticles":453,"formTitle":"[983]最低票价","frequency":0.0,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":51008,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4169866308923532,"acs":9014,"articleLive":2,"columnArticles":142,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":21617,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6003031087125272,"acs":16240,"articleLive":2,"columnArticles":187,"formTitle":"[985]查询后的偶数和","frequency":0.0,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27053,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6775232065246553,"acs":25254,"articleLive":2,"columnArticles":242,"formTitle":"[986]区间列表的交集","frequency":0.0,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":37274,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5327197656448227,"acs":23095,"articleLive":2,"columnArticles":410,"formTitle":"[987]二叉树的垂序遍历","frequency":0.0,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":43353,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.49841814574508014,"acs":9295,"articleLive":2,"columnArticles":112,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":18649,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.47127324312919183,"acs":52489,"articleLive":2,"columnArticles":594,"formTitle":"[989]数组形式的整数加法","frequency":0.0,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":111377,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5025142322153935,"acs":33278,"articleLive":2,"columnArticles":500,"formTitle":"[990]等式方程的可满足性","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":66223,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5192158732050289,"acs":8714,"articleLive":2,"columnArticles":110,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16783,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45260067918881064,"acs":23590,"articleLive":2,"columnArticles":273,"formTitle":"[992]K 个不同整数的子数组","frequency":0.0,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":52121,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5568893127678933,"acs":50800,"articleLive":2,"columnArticles":804,"formTitle":"[993]二叉树的堂兄弟节点","frequency":0.0,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":91221,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5089744906054864,"acs":54530,"articleLive":2,"columnArticles":1397,"formTitle":"[994]腐烂的橘子","frequency":0.0,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":107137,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5397617068440012,"acs":21428,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.0,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39699,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49534000690369345,"acs":4305,"articleLive":2,"columnArticles":86,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8691,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.510495643317868,"acs":36090,"articleLive":2,"columnArticles":390,"formTitle":"[997]找到小镇的法官","frequency":0.0,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":70696,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6147336181188039,"acs":7627,"articleLive":2,"columnArticles":110,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12407,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6905453884928023,"acs":30413,"articleLive":2,"columnArticles":571,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44042,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4092963950388316,"acs":3531,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":0.0,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8627,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2935267857142857,"acs":2104,"articleLive":2,"columnArticles":54,"formTitle":"[1001]网格照明","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7168,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7358993261682122,"acs":56899,"articleLive":2,"columnArticles":598,"formTitle":"[1002]查找共用字符","frequency":0.0,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":77319,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5762945368171022,"acs":12131,"articleLive":2,"columnArticles":186,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21050,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5971054384017758,"acs":67249,"articleLive":2,"columnArticles":709,"formTitle":"[1004]最大连续1的个数 III","frequency":0.0,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":112625,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5316822800392247,"acs":25483,"articleLive":2,"columnArticles":417,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.0,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":47929,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.62742818251425,"acs":44250,"articleLive":2,"columnArticles":603,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70526,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.4649064418312255,"acs":6286,"articleLive":2,"columnArticles":85,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13521,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7231086599587421,"acs":17176,"articleLive":2,"columnArticles":220,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":0.0,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":23753,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5928067044308217,"acs":15279,"articleLive":2,"columnArticles":211,"formTitle":"[1009]十进制整数的反码","frequency":0.0,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":25774,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45188767244341893,"acs":18409,"articleLive":2,"columnArticles":246,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40738,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6267052673234332,"acs":60180,"articleLive":2,"columnArticles":575,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":0.0,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":96026,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.33322436526097854,"acs":3058,"articleLive":2,"columnArticles":64,"formTitle":"[1012]至少有 1 位重复的数字","frequency":0.0,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9177,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.397154592031164,"acs":46898,"articleLive":2,"columnArticles":918,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":0.0,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":118085,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5499775235277911,"acs":37927,"articleLive":2,"columnArticles":449,"formTitle":"[1014]最佳观光组合","frequency":0.0,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":68961,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35558323563892147,"acs":4853,"articleLive":2,"columnArticles":42,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13648,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.583822202166065,"acs":5175,"articleLive":2,"columnArticles":80,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8864,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.560971737059384,"acs":3533,"articleLive":2,"columnArticles":57,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6298,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5161657933692051,"acs":43935,"articleLive":2,"columnArticles":377,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":85118,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5974241794765268,"acs":20132,"articleLive":2,"columnArticles":262,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.0,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":33698,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5374898597751767,"acs":9276,"articleLive":2,"columnArticles":137,"formTitle":"[1020]飞地的数量","frequency":0.0,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":17258,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7832365619178417,"acs":57600,"articleLive":2,"columnArticles":654,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":73541,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.704096954096954,"acs":19695,"articleLive":2,"columnArticles":264,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.0,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":27972,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5640841128967778,"acs":7055,"articleLive":2,"columnArticles":154,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12507,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5572826905379402,"acs":33306,"articleLive":2,"columnArticles":383,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":59765,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7095213393067673,"acs":75227,"articleLive":2,"columnArticles":649,"formTitle":"[1025]除数博弈","frequency":0.0,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":106025,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6704799296012997,"acs":9905,"articleLive":2,"columnArticles":168,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14773,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4340373733385972,"acs":13193,"articleLive":2,"columnArticles":121,"formTitle":"[1027]最长等差数列","frequency":0.0,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":30396,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7317126034028104,"acs":20256,"articleLive":2,"columnArticles":424,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.0,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27683,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6552884991779535,"acs":16740,"articleLive":2,"columnArticles":182,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":25546,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7106442035732481,"acs":40452,"articleLive":2,"columnArticles":444,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":56923,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5674785268855159,"acs":4823,"articleLive":2,"columnArticles":73,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8499,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.3974177294914187,"acs":2524,"articleLive":2,"columnArticles":41,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6351,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.3906093906093906,"acs":10948,"articleLive":2,"columnArticles":165,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28028,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.43253737138419723,"acs":4456,"articleLive":2,"columnArticles":96,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10302,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6324163728455605,"acs":35335,"articleLive":2,"columnArticles":383,"formTitle":"[1035]不相交的线","frequency":0.0,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":55873,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.3001294857565668,"acs":3245,"articleLive":2,"columnArticles":54,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10812,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.4384358258162004,"acs":9575,"articleLive":2,"columnArticles":112,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":21839,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7936447891053527,"acs":25176,"articleLive":2,"columnArticles":317,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":31722,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5556657575006199,"acs":4482,"articleLive":2,"columnArticles":59,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8066,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5226867446007529,"acs":2638,"articleLive":2,"columnArticles":30,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5047,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.4819889814945614,"acs":6824,"articleLive":2,"columnArticles":115,"formTitle":"[1041]困于环中的机器人","frequency":0.0,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":14158,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5298839907192575,"acs":11419,"articleLive":2,"columnArticles":151,"formTitle":"[1042]不邻接植花","frequency":0.0,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":21550,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6909960303139661,"acs":7659,"articleLive":2,"columnArticles":100,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11084,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.2088661237424918,"acs":5668,"articleLive":2,"columnArticles":71,"formTitle":"[1044]最长重复子串","frequency":0.0,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":27137,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6411944869831546,"acs":8374,"articleLive":2,"columnArticles":105,"formTitle":"[1045]买下所有产品的客户","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","submitted":13060,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6596966588216362,"acs":65591,"articleLive":2,"columnArticles":912,"formTitle":"[1046]最后一块石头的重量","frequency":0.0,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":99426,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7249670823595916,"acs":105163,"articleLive":2,"columnArticles":978,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":0.0,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":145059,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4548236734309525,"acs":9660,"articleLive":2,"columnArticles":131,"formTitle":"[1048]最长字符串链","frequency":0.0,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":21239,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6443798009181401,"acs":42531,"articleLive":2,"columnArticles":401,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.0,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":66003,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7570552973664714,"acs":11240,"articleLive":2,"columnArticles":53,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.0,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","submitted":14847,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7533532222464769,"acs":31060,"articleLive":2,"columnArticles":368,"formTitle":"[1051]高度检查器","frequency":0.0,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":41229,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5811280957172124,"acs":47939,"articleLive":2,"columnArticles":748,"formTitle":"[1052]爱生气的书店老板","frequency":0.0,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":82493,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4586268287019119,"acs":5925,"articleLive":2,"columnArticles":95,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":12919,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37618866489159375,"acs":7912,"articleLive":2,"columnArticles":108,"formTitle":"[1054]距离相等的条形码","frequency":0.0,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":21032,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5868020304568528,"acs":4624,"articleLive":2,"columnArticles":85,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","submitted":7880,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4096429438911829,"acs":3373,"articleLive":2,"columnArticles":65,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","submitted":8234,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4644607843137255,"acs":3032,"articleLive":2,"columnArticles":38,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","submitted":6528,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.34070455129853433,"acs":1325,"articleLive":2,"columnArticles":31,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","submitted":3889,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.3616028323141294,"acs":2247,"articleLive":2,"columnArticles":37,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","submitted":6214,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5300248138957816,"acs":4272,"articleLive":2,"columnArticles":63,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","submitted":8060,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6048759059960466,"acs":2754,"articleLive":2,"columnArticles":59,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","submitted":4553,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.541956934768841,"acs":3423,"articleLive":2,"columnArticles":45,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","submitted":6316,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7043010752688172,"acs":1834,"articleLive":2,"columnArticles":39,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","submitted":2604,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6506139154160983,"acs":4769,"articleLive":2,"columnArticles":68,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","submitted":7330,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5409395973154363,"acs":2418,"articleLive":2,"columnArticles":69,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","submitted":4470,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.4736230536834766,"acs":2038,"articleLive":2,"columnArticles":42,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","submitted":4303,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.42153846153846153,"acs":822,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","submitted":1950,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8643595863166269,"acs":13038,"articleLive":2,"columnArticles":63,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","submitted":15084,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8191892896987728,"acs":11014,"articleLive":2,"columnArticles":55,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","submitted":13445,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48235733399713737,"acs":7751,"articleLive":2,"columnArticles":71,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","submitted":16069,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5867444740368793,"acs":34588,"articleLive":2,"columnArticles":672,"formTitle":"[1071]字符串的最大公因子","frequency":0.0,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":58949,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.580003520506953,"acs":3295,"articleLive":2,"columnArticles":53,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5681,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.3364656381486676,"acs":2399,"articleLive":2,"columnArticles":53,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7130,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6690273843248348,"acs":18421,"articleLive":2,"columnArticles":185,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27534,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6930605636912208,"acs":9418,"articleLive":2,"columnArticles":71,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","submitted":13589,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4957394711067581,"acs":10123,"articleLive":2,"columnArticles":87,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","submitted":20420,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.720801859384079,"acs":7443,"articleLive":2,"columnArticles":87,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","submitted":10326,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6224430157802455,"acs":11715,"articleLive":2,"columnArticles":182,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":18821,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7343709299296692,"acs":11277,"articleLive":2,"columnArticles":188,"formTitle":"[1079]活字印刷","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15356,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.49030373831775703,"acs":4197,"articleLive":2,"columnArticles":89,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8560,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5705078125,"acs":14605,"articleLive":2,"columnArticles":143,"formTitle":"[1081]不同字符的最小子序列","frequency":0.0,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":25600,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7609500100921752,"acs":11310,"articleLive":2,"columnArticles":92,"formTitle":"[1082]销售分析 I ","frequency":0.0,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","submitted":14863,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5283153029610442,"acs":10402,"articleLive":2,"columnArticles":95,"formTitle":"[1083]销售分析 II","frequency":0.0,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","submitted":19689,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5373102755301709,"acs":10160,"articleLive":2,"columnArticles":94,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","submitted":18909,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.773350471293916,"acs":3610,"articleLive":2,"columnArticles":73,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","submitted":4668,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6897163120567376,"acs":5057,"articleLive":2,"columnArticles":80,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","submitted":7332,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5331174565793347,"acs":1811,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","submitted":3397,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.44935064935064933,"acs":1038,"articleLive":2,"columnArticles":34,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","submitted":2310,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5852234721799939,"acs":19248,"articleLive":2,"columnArticles":285,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":32890,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5446055199330917,"acs":3907,"articleLive":2,"columnArticles":79,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7174,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3784189345883637,"acs":27740,"articleLive":2,"columnArticles":285,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":0.0,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":73305,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.49053420805998127,"acs":2617,"articleLive":2,"columnArticles":50,"formTitle":"[1092]最短公共超序列","frequency":0.0,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5335,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3795379537953795,"acs":3680,"articleLive":2,"columnArticles":59,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9696,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6092790798512061,"acs":26698,"articleLive":2,"columnArticles":377,"formTitle":"[1094]拼车","frequency":0.0,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":43819,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.37282011296426604,"acs":19604,"articleLive":2,"columnArticles":384,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":52583,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5488204456094364,"acs":1675,"articleLive":2,"columnArticles":47,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3052,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5194794147669275,"acs":6107,"articleLive":2,"columnArticles":108,"formTitle":"[1097]游戏玩法分析 V","frequency":0.0,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","submitted":11756,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.47156011232286293,"acs":7221,"articleLive":2,"columnArticles":101,"formTitle":"[1098]小众书籍","frequency":0.0,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","submitted":15313,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.58051306756594,"acs":4820,"articleLive":2,"columnArticles":91,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","submitted":8303,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6992171405026782,"acs":5091,"articleLive":2,"columnArticles":99,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","submitted":7281,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6663881927039822,"acs":2393,"articleLive":2,"columnArticles":54,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","submitted":3591,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.36913037310256774,"acs":5204,"articleLive":2,"columnArticles":66,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","submitted":14098,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6367093603128475,"acs":35494,"articleLive":2,"columnArticles":1100,"formTitle":"[1103]分糖果 II","frequency":0.0,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":55746,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7610299012168171,"acs":28582,"articleLive":2,"columnArticles":671,"formTitle":"[1104]二叉树寻路","frequency":0.0,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37557,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.559018351612553,"acs":5148,"articleLive":2,"columnArticles":66,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9209,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.576027397260274,"acs":4205,"articleLive":2,"columnArticles":124,"formTitle":"[1106]解析布尔表达式","frequency":0.0,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7300,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4103158686387566,"acs":6547,"articleLive":2,"columnArticles":92,"formTitle":"[1107]每日新用户统计","frequency":0.0,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","submitted":15956,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8395554217472025,"acs":66926,"articleLive":2,"columnArticles":681,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":79716,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5766298490047366,"acs":58314,"articleLive":2,"columnArticles":581,"formTitle":"[1109]航班预订统计","frequency":0.0,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":101129,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6294705915588451,"acs":11141,"articleLive":2,"columnArticles":202,"formTitle":"[1110]删点成林","frequency":0.0,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":17699,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7712531184033775,"acs":24114,"articleLive":2,"columnArticles":399,"formTitle":"[1111]有效括号的嵌套深度","frequency":0.0,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31266,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6441476153780289,"acs":7523,"articleLive":2,"columnArticles":85,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","submitted":11679,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5401506143479984,"acs":6814,"articleLive":2,"columnArticles":48,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","submitted":12615,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6534947967865496,"acs":77115,"articleLive":2,"columnArticles":576,"formTitle":"[1114]按序打印","frequency":0.0,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":118004,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5620689655172414,"acs":42869,"articleLive":2,"columnArticles":478,"formTitle":"[1115]交替打印FooBar","frequency":0.0,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":76270,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5191868906865795,"acs":22527,"articleLive":2,"columnArticles":365,"formTitle":"[1116]打印零与奇偶数","frequency":0.0,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":43389,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.521611655180752,"acs":17257,"articleLive":2,"columnArticles":251,"formTitle":"[1117]H2O 生成","frequency":0.0,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":33084,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6422068965517241,"acs":2328,"articleLive":2,"columnArticles":37,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","submitted":3625,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8664651308245596,"acs":8312,"articleLive":2,"columnArticles":144,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","submitted":9593,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6097732055178864,"acs":2608,"articleLive":2,"columnArticles":48,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","submitted":4277,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5751186083289405,"acs":1091,"articleLive":2,"columnArticles":18,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","submitted":1897,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7069709182006317,"acs":64907,"articleLive":2,"columnArticles":870,"formTitle":"[1122]数组的相对排序","frequency":0.0,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":91810,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7048936356473781,"acs":8052,"articleLive":2,"columnArticles":103,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11423,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3180205835331735,"acs":12731,"articleLive":2,"columnArticles":130,"formTitle":"[1124]表现良好的最长时间段","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":40032,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.49146757679180886,"acs":3024,"articleLive":2,"columnArticles":50,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6153,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6929288268543085,"acs":6007,"articleLive":2,"columnArticles":92,"formTitle":"[1126]查询活跃业务","frequency":0.0,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","submitted":8669,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4131265930331351,"acs":3890,"articleLive":2,"columnArticles":71,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","submitted":9416,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5447426800064642,"acs":37079,"articleLive":2,"columnArticles":480,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.0,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":68067,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.380202889640332,"acs":6184,"articleLive":2,"columnArticles":111,"formTitle":"[1129]颜色交替的最短路径","frequency":0.0,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16265,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6283204798628963,"acs":5866,"articleLive":2,"columnArticles":100,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9336,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.454761551032536,"acs":3061,"articleLive":2,"columnArticles":46,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6731,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3881534852546917,"acs":4633,"articleLive":2,"columnArticles":53,"formTitle":"[1132]报告的记录 II","frequency":0.0,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","submitted":11936,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6460923623445826,"acs":2910,"articleLive":2,"columnArticles":63,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","submitted":4504,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7758917589175892,"acs":3154,"articleLive":2,"columnArticles":53,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","submitted":4065,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.535956115539556,"acs":6253,"articleLive":2,"columnArticles":72,"formTitle":"[1135]最低成本联通所有城市","frequency":0.0,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","submitted":11667,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5703287557220141,"acs":2741,"articleLive":2,"columnArticles":49,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","submitted":4806,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.608049560036302,"acs":77049,"articleLive":2,"columnArticles":854,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.0,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":126715,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43242477876106195,"acs":6108,"articleLive":2,"columnArticles":139,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14125,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.47786977409792497,"acs":9350,"articleLive":2,"columnArticles":154,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.0,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":19566,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6525958272683163,"acs":6725,"articleLive":2,"columnArticles":94,"formTitle":"[1140]石子游戏 II","frequency":0.0,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10305,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5101503176816984,"acs":9876,"articleLive":2,"columnArticles":64,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.0,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","submitted":19359,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.37053064315464923,"acs":6850,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","submitted":18487,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.63651962289645,"acs":165821,"articleLive":2,"columnArticles":1123,"formTitle":"[1143]最长公共子序列","frequency":0.0,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":260512,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4418884636883519,"acs":10277,"articleLive":2,"columnArticles":146,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.0,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23257,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.46897238827213206,"acs":6590,"articleLive":2,"columnArticles":106,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14052,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2866516301004716,"acs":4194,"articleLive":2,"columnArticles":62,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":14631,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5597179983411668,"acs":4049,"articleLive":2,"columnArticles":80,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7234,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7150687476774433,"acs":7697,"articleLive":2,"columnArticles":35,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","submitted":10764,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.44243906553091,"acs":5246,"articleLive":2,"columnArticles":46,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","submitted":11857,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6046147829487681,"acs":4638,"articleLive":2,"columnArticles":83,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.0,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","submitted":7671,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.48508506175716615,"acs":4163,"articleLive":2,"columnArticles":61,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.0,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","submitted":8582,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3856858846918489,"acs":1358,"articleLive":2,"columnArticles":32,"formTitle":"[1152]用户网站访问行为分析","frequency":0.0,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","submitted":3521,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3700787401574803,"acs":1692,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","submitted":4572,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5692338308457712,"acs":14302,"articleLive":2,"columnArticles":222,"formTitle":"[1154]一年中的第几天","frequency":0.0,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":25125,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4797031428998356,"acs":9631,"articleLive":2,"columnArticles":125,"formTitle":"[1155]掷骰子的N种方法","frequency":0.0,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":20077,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.43188786684187475,"acs":4930,"articleLive":2,"columnArticles":81,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11415,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.3173420113373924,"acs":3023,"articleLive":2,"columnArticles":45,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9526,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5505514705882353,"acs":5391,"articleLive":2,"columnArticles":61,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","submitted":9792,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.487434554973822,"acs":3724,"articleLive":2,"columnArticles":83,"formTitle":"[1159]市场分析 II","frequency":0.0,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","submitted":7640,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6870139788927976,"acs":59369,"articleLive":2,"columnArticles":911,"formTitle":"[1160]拼写单词","frequency":0.0,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":86416,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6331822302810517,"acs":10476,"articleLive":2,"columnArticles":175,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16545,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4690924710069338,"acs":38224,"articleLive":2,"columnArticles":493,"formTitle":"[1162]地图分析","frequency":0.0,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":81485,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.26759730811204074,"acs":5885,"articleLive":2,"columnArticles":99,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":21992,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.60931744312026,"acs":5624,"articleLive":2,"columnArticles":85,"formTitle":"[1164]指定日期的产品价格","frequency":0.0,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","submitted":9230,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.837410071942446,"acs":7566,"articleLive":2,"columnArticles":113,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","submitted":9035,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.48550199347589706,"acs":2679,"articleLive":2,"columnArticles":48,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","submitted":5518,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.4333145751266179,"acs":2310,"articleLive":2,"columnArticles":35,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","submitted":5331,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5707581227436823,"acs":1581,"articleLive":2,"columnArticles":27,"formTitle":"[1168]水资源分配优化","frequency":0.0,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","submitted":2770,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.322445842739805,"acs":6713,"articleLive":2,"columnArticles":80,"formTitle":"[1169]查询无效交易","frequency":0.0,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20819,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6170481737324485,"acs":13667,"articleLive":2,"columnArticles":216,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.0,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22149,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.474529550132314,"acs":12911,"articleLive":2,"columnArticles":153,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.0,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":27208,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2680121527777778,"acs":2470,"articleLive":2,"columnArticles":53,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9216,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.757685009487666,"acs":7986,"articleLive":2,"columnArticles":73,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","submitted":10540,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6198400412796697,"acs":4805,"articleLive":2,"columnArticles":61,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","submitted":7752,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.49071186440677966,"acs":7238,"articleLive":2,"columnArticles":113,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14750,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4491419003767267,"acs":4292,"articleLive":2,"columnArticles":61,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","submitted":9556,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.2649665009725524,"acs":6130,"articleLive":2,"columnArticles":95,"formTitle":"[1177]构建回文串检测","frequency":0.0,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23135,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4620361844561133,"acs":18566,"articleLive":2,"columnArticles":183,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40183,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6360342624976439,"acs":30370,"articleLive":2,"columnArticles":183,"formTitle":"[1179]重新格式化部门表","frequency":0.0,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":47749,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7759006211180124,"acs":3123,"articleLive":2,"columnArticles":69,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","submitted":4025,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3719298245614035,"acs":1484,"articleLive":2,"columnArticles":28,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","submitted":3990,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.39666136724960255,"acs":1996,"articleLive":2,"columnArticles":41,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","submitted":5032,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5985130111524164,"acs":644,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","submitted":1076,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5856866367555204,"acs":13315,"articleLive":2,"columnArticles":259,"formTitle":"[1184]公交站间的距离","frequency":0.0,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22734,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6082759368729324,"acs":11216,"articleLive":2,"columnArticles":202,"formTitle":"[1185]一周中的第几天","frequency":0.0,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":18439,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39413164155432195,"acs":7455,"articleLive":2,"columnArticles":107,"formTitle":"[1186]删除一次得到子数组最大和","frequency":0.0,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":18915,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.44271705333652234,"acs":1851,"articleLive":2,"columnArticles":32,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4181,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6943138093202224,"acs":3248,"articleLive":2,"columnArticles":64,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","submitted":4678,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6450923286652621,"acs":20821,"articleLive":2,"columnArticles":325,"formTitle":"[1189]“气球” 的最大数量","frequency":0.0,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":32276,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6508811371382986,"acs":44875,"articleLive":2,"columnArticles":615,"formTitle":"[1190]反转每对括号间的子串","frequency":0.0,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":68945,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2671701148398052,"acs":5979,"articleLive":2,"columnArticles":95,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22379,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.4995257291913683,"acs":4213,"articleLive":2,"columnArticles":49,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8434,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6043387292148442,"acs":5488,"articleLive":2,"columnArticles":72,"formTitle":"[1193]每月交易 I","frequency":0.0,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","submitted":9081,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5107321376065863,"acs":3474,"articleLive":2,"columnArticles":62,"formTitle":"[1194]锦标赛优胜者","frequency":0.0,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","submitted":6802,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.636393033676722,"acs":13776,"articleLive":2,"columnArticles":262,"formTitle":"[1195]交替打印字符串","frequency":0.0,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":21647,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6930653266331658,"acs":3448,"articleLive":2,"columnArticles":59,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","submitted":4975,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.3706013706013706,"acs":4813,"articleLive":2,"columnArticles":60,"formTitle":"[1197]进击的骑士","frequency":0.0,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","submitted":12987,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7472972972972973,"acs":3871,"articleLive":2,"columnArticles":57,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","submitted":5180,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.4369047619047619,"acs":734,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","submitted":1680,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6869353717859624,"acs":17793,"articleLive":2,"columnArticles":250,"formTitle":"[1200]最小绝对差","frequency":0.0,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":25902,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24716412985191602,"acs":5992,"articleLive":2,"columnArticles":85,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24243,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.503238889201825,"acs":26802,"articleLive":2,"columnArticles":293,"formTitle":"[1202]交换字符串中的元素","frequency":0.0,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53259,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6215172271720657,"acs":12068,"articleLive":2,"columnArticles":143,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19417,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7272014632871701,"acs":5566,"articleLive":2,"columnArticles":81,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","submitted":7654,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4596609567764267,"acs":5179,"articleLive":2,"columnArticles":82,"formTitle":"[1205]每月交易II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","submitted":11267,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6161848646658074,"acs":6693,"articleLive":2,"columnArticles":87,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":10862,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7303553324294282,"acs":59792,"articleLive":2,"columnArticles":830,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":81867,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4967580312407899,"acs":47194,"articleLive":2,"columnArticles":609,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":95004,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5306275339326635,"acs":12041,"articleLive":2,"columnArticles":159,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.0,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":22692,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4490591625699271,"acs":2649,"articleLive":2,"columnArticles":54,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5899,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6552377515113237,"acs":7262,"articleLive":2,"columnArticles":61,"formTitle":"[1211]查询结果的质量和占比","frequency":0.0,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","submitted":11083,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5099065804332205,"acs":4967,"articleLive":2,"columnArticles":96,"formTitle":"[1212]查询球队积分","frequency":0.0,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","submitted":9741,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7743083003952569,"acs":5877,"articleLive":2,"columnArticles":124,"formTitle":"[1213]三个有序数组的交集","frequency":0.0,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","submitted":7590,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6353141559424679,"acs":3357,"articleLive":2,"columnArticles":71,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.0,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","submitted":5284,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.41201264488935724,"acs":1955,"articleLive":2,"columnArticles":40,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","submitted":4745,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5376940133037694,"acs":1455,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","submitted":2706,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6946335538722153,"acs":21733,"articleLive":2,"columnArticles":350,"formTitle":"[1217]玩筹码","frequency":0.0,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":31287,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.42229367631296894,"acs":8274,"articleLive":2,"columnArticles":113,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":19593,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.631327452215921,"acs":12023,"articleLive":2,"columnArticles":171,"formTitle":"[1219]黄金矿工","frequency":0.0,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":19044,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5258644160087123,"acs":3863,"articleLive":2,"columnArticles":72,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7346,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8439328738785579,"acs":76289,"articleLive":2,"columnArticles":1108,"formTitle":"[1221]分割平衡字符串","frequency":0.0,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":90397,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6727649292371418,"acs":5847,"articleLive":2,"columnArticles":131,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8691,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4748414376321353,"acs":3369,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7095,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3263231197771588,"acs":4686,"articleLive":2,"columnArticles":69,"formTitle":"[1224]最大相等频率","frequency":0.0,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14360,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5395189003436426,"acs":3297,"articleLive":2,"columnArticles":79,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.0,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","submitted":6111,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5977058166683585,"acs":11776,"articleLive":2,"columnArticles":136,"formTitle":"[1226]哲学家进餐","frequency":0.0,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":19702,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6625779074393316,"acs":9993,"articleLive":2,"columnArticles":157,"formTitle":"[1227]飞机座位分配概率","frequency":0.0,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15082,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5398633257403189,"acs":3081,"articleLive":2,"columnArticles":52,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","submitted":5707,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.41739130434782606,"acs":2400,"articleLive":2,"columnArticles":43,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","submitted":5750,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.491845632165348,"acs":3046,"articleLive":2,"columnArticles":60,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","submitted":6193,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5615689232509901,"acs":2978,"articleLive":2,"columnArticles":42,"formTitle":"[1231]分享巧克力","frequency":0.0,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","submitted":5303,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.46951999555036433,"acs":33766,"articleLive":2,"columnArticles":419,"formTitle":"[1232]缀点成线","frequency":0.0,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":71916,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48098651439679263,"acs":7918,"articleLive":2,"columnArticles":114,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":16462,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.34255954122534965,"acs":5854,"articleLive":2,"columnArticles":90,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.0,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":17089,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4621619630093582,"acs":6272,"articleLive":2,"columnArticles":110,"formTitle":"[1235]规划兼职工作","frequency":0.0,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":13571,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5620229007633588,"acs":1178,"articleLive":2,"columnArticles":32,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","submitted":2096,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.71053923287287,"acs":10133,"articleLive":2,"columnArticles":131,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14261,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6586456558773425,"acs":3093,"articleLive":2,"columnArticles":72,"formTitle":"[1238]循环码排列","frequency":0.0,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4696,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4910178793708272,"acs":34713,"articleLive":2,"columnArticles":385,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":70696,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.49375487900078063,"acs":2530,"articleLive":2,"columnArticles":39,"formTitle":"[1240]铺瓷砖","frequency":0.0,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5124,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5952741020793951,"acs":6298,"articleLive":2,"columnArticles":64,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","submitted":10580,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.471172203130966,"acs":1234,"articleLive":2,"columnArticles":20,"formTitle":"[1242]多线程网页爬虫","frequency":0.0,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","submitted":2619,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5408462505236699,"acs":2582,"articleLive":2,"columnArticles":55,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","submitted":4774,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6198979591836735,"acs":2430,"articleLive":2,"columnArticles":41,"formTitle":"[1244]力扣排行榜","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","submitted":3920,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5103986135181976,"acs":3534,"articleLive":2,"columnArticles":63,"formTitle":"[1245]树的直径","frequency":0.0,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","submitted":6924,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4807219031993437,"acs":2930,"articleLive":2,"columnArticles":42,"formTitle":"[1246]删除回文子数组","frequency":0.0,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","submitted":6095,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6168418042747873,"acs":8629,"articleLive":2,"columnArticles":156,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":13989,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5594788671303956,"acs":34827,"articleLive":2,"columnArticles":477,"formTitle":"[1248]统计「优美子数组」","frequency":0.0,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":62249,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5742292611670639,"acs":22407,"articleLive":2,"columnArticles":318,"formTitle":"[1249]移除无效的括号","frequency":0.0,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":39021,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5617322506766604,"acs":2698,"articleLive":2,"columnArticles":38,"formTitle":"[1250]检查「好数组」","frequency":0.0,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4803,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7722416472416472,"acs":7951,"articleLive":2,"columnArticles":95,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","submitted":10296,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7484323740708443,"acs":18023,"articleLive":2,"columnArticles":311,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24081,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3933645707376058,"acs":5205,"articleLive":2,"columnArticles":79,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13232,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5988254270234501,"acs":14479,"articleLive":2,"columnArticles":228,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.0,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":24179,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6802471961547265,"acs":2972,"articleLive":2,"columnArticles":65,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4369,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6660854402789886,"acs":1528,"articleLive":2,"columnArticles":36,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","submitted":2294,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5626930203829524,"acs":1822,"articleLive":2,"columnArticles":40,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","submitted":3238,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5614678899082569,"acs":1224,"articleLive":2,"columnArticles":44,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","submitted":2180,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4785888077858881,"acs":1967,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","submitted":4110,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6033984623671711,"acs":12322,"articleLive":2,"columnArticles":250,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":20421,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.727785083599474,"acs":7748,"articleLive":2,"columnArticles":97,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10646,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5258809234507897,"acs":12984,"articleLive":2,"columnArticles":198,"formTitle":"[1262]可被三整除的最大和","frequency":0.0,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":24690,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.41896107418961076,"acs":3089,"articleLive":2,"columnArticles":58,"formTitle":"[1263]推箱子","frequency":0.0,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7373,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5702097404905795,"acs":4812,"articleLive":2,"columnArticles":83,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","submitted":8439,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9215619694397283,"acs":2714,"articleLive":2,"columnArticles":66,"formTitle":"[1265]逆序打印不可变链表","frequency":0.0,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","submitted":2945,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8239286995391959,"acs":29860,"articleLive":2,"columnArticles":455,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36241,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6071591278880573,"acs":9329,"articleLive":2,"columnArticles":145,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15365,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5843687964120285,"acs":7948,"articleLive":2,"columnArticles":145,"formTitle":"[1268]搜索推荐系统","frequency":0.0,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":13601,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4914553562709547,"acs":30196,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61442,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8034211240836274,"acs":5918,"articleLive":2,"columnArticles":82,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","submitted":7366,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5070480928689884,"acs":2446,"articleLive":2,"columnArticles":40,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","submitted":4824,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.518913676042677,"acs":1605,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","submitted":3093,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5448539638386648,"acs":1567,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","submitted":2876,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6001239925604464,"acs":968,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","submitted":1613,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5412563215331382,"acs":8134,"articleLive":2,"columnArticles":168,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.0,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15028,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5016166281755197,"acs":6516,"articleLive":2,"columnArticles":97,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":12990,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7248788306682441,"acs":18994,"articleLive":2,"columnArticles":234,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":0.0,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":26203,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5980326775591864,"acs":3587,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":0.0,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":5998,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6198738170347003,"acs":1572,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","submitted":2536,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5062019633209041,"acs":6652,"articleLive":2,"columnArticles":69,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","submitted":13141,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8319258155323729,"acs":45216,"articleLive":2,"columnArticles":614,"formTitle":"[1281]整数的各位积和之差","frequency":0.0,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":54351,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8104330708661417,"acs":12351,"articleLive":2,"columnArticles":228,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":15240,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.4181172077335421,"acs":6942,"articleLive":2,"columnArticles":100,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.0,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16603,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6602711690969557,"acs":2581,"articleLive":2,"columnArticles":59,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.0,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3909,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8128622172368667,"acs":4348,"articleLive":2,"columnArticles":59,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","submitted":5349,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6453630677182486,"acs":4746,"articleLive":2,"columnArticles":92,"formTitle":"[1286]字母组合迭代器","frequency":0.0,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7354,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6035157779343826,"acs":15415,"articleLive":2,"columnArticles":216,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.0,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":25542,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5632924547911037,"acs":13550,"articleLive":2,"columnArticles":169,"formTitle":"[1288]删除被覆盖区间","frequency":0.0,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":24055,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.624963602834126,"acs":6439,"articleLive":2,"columnArticles":96,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":10303,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8094863335048582,"acs":53486,"articleLive":2,"columnArticles":694,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":66074,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5195742780589461,"acs":6981,"articleLive":2,"columnArticles":156,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13436,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.46952984432449346,"acs":6002,"articleLive":2,"columnArticles":96,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12783,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.35871868717057004,"acs":13203,"articleLive":2,"columnArticles":127,"formTitle":"[1293]网格中的最短路径","frequency":0.0,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":36806,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6564603279931747,"acs":6925,"articleLive":2,"columnArticles":72,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","submitted":10549,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8086322926681172,"acs":47943,"articleLive":2,"columnArticles":636,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.0,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":59289,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4534993508792635,"acs":7685,"articleLive":2,"columnArticles":122,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":16946,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.4575729603067528,"acs":6444,"articleLive":2,"columnArticles":92,"formTitle":"[1297]子串的最大出现次数","frequency":0.0,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14083,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5973431058176821,"acs":2608,"articleLive":2,"columnArticles":89,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4366,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7863715300277339,"acs":30339,"articleLive":2,"columnArticles":430,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":38581,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.46692629621018367,"acs":24099,"articleLive":2,"columnArticles":363,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.0,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":51612,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.361152058056469,"acs":3185,"articleLive":2,"columnArticles":72,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8819,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8181476061049551,"acs":19566,"articleLive":2,"columnArticles":294,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.0,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":23915,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8219973768034476,"acs":8774,"articleLive":2,"columnArticles":83,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","submitted":10674,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7243596320235286,"acs":21181,"articleLive":2,"columnArticles":381,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29241,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7469006198760247,"acs":14941,"articleLive":2,"columnArticles":224,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.0,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":20004,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5751733749211932,"acs":17334,"articleLive":2,"columnArticles":271,"formTitle":"[1306]跳跃游戏 III","frequency":0.0,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":30137,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3314647377938517,"acs":1833,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5530,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7502845759817871,"acs":5273,"articleLive":2,"columnArticles":59,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","submitted":7028,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7556224624789015,"acs":16564,"articleLive":2,"columnArticles":288,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":21921,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7129567210462451,"acs":37016,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":51919,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3783580559163306,"acs":5535,"articleLive":2,"columnArticles":86,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14629,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6674282812896675,"acs":10516,"articleLive":2,"columnArticles":149,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.0,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":15756,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8318261862833753,"acs":34955,"articleLive":2,"columnArticles":543,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":42022,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7385553772070625,"acs":11503,"articleLive":2,"columnArticles":190,"formTitle":"[1314]矩阵区域和","frequency":0.0,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":15575,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.810276930894309,"acs":12757,"articleLive":2,"columnArticles":261,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15744,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.43949246629659,"acs":2771,"articleLive":2,"columnArticles":59,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6305,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6143262325749804,"acs":10180,"articleLive":2,"columnArticles":191,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16571,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6546687532603026,"acs":6275,"articleLive":2,"columnArticles":111,"formTitle":"[1318]或运算的最小翻转次数","frequency":0.0,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9585,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6168976844804103,"acs":30798,"articleLive":2,"columnArticles":510,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":49924,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5892166344294004,"acs":2437,"articleLive":2,"columnArticles":56,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4136,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6135946975038782,"acs":4351,"articleLive":2,"columnArticles":76,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","submitted":7091,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.593753523508851,"acs":5266,"articleLive":2,"columnArticles":63,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","submitted":8869,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7549199440385512,"acs":24282,"articleLive":2,"columnArticles":475,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.0,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":32165,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5894642143142743,"acs":5897,"articleLive":2,"columnArticles":114,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10004,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7289826979682676,"acs":10154,"articleLive":2,"columnArticles":180,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":13929,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47249484536082476,"acs":5729,"articleLive":2,"columnArticles":92,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12125,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6890405764125901,"acs":5451,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","submitted":7911,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.4617424537867561,"acs":5920,"articleLive":2,"columnArticles":119,"formTitle":"[1328]破坏回文串","frequency":0.0,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12821,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.771622071721994,"acs":6950,"articleLive":2,"columnArticles":156,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.0,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9007,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.37732160312805474,"acs":1158,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.0,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3069,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.537059871215235,"acs":11760,"articleLive":2,"columnArticles":201,"formTitle":"[1331]数组序号转换","frequency":0.0,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":21897,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6864406779661016,"acs":9396,"articleLive":2,"columnArticles":132,"formTitle":"[1332]删除回文子序列","frequency":0.0,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13688,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5432864760058168,"acs":5604,"articleLive":2,"columnArticles":117,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10315,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4899921335547592,"acs":5606,"articleLive":2,"columnArticles":93,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":0.0,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11441,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5870191492967294,"acs":3464,"articleLive":2,"columnArticles":57,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":5901,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4218077474892396,"acs":1764,"articleLive":2,"columnArticles":48,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","submitted":4182,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.705937931535722,"acs":38852,"articleLive":2,"columnArticles":618,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.0,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":55036,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6396568835956331,"acs":9023,"articleLive":2,"columnArticles":129,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14106,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.39830915553847634,"acs":8292,"articleLive":2,"columnArticles":130,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":20818,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5737683265090476,"acs":4344,"articleLive":2,"columnArticles":95,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7571,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.4791726105563481,"acs":3359,"articleLive":2,"columnArticles":45,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","submitted":7010,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8202319840119127,"acs":41863,"articleLive":2,"columnArticles":636,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":51038,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5441685542117185,"acs":12733,"articleLive":2,"columnArticles":213,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23399,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.592207019631172,"acs":5973,"articleLive":2,"columnArticles":121,"formTitle":"[1344]时钟指针的夹角","frequency":0.0,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":10086,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.36671519908843453,"acs":5793,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":0.0,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15797,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.4350282485875706,"acs":15631,"articleLive":2,"columnArticles":266,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":35931,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7400114155251142,"acs":7779,"articleLive":2,"columnArticles":113,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10512,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3042654028436019,"acs":3210,"articleLive":2,"columnArticles":49,"formTitle":"[1348]推文计数","frequency":0.0,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":10550,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5054163298302344,"acs":3126,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6185,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8477466504263094,"acs":8352,"articleLive":2,"columnArticles":84,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","submitted":9852,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7548595562792592,"acs":29669,"articleLive":2,"columnArticles":543,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.0,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":39304,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.4441976305869682,"acs":6599,"articleLive":2,"columnArticles":71,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":14856,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.283689184459223,"acs":11347,"articleLive":2,"columnArticles":152,"formTitle":"[1353]最多可以参加的会议数目","frequency":0.0,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":39998,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2813747444260539,"acs":2890,"articleLive":2,"columnArticles":70,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10271,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6637706342311034,"acs":3820,"articleLive":2,"columnArticles":56,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","submitted":5755,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.731532568888036,"acs":45742,"articleLive":2,"columnArticles":505,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.0,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":62529,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5288233745722558,"acs":4018,"articleLive":2,"columnArticles":42,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7598,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.49328028293545534,"acs":5579,"articleLive":2,"columnArticles":111,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":11310,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5509441384736428,"acs":2801,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5084,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5050451092117759,"acs":8509,"articleLive":2,"columnArticles":140,"formTitle":"[1360]日期之间隔几天","frequency":0.0,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":16848,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4021238554477976,"acs":7422,"articleLive":2,"columnArticles":200,"formTitle":"[1361]验证二叉树","frequency":0.0,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":18457,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5253227408142999,"acs":5290,"articleLive":2,"columnArticles":68,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10070,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.36525246489393487,"acs":4890,"articleLive":2,"columnArticles":98,"formTitle":"[1363]形成三的最大倍数","frequency":0.0,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":13388,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6739614994934144,"acs":3326,"articleLive":2,"columnArticles":64,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","submitted":4935,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8249997569441069,"acs":84857,"articleLive":2,"columnArticles":1086,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.0,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":102857,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5378361951071265,"acs":7079,"articleLive":2,"columnArticles":140,"formTitle":"[1366]通过投票对团队排名","frequency":0.0,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13162,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4184844212214205,"acs":15137,"articleLive":2,"columnArticles":221,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":36171,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5246117784939935,"acs":3581,"articleLive":2,"columnArticles":87,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6826,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6079275198187996,"acs":2684,"articleLive":2,"columnArticles":42,"formTitle":"[1369]获取最近第二次的活动","frequency":0.0,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","submitted":4415,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7900182592818016,"acs":48026,"articleLive":2,"columnArticles":575,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60791,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5800071227022436,"acs":21172,"articleLive":2,"columnArticles":264,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":0.0,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36503,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5131114473020676,"acs":8140,"articleLive":2,"columnArticles":161,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":15864,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.40230653518301857,"acs":7221,"articleLive":2,"columnArticles":161,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":0.0,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":17949,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.739358677107485,"acs":16901,"articleLive":2,"columnArticles":225,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22859,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5740173217854764,"acs":8616,"articleLive":2,"columnArticles":170,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15010,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5026202633700618,"acs":7481,"articleLive":2,"columnArticles":153,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14884,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32430960715674834,"acs":4169,"articleLive":2,"columnArticles":130,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12855,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8623179684679263,"acs":7165,"articleLive":2,"columnArticles":61,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","submitted":8309,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8377150275884453,"acs":10324,"articleLive":2,"columnArticles":160,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12324,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.727933768452407,"acs":16618,"articleLive":2,"columnArticles":249,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22829,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7316030723488602,"acs":11811,"articleLive":2,"columnArticles":151,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":16144,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6926542360155175,"acs":11070,"articleLive":2,"columnArticles":173,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":15982,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.3245250678474504,"acs":4544,"articleLive":2,"columnArticles":87,"formTitle":"[1383]最大的团队表现值","frequency":0.0,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14002,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5433866891322662,"acs":1935,"articleLive":2,"columnArticles":45,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","submitted":3561,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7009949471271553,"acs":13457,"articleLive":2,"columnArticles":201,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":19197,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3116508236699348,"acs":6262,"articleLive":2,"columnArticles":130,"formTitle":"[1386]安排电影院座位","frequency":0.0,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20093,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.694531472514953,"acs":9754,"articleLive":2,"columnArticles":168,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14044,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5408469055374593,"acs":4151,"articleLive":2,"columnArticles":53,"formTitle":"[1388]3n 块披萨","frequency":0.0,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7675,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8311492382783612,"acs":28097,"articleLive":2,"columnArticles":478,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.0,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33805,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.35334303953410234,"acs":6310,"articleLive":2,"columnArticles":114,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17858,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.39948360754173173,"acs":6653,"articleLive":2,"columnArticles":202,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.0,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16654,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.40301679452622846,"acs":7775,"articleLive":2,"columnArticles":141,"formTitle":"[1392]最长快乐前缀","frequency":0.0,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":19292,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.857872340425532,"acs":4032,"articleLive":2,"columnArticles":60,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","submitted":4700,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6652605265213655,"acs":17032,"articleLive":2,"columnArticles":273,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":25602,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7488793967199283,"acs":14201,"articleLive":2,"columnArticles":211,"formTitle":"[1395]统计作战单位数","frequency":0.0,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":18963,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.412618015316666,"acs":10183,"articleLive":2,"columnArticles":142,"formTitle":"[1396]设计地铁系统","frequency":0.0,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":24679,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3733528550512445,"acs":1020,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2732,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7617372955864252,"acs":4332,"articleLive":2,"columnArticles":64,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","submitted":5687,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6707936735132041,"acs":9373,"articleLive":2,"columnArticles":150,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":13973,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6047736802494356,"acs":5625,"articleLive":2,"columnArticles":96,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9301,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41670221843003413,"acs":3907,"articleLive":2,"columnArticles":89,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9376,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7532987747408105,"acs":9591,"articleLive":2,"columnArticles":175,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12732,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6908346067561856,"acs":21248,"articleLive":2,"columnArticles":361,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.0,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":30757,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.49294037011651815,"acs":7192,"articleLive":2,"columnArticles":153,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14590,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5074667637953014,"acs":5573,"articleLive":2,"columnArticles":140,"formTitle":"[1405]最长快乐字符串","frequency":0.0,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":10982,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5697084169519537,"acs":4826,"articleLive":2,"columnArticles":81,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8471,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6664759070619206,"acs":5823,"articleLive":2,"columnArticles":65,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","submitted":8737,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6154842290259921,"acs":13308,"articleLive":2,"columnArticles":202,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":21622,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8064870259481038,"acs":8081,"articleLive":2,"columnArticles":129,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10020,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4749919948767211,"acs":7417,"articleLive":2,"columnArticles":118,"formTitle":"[1410]HTML 实体解析器","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15615,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5505154639175258,"acs":7743,"articleLive":2,"columnArticles":140,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":0.0,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14065,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5565061679267808,"acs":2797,"articleLive":2,"columnArticles":67,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","submitted":5026,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6928594300352225,"acs":10819,"articleLive":2,"columnArticles":219,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.0,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":15615,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6027352387191877,"acs":7360,"articleLive":2,"columnArticles":147,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12211,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6850500417014178,"acs":6571,"articleLive":2,"columnArticles":178,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.0,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9592,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.40947075208913647,"acs":2793,"articleLive":2,"columnArticles":49,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6821,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5188999273079719,"acs":12849,"articleLive":2,"columnArticles":183,"formTitle":"[1417]重新格式化字符串","frequency":0.0,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24762,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7326236516519917,"acs":25877,"articleLive":2,"columnArticles":414,"formTitle":"[1418]点菜展示表","frequency":0.0,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35321,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4188325521942906,"acs":7864,"articleLive":2,"columnArticles":150,"formTitle":"[1419]数青蛙","frequency":0.0,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18776,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5972839506172839,"acs":2419,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":0.0,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4050,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7484293908768096,"acs":2740,"articleLive":2,"columnArticles":33,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","submitted":3661,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5399400640694431,"acs":10450,"articleLive":2,"columnArticles":193,"formTitle":"[1422]分割字符串的最大得分","frequency":0.0,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19354,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5541973068474835,"acs":34818,"articleLive":2,"columnArticles":509,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":62826,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.39789736279401283,"acs":6699,"articleLive":2,"columnArticles":142,"formTitle":"[1424]对角线遍历 II","frequency":0.0,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16836,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.4377160237798977,"acs":3166,"articleLive":2,"columnArticles":69,"formTitle":"[1425]带限制的子序列和","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7233,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7084548104956269,"acs":1458,"articleLive":2,"columnArticles":48,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","submitted":2058,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6575922565033273,"acs":1087,"articleLive":2,"columnArticles":44,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","submitted":1653,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5923295454545454,"acs":834,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","submitted":1408,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.50520381613183,"acs":1165,"articleLive":2,"columnArticles":38,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","submitted":2306,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5834031852472757,"acs":696,"articleLive":2,"columnArticles":27,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","submitted":1193,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8462634681406949,"acs":78386,"articleLive":2,"columnArticles":1028,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":92626,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39406148725584655,"acs":4499,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11417,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6444922084900591,"acs":5997,"articleLive":2,"columnArticles":102,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9305,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.46420069584325213,"acs":2535,"articleLive":2,"columnArticles":44,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5461,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6197971848039958,"acs":4095,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","submitted":6607,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8206591751392275,"acs":41408,"articleLive":2,"columnArticles":628,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":50457,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5873338987842804,"acs":10387,"articleLive":2,"columnArticles":175,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":17685,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.48246644541689915,"acs":32855,"articleLive":2,"columnArticles":465,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":0.0,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":68098,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.561345046955468,"acs":3706,"articleLive":2,"columnArticles":57,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6602,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6983328922995502,"acs":2639,"articleLive":2,"columnArticles":35,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","submitted":3779,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6471674876847291,"acs":17867,"articleLive":2,"columnArticles":374,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":27608,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7916447533898886,"acs":34621,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43733,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4100566051606263,"acs":5578,"articleLive":2,"columnArticles":137,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13603,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5249290636400487,"acs":2590,"articleLive":2,"columnArticles":59,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":4934,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8571428571428571,"acs":3942,"articleLive":2,"columnArticles":50,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","submitted":4599,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5731740552325582,"acs":12619,"articleLive":2,"columnArticles":215,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":22016,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6172153491297966,"acs":5887,"articleLive":2,"columnArticles":73,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9538,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7104446742502585,"acs":9618,"articleLive":2,"columnArticles":152,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.0,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":13538,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6276273976798499,"acs":16393,"articleLive":2,"columnArticles":208,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26119,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8025450051768478,"acs":24029,"articleLive":2,"columnArticles":340,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":29941,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.522563459730492,"acs":10005,"articleLive":2,"columnArticles":152,"formTitle":"[1451]重新排列句子中的单词","frequency":0.0,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19146,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.499536686041614,"acs":5930,"articleLive":2,"columnArticles":89,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11871,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.3644086742678292,"acs":1630,"articleLive":2,"columnArticles":30,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4473,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.39755082439570993,"acs":4967,"articleLive":2,"columnArticles":79,"formTitle":"[1454]活跃用户","frequency":0.0,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","submitted":12494,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6330469827129069,"acs":11938,"articleLive":2,"columnArticles":204,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":18858,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5223070265166417,"acs":13276,"articleLive":2,"columnArticles":205,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":25418,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6327887233701746,"acs":7901,"articleLive":2,"columnArticles":136,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12486,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.44234419487503956,"acs":5593,"articleLive":2,"columnArticles":88,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12644,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5960474308300395,"acs":2262,"articleLive":2,"columnArticles":46,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","submitted":3795,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7455123502078748,"acs":15242,"articleLive":2,"columnArticles":310,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":20445,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5005125576627371,"acs":5859,"articleLive":2,"columnArticles":83,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11706,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.4273987721597572,"acs":6196,"articleLive":2,"columnArticles":124,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":14497,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5913716814159292,"acs":2673,"articleLive":2,"columnArticles":63,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4520,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7686051240341603,"acs":26460,"articleLive":2,"columnArticles":368,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.0,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":34426,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3091494971194219,"acs":6332,"articleLive":2,"columnArticles":79,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20482,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4844155844155844,"acs":6341,"articleLive":2,"columnArticles":124,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13090,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6173488546751784,"acs":1644,"articleLive":2,"columnArticles":48,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2663,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7076923076923077,"acs":2944,"articleLive":2,"columnArticles":50,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","submitted":4160,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7939262472885033,"acs":2196,"articleLive":2,"columnArticles":83,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","submitted":2766,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8432531529538199,"acs":53356,"articleLive":2,"columnArticles":724,"formTitle":"[1470]重新排列数组","frequency":0.0,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":63274,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5436648904677324,"acs":7346,"articleLive":2,"columnArticles":105,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13512,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6169011906602753,"acs":7979,"articleLive":2,"columnArticles":128,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":12934,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.674496498325286,"acs":15506,"articleLive":2,"columnArticles":164,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":22989,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7183734939759037,"acs":1908,"articleLive":2,"columnArticles":62,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","submitted":2656,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7215732087227414,"acs":14824,"articleLive":2,"columnArticles":229,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":20544,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8650133956172288,"acs":12592,"articleLive":2,"columnArticles":117,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14557,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.28928678006565206,"acs":4847,"articleLive":2,"columnArticles":97,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.0,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":16755,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5793390238564238,"acs":2647,"articleLive":2,"columnArticles":57,"formTitle":"[1478]安排邮筒","frequency":0.0,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4569,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5655617483132883,"acs":1928,"articleLive":2,"columnArticles":39,"formTitle":"[1479]周内每天的销售情况","frequency":0.0,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","submitted":3409,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8692912318742377,"acs":128290,"articleLive":2,"columnArticles":1284,"formTitle":"[1480]一维数组的动态和","frequency":0.0,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":147580,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.514434356829542,"acs":10086,"articleLive":2,"columnArticles":146,"formTitle":"[1481]不同整数的最少数目","frequency":0.0,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":19606,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5865482520647132,"acs":31107,"articleLive":2,"columnArticles":404,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":53034,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.3002889129649693,"acs":3326,"articleLive":2,"columnArticles":70,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11076,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8068181818181818,"acs":781,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","submitted":968,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6607363043861194,"acs":3751,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","submitted":5677,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8586959156465883,"acs":70851,"articleLive":2,"columnArticles":679,"formTitle":"[1486]数组异或操作","frequency":0.0,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":82510,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.3099166868882957,"acs":7663,"articleLive":2,"columnArticles":106,"formTitle":"[1487]保证文件名唯一","frequency":0.0,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24726,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23633203240300416,"acs":7206,"articleLive":2,"columnArticles":113,"formTitle":"[1488]避免洪水泛滥","frequency":0.0,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":30491,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6914128088270568,"acs":11530,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16676,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8557763061074319,"acs":1163,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","submitted":1359,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6718337507615244,"acs":19850,"articleLive":2,"columnArticles":297,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":29546,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6634779981874938,"acs":6589,"articleLive":2,"columnArticles":79,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":9931,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5672614200044421,"acs":7662,"articleLive":2,"columnArticles":145,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":0.0,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":13507,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3682728928630568,"acs":2224,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":0.0,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6039,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5429163787145819,"acs":3928,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","submitted":7235,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5375055481580115,"acs":10899,"articleLive":2,"columnArticles":165,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":20277,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3906213143369345,"acs":8280,"articleLive":2,"columnArticles":114,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":21197,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33425449871465296,"acs":5201,"articleLive":2,"columnArticles":65,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15560,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.375561797752809,"acs":2674,"articleLive":2,"columnArticles":59,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7120,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.3005917159763314,"acs":762,"articleLive":2,"columnArticles":27,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","submitted":2535,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5920209668025626,"acs":4066,"articleLive":2,"columnArticles":58,"formTitle":"[1501]可以放心投资的国家","frequency":0.0,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","submitted":6868,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7173986868915554,"acs":25350,"articleLive":2,"columnArticles":304,"formTitle":"[1502]判断能否形成等差数列","frequency":0.0,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":35336,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5128158844765343,"acs":8523,"articleLive":2,"columnArticles":87,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.0,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16620,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.594488188976378,"acs":7399,"articleLive":2,"columnArticles":133,"formTitle":"[1504]统计全 1 子矩形","frequency":0.0,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12446,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.362574388362354,"acs":3290,"articleLive":2,"columnArticles":72,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9074,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8415545590433483,"acs":563,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","submitted":669,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5892911655168204,"acs":9652,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":0.0,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16379,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5527252807450014,"acs":6054,"articleLive":2,"columnArticles":52,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":10953,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5468933803871243,"acs":5114,"articleLive":2,"columnArticles":76,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9351,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.576971500515051,"acs":5041,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.0,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8737,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6786184210526316,"acs":4126,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":0.0,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","submitted":6080,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8488554269301071,"acs":58515,"articleLive":2,"columnArticles":742,"formTitle":"[1512]好数对的数目","frequency":0.0,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":68934,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37957836090380714,"acs":11037,"articleLive":2,"columnArticles":148,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":29077,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.32103887482885946,"acs":7738,"articleLive":2,"columnArticles":135,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":24103,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34241032370953634,"acs":3131,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9144,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5788177339901478,"acs":235,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","submitted":406,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7319853731985373,"acs":3403,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","submitted":4649,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6743199129488574,"acs":24788,"articleLive":2,"columnArticles":396,"formTitle":"[1518]换酒问题","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":36760,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2975108225108225,"acs":5498,"articleLive":2,"columnArticles":123,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18480,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33222767679448056,"acs":2504,"articleLive":2,"columnArticles":70,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7537,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3963598074608905,"acs":2635,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6648,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7066276803118908,"acs":725,"articleLive":2,"columnArticles":28,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","submitted":1026,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5772452303396929,"acs":9924,"articleLive":2,"columnArticles":170,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":17192,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.42752485609628466,"acs":4902,"articleLive":2,"columnArticles":101,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.0,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":11466,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6632400297250434,"acs":5355,"articleLive":2,"columnArticles":110,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8074,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6144342027848598,"acs":3133,"articleLive":2,"columnArticles":50,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5099,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.503608320362247,"acs":3559,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","submitted":7067,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7850774531204797,"acs":29851,"articleLive":2,"columnArticles":357,"formTitle":"[1528]重新排列字符串","frequency":0.0,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":38023,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6901386508801994,"acs":8860,"articleLive":2,"columnArticles":134,"formTitle":"[1529]灯泡开关 IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12838,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.566590239109073,"acs":8649,"articleLive":2,"columnArticles":146,"formTitle":"[1530]好叶子节点对的数量","frequency":0.0,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15265,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.32801577343609967,"acs":1830,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":0.0,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5579,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6141932501155802,"acs":2657,"articleLive":2,"columnArticles":48,"formTitle":"[1532]最近的三笔订单","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","submitted":4326,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6168831168831169,"acs":285,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","submitted":462,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7897315033042193,"acs":17089,"articleLive":2,"columnArticles":160,"formTitle":"[1534]统计好三元组","frequency":0.0,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21639,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.45303602058319037,"acs":13206,"articleLive":2,"columnArticles":182,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.0,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29150,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.43981083404987104,"acs":4092,"articleLive":2,"columnArticles":78,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9304,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3656925870893181,"acs":4430,"articleLive":2,"columnArticles":88,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12114,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.5942028985507246,"acs":123,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","submitted":207,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5391048525717308,"acs":16309,"articleLive":2,"columnArticles":246,"formTitle":"[1539]第 k 个缺失的正整数","frequency":0.0,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":30252,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3175311884438608,"acs":4836,"articleLive":2,"columnArticles":85,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15230,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4604647535870243,"acs":5905,"articleLive":2,"columnArticles":92,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12824,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.38244416873449133,"acs":2466,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6448,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5516458569807038,"acs":2916,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","submitted":5286,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.545873469727674,"acs":19664,"articleLive":2,"columnArticles":319,"formTitle":"[1544]整理字符串","frequency":0.0,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":36023,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5534628503633398,"acs":7464,"articleLive":2,"columnArticles":100,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.0,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13486,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4140788415124698,"acs":5147,"articleLive":2,"columnArticles":79,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12430,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5366728673930374,"acs":4039,"articleLive":2,"columnArticles":70,"formTitle":"[1547]切棍子的最小成本","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7526,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7125256673511293,"acs":347,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","submitted":487,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6698841698841699,"acs":2429,"articleLive":2,"columnArticles":47,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","submitted":3626,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6595360423478126,"acs":21181,"articleLive":2,"columnArticles":289,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":32115,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8164329245906454,"acs":11119,"articleLive":2,"columnArticles":152,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13619,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5105701113235128,"acs":9081,"articleLive":2,"columnArticles":123,"formTitle":"[1552]两球之间的磁力","frequency":0.0,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17786,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29555555555555557,"acs":7714,"articleLive":2,"columnArticles":122,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":0.0,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26100,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7098092643051771,"acs":521,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","submitted":734,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.43787414221054166,"acs":2999,"articleLive":2,"columnArticles":56,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","submitted":6849,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5787012149231265,"acs":10765,"articleLive":2,"columnArticles":164,"formTitle":"[1556]千位分隔数","frequency":0.0,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":18602,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7675686391119041,"acs":7744,"articleLive":2,"columnArticles":104,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":10089,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6226783968719453,"acs":4459,"articleLive":2,"columnArticles":69,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.0,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7161,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.36678754266211605,"acs":3439,"articleLive":2,"columnArticles":61,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":9376,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.574421094900281,"acs":8583,"articleLive":2,"columnArticles":90,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":14942,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7800390861917919,"acs":11575,"articleLive":2,"columnArticles":166,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.0,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":14839,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3092873831775701,"acs":4236,"articleLive":2,"columnArticles":86,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13696,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3775862068965517,"acs":3942,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10440,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.540084388185654,"acs":640,"articleLive":2,"columnArticles":24,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","submitted":1185,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7244714349977508,"acs":3221,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","submitted":4446,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4456084716008834,"acs":7869,"articleLive":2,"columnArticles":120,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.0,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17659,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.39704363542473536,"acs":12302,"articleLive":2,"columnArticles":199,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.0,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":30984,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.4554861730597681,"acs":2553,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5605,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47335495829471735,"acs":2043,"articleLive":2,"columnArticles":45,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4316,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8982574480044969,"acs":1598,"articleLive":2,"columnArticles":37,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","submitted":1779,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7585049239033125,"acs":3389,"articleLive":2,"columnArticles":42,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","submitted":4468,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8050434414070777,"acs":18995,"articleLive":2,"columnArticles":318,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.0,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":23595,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2955861793489115,"acs":4440,"articleLive":2,"columnArticles":65,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15021,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3263462731848583,"acs":4733,"articleLive":2,"columnArticles":82,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.0,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14503,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5971680393006791,"acs":4133,"articleLive":2,"columnArticles":66,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":6921,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47651918976545843,"acs":17879,"articleLive":2,"columnArticles":251,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":37520,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.32492193971834576,"acs":5099,"articleLive":2,"columnArticles":79,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.0,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15693,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5822043010752688,"acs":10829,"articleLive":2,"columnArticles":202,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18600,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6188808497536946,"acs":16081,"articleLive":2,"columnArticles":294,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":25984,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6372093023255814,"acs":274,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","submitted":430,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8080784496848004,"acs":3461,"articleLive":2,"columnArticles":45,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","submitted":4283,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6708197649723914,"acs":9476,"articleLive":2,"columnArticles":108,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.0,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14126,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6853002831819351,"acs":18634,"articleLive":2,"columnArticles":242,"formTitle":"[1583]统计不开心的朋友","frequency":0.0,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27191,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6641901931649331,"acs":25926,"articleLive":2,"columnArticles":327,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":39034,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.43020097772949484,"acs":2376,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5523,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6218905472636815,"acs":375,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","submitted":603,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8243632868813071,"acs":3431,"articleLive":2,"columnArticles":41,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","submitted":4162,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8393607428582391,"acs":43750,"articleLive":2,"columnArticles":697,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.0,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":52123,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.29332719035552485,"acs":3820,"articleLive":2,"columnArticles":56,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13023,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.26826915943319235,"acs":3616,"articleLive":2,"columnArticles":57,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.0,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13479,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5783132530120482,"acs":1104,"articleLive":2,"columnArticles":32,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1909,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4449663651125029,"acs":7673,"articleLive":2,"columnArticles":126,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17244,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5310639142516872,"acs":5351,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.0,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10076,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.31413730803974704,"acs":4173,"articleLive":2,"columnArticles":100,"formTitle":"[1594]矩阵的最大非负积","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13284,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4643825486812916,"acs":1884,"articleLive":2,"columnArticles":39,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4057,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7540106951871658,"acs":2397,"articleLive":2,"columnArticles":40,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","submitted":3179,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.663594470046083,"acs":288,"articleLive":2,"columnArticles":20,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"lock","submitted":434,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6717983316977428,"acs":10953,"articleLive":2,"columnArticles":148,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16304,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.41937588344025223,"acs":3857,"articleLive":2,"columnArticles":69,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9197,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6789382527087445,"acs":16856,"articleLive":2,"columnArticles":206,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24827,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4896256202074876,"acs":2171,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4434,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.786697247706422,"acs":686,"articleLive":2,"columnArticles":29,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","submitted":872,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8443455031166518,"acs":56892,"articleLive":2,"columnArticles":455,"formTitle":"[1603]设计停车系统","frequency":0.0,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":67380,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4155829721018117,"acs":3739,"articleLive":2,"columnArticles":63,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":8997,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7349501948895626,"acs":3394,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4618,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.34070330595914927,"acs":1618,"articleLive":2,"columnArticles":33,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4749,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5453501722158438,"acs":2850,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","submitted":5226,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6392239119035134,"acs":9752,"articleLive":2,"columnArticles":161,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15256,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5119209565404167,"acs":7150,"articleLive":2,"columnArticles":122,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":13967,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.2693816335948316,"acs":2335,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8668,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6101694915254238,"acs":2088,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3422,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7346600331674958,"acs":443,"articleLive":2,"columnArticles":20,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","submitted":603,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7214691735898557,"acs":1650,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","submitted":2287,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.82119140625,"acs":16818,"articleLive":2,"columnArticles":285,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":20480,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49615384615384617,"acs":5289,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10660,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.2755940239263465,"acs":4999,"articleLive":2,"columnArticles":93,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.0,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18139,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6199786704585851,"acs":1744,"articleLive":2,"columnArticles":32,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2813,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5946969696969697,"acs":314,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","submitted":528,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6745043798985708,"acs":7315,"articleLive":2,"columnArticles":128,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10845,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.37183951551854655,"acs":2456,"articleLive":2,"columnArticles":42,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6605,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4395796847635727,"acs":1757,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":3997,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14913133276637103,"acs":2455,"articleLive":2,"columnArticles":54,"formTitle":"[1622]奇妙序列","frequency":0.0,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":16462,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7828795569912321,"acs":3393,"articleLive":2,"columnArticles":44,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","submitted":4334,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6259210381612229,"acs":11383,"articleLive":2,"columnArticles":197,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.0,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":18186,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5429260152048953,"acs":2928,"articleLive":2,"columnArticles":66,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5393,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.38662187530876396,"acs":3913,"articleLive":2,"columnArticles":84,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10121,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.38044666562548807,"acs":2436,"articleLive":2,"columnArticles":37,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6403,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8434782608695652,"acs":388,"articleLive":2,"columnArticles":18,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","submitted":460,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5235975066785397,"acs":8232,"articleLive":2,"columnArticles":98,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":15722,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7689027561102444,"acs":7393,"articleLive":2,"columnArticles":115,"formTitle":"[1630]等差子数组","frequency":0.0,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9615,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4929932571093521,"acs":25224,"articleLive":2,"columnArticles":299,"formTitle":"[1631]最小体力消耗路径","frequency":0.0,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":51165,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31819169745707454,"acs":1464,"articleLive":2,"columnArticles":26,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4601,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6556339742029691,"acs":2694,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","submitted":4109,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5265151515151515,"acs":417,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","submitted":792,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5468003820439351,"acs":1145,"articleLive":2,"columnArticles":31,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","submitted":2094,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7068219372098513,"acs":8983,"articleLive":2,"columnArticles":172,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.0,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12709,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8069802731411229,"acs":5318,"articleLive":2,"columnArticles":70,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6590,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7109474218948438,"acs":2799,"articleLive":2,"columnArticles":47,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3937,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.40339634732457547,"acs":1259,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3121,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6605984515589035,"acs":12628,"articleLive":2,"columnArticles":216,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":19116,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7704792332268371,"acs":12058,"articleLive":2,"columnArticles":277,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":0.0,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15650,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.45125874125874127,"acs":6453,"articleLive":2,"columnArticles":106,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14300,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4519501407318054,"acs":2248,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":4974,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5473107569721115,"acs":1099,"articleLive":2,"columnArticles":22,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","submitted":2008,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4132841328413284,"acs":784,"articleLive":2,"columnArticles":24,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","submitted":1897,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5367838994176977,"acs":34753,"articleLive":2,"columnArticles":354,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":64743,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5140153671030165,"acs":7225,"articleLive":2,"columnArticles":107,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.0,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":14056,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.27729134870270705,"acs":3452,"articleLive":2,"columnArticles":89,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.0,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12449,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.47348767737117253,"acs":2536,"articleLive":2,"columnArticles":64,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5356,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7941368078175896,"acs":1219,"articleLive":2,"columnArticles":28,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.0,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","submitted":1535,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6807339449541284,"acs":742,"articleLive":2,"columnArticles":23,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","submitted":1090,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6573453361425015,"acs":6864,"articleLive":2,"columnArticles":176,"formTitle":"[1652]拆炸弹","frequency":0.0,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":10442,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5061404719194149,"acs":3668,"articleLive":2,"columnArticles":86,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7247,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.27390160274300296,"acs":3435,"articleLive":2,"columnArticles":49,"formTitle":"[1654]到家的最少跳跃次数","frequency":0.0,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":12541,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.38312930374904364,"acs":2003,"articleLive":2,"columnArticles":32,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5228,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7816034430987889,"acs":7809,"articleLive":2,"columnArticles":92,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":9991,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46440129449838186,"acs":5453,"articleLive":2,"columnArticles":76,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.0,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11742,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.2991047205642973,"acs":8820,"articleLive":2,"columnArticles":150,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":29488,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4115112342259157,"acs":1337,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3249,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7396226415094339,"acs":392,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","submitted":530,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7217116599655371,"acs":2513,"articleLive":2,"columnArticles":53,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.0,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","submitted":3482,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8121219309690428,"acs":20541,"articleLive":2,"columnArticles":282,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":25293,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5728869539108242,"acs":7632,"articleLive":2,"columnArticles":131,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13322,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5450030407459964,"acs":5377,"articleLive":2,"columnArticles":106,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9866,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6644779194026007,"acs":5161,"articleLive":2,"columnArticles":81,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7767,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6968838526912181,"acs":246,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","submitted":353,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6022949902043101,"acs":2152,"articleLive":2,"columnArticles":32,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","submitted":3573,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4425746464117339,"acs":6759,"articleLive":2,"columnArticles":128,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":15272,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7580856123662307,"acs":12751,"articleLive":2,"columnArticles":233,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":16820,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5265706481251552,"acs":4241,"articleLive":2,"columnArticles":76,"formTitle":"[1670]设计前中后队列","frequency":0.0,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":8054,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46648301193755737,"acs":2032,"articleLive":2,"columnArticles":40,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.0,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4356,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8506997413278504,"acs":38478,"articleLive":2,"columnArticles":441,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":45231,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35308269257983865,"acs":7485,"articleLive":2,"columnArticles":167,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21199,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.36363636363636365,"acs":2492,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.0,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6853,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4361078546307151,"acs":2604,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":5971,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7638623326959847,"acs":799,"articleLive":2,"columnArticles":21,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","submitted":1046,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.3903301886792453,"acs":1986,"articleLive":2,"columnArticles":32,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","submitted":5088,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.830531142529614,"acs":17388,"articleLive":2,"columnArticles":281,"formTitle":"[1678]设计 Goal 解析器","frequency":0.0,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":20936,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49632987910189985,"acs":6897,"articleLive":2,"columnArticles":109,"formTitle":"[1679]K 和数对的最大数目","frequency":0.0,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":13896,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.46448275862068966,"acs":5388,"articleLive":2,"columnArticles":71,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11600,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38466526179283517,"acs":2373,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6169,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5176282051282052,"acs":323,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","submitted":624,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8957518894970029,"acs":3437,"articleLive":2,"columnArticles":37,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","submitted":3837,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8280803703338915,"acs":16815,"articleLive":2,"columnArticles":354,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":20306,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.6000979751796212,"acs":3675,"articleLive":2,"columnArticles":85,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6124,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4700502152080344,"acs":2621,"articleLive":2,"columnArticles":48,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5576,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.4022842639593909,"acs":951,"articleLive":2,"columnArticles":21,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2364,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8054438350599228,"acs":19826,"articleLive":2,"columnArticles":265,"formTitle":"[1688]比赛中的配对次数","frequency":0.0,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":24615,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8666944262685147,"acs":14570,"articleLive":2,"columnArticles":190,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":16811,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5185140802875974,"acs":4327,"articleLive":2,"columnArticles":106,"formTitle":"[1690]石子游戏 VII","frequency":0.0,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8345,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.48821277453153333,"acs":2423,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":4963,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6446886446886447,"acs":176,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","submitted":273,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8034557235421166,"acs":2232,"articleLive":2,"columnArticles":33,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","submitted":2778,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6358391031981536,"acs":7714,"articleLive":2,"columnArticles":137,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12132,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4611697745824908,"acs":6158,"articleLive":2,"columnArticles":130,"formTitle":"[1695]删除子数组的最大得分","frequency":0.0,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":13353,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.3979952451326865,"acs":6194,"articleLive":2,"columnArticles":111,"formTitle":"[1696]跳跃游戏 VI","frequency":0.0,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":15563,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5257806826434277,"acs":2172,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4131,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5375722543352601,"acs":465,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","submitted":865,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.7976298997265269,"acs":1750,"articleLive":2,"columnArticles":41,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","submitted":2194,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7109198006343452,"acs":7845,"articleLive":2,"columnArticles":180,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.0,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":11035,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6097983616887208,"acs":3871,"articleLive":2,"columnArticles":79,"formTitle":"[1701]平均等待时间","frequency":0.0,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6348,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4769105691056911,"acs":2933,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6150,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3844759891271519,"acs":1273,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3311,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7815942968243681,"acs":12060,"articleLive":2,"columnArticles":183,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":15430,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.34698341333009297,"acs":5711,"articleLive":2,"columnArticles":118,"formTitle":"[1705]吃苹果的最大数目","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16459,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5846300846300846,"acs":4283,"articleLive":2,"columnArticles":111,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7326,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5030567996019052,"acs":14153,"articleLive":2,"columnArticles":150,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28134,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6987227648384673,"acs":930,"articleLive":2,"columnArticles":25,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","submitted":1331,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7038327526132404,"acs":1414,"articleLive":2,"columnArticles":36,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","submitted":2009,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6936566487270968,"acs":11471,"articleLive":2,"columnArticles":184,"formTitle":"[1710]卡车上的最大单元数","frequency":0.0,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":16537,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3589667032914537,"acs":30057,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":0.0,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":83732,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26280436607892527,"acs":6260,"articleLive":2,"columnArticles":104,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":23820,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.49634642267124157,"acs":15623,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":0.0,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31476,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.636604774535809,"acs":240,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"lock","submitted":377,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.729175752289577,"acs":1672,"articleLive":2,"columnArticles":36,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","submitted":2293,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6741397717007473,"acs":8209,"articleLive":2,"columnArticles":191,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":12177,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43231961836613,"acs":2175,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5031,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4885245901639344,"acs":1937,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":3965,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.36829699469652327,"acs":625,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1697,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.869397391695398,"acs":46398,"articleLive":2,"columnArticles":486,"formTitle":"[1720]解码异或后的数组","frequency":0.0,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53368,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6454127885893871,"acs":10679,"articleLive":2,"columnArticles":165,"formTitle":"[1721]交换链表中的节点","frequency":0.0,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":16546,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5144880174291939,"acs":4723,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9180,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5065772222707805,"acs":23183,"articleLive":2,"columnArticles":175,"formTitle":"[1723]完成所有工作的最短时间","frequency":0.0,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":45764,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.562396006655574,"acs":338,"articleLive":2,"columnArticles":11,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"lock","submitted":601,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7881243553852955,"acs":10698,"articleLive":2,"columnArticles":144,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13574,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.47975267787163633,"acs":5509,"articleLive":2,"columnArticles":107,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11483,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5749199393224338,"acs":3411,"articleLive":2,"columnArticles":83,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5933,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.35822825735531844,"acs":1108,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3093,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6217723004694836,"acs":2119,"articleLive":2,"columnArticles":22,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","submitted":3408,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5299295774647887,"acs":602,"articleLive":2,"columnArticles":23,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","submitted":1136,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.47098797699947725,"acs":1802,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","submitted":3826,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7928926508128443,"acs":11803,"articleLive":2,"columnArticles":203,"formTitle":"[1732]找到最高海拔","frequency":0.0,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":14886,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4575461454940282,"acs":2107,"articleLive":2,"columnArticles":54,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4605,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7231454159548584,"acs":27938,"articleLive":2,"columnArticles":366,"formTitle":"[1734]解码异或后的排列","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38634,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4871306005719733,"acs":1022,"articleLive":2,"columnArticles":25,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2098,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4490995320402729,"acs":28503,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":0.0,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":63467,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3099551414768806,"acs":3593,"articleLive":2,"columnArticles":102,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11592,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6539027982326951,"acs":28416,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43456,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.47056762438682553,"acs":2686,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5708,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7063197026022305,"acs":570,"articleLive":2,"columnArticles":19,"formTitle":"[1740]找到二叉树中的距离","frequency":0.0,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","submitted":807,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8416458852867831,"acs":2025,"articleLive":2,"columnArticles":31,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","submitted":2406,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7087125042130098,"acs":8411,"articleLive":2,"columnArticles":129,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11868,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6968449931412894,"acs":22352,"articleLive":2,"columnArticles":327,"formTitle":"[1743]从相邻元素对还原数组","frequency":0.0,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32076,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3628074585139398,"acs":28291,"articleLive":2,"columnArticles":368,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":77978,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.48497109826589596,"acs":3356,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":6920,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.592,"acs":814,"articleLive":2,"columnArticles":34,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","submitted":1375,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7044468546637744,"acs":1299,"articleLive":2,"columnArticles":34,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","submitted":1844,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.75,"acs":11004,"articleLive":2,"columnArticles":222,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":14672,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5318870122306348,"acs":3653,"articleLive":2,"columnArticles":84,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6868,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.45715092474939995,"acs":3238,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7083,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4712394182765357,"acs":2171,"articleLive":2,"columnArticles":33,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.0,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4607,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6811437626044368,"acs":9457,"articleLive":2,"columnArticles":111,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":13884,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6299820276984882,"acs":5959,"articleLive":2,"columnArticles":127,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9459,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4215418813781954,"acs":4172,"articleLive":2,"columnArticles":90,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.0,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":9897,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4012248967383564,"acs":2817,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.0,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":7021,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7931034482758621,"acs":368,"articleLive":2,"columnArticles":13,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","submitted":464,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9203296703296703,"acs":3015,"articleLive":2,"columnArticles":32,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","submitted":3276,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6376953997320233,"acs":7139,"articleLive":2,"columnArticles":114,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11195,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.4290657439446367,"acs":4588,"articleLive":2,"columnArticles":95,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10693,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5388204795852236,"acs":4157,"articleLive":2,"columnArticles":77,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7715,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.42959626292959624,"acs":2575,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.0,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":5994,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6958473625140292,"acs":620,"articleLive":2,"columnArticles":21,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","submitted":891,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.609800090184879,"acs":4057,"articleLive":2,"columnArticles":79,"formTitle":"[1763]最长的美好子字符串","frequency":0.0,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":6653,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.47550727608116417,"acs":2320,"articleLive":2,"columnArticles":55,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4879,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5517558656647753,"acs":3598,"articleLive":2,"columnArticles":82,"formTitle":"[1765]地图中的最高点","frequency":0.0,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6521,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37530136619341015,"acs":1401,"articleLive":2,"columnArticles":26,"formTitle":"[1766]互质树","frequency":0.0,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3733,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7877041306436119,"acs":820,"articleLive":2,"columnArticles":21,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","submitted":1041,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7651187904967602,"acs":11336,"articleLive":2,"columnArticles":201,"formTitle":"[1768]交替合并字符串","frequency":0.0,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":14816,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8559119604163112,"acs":10033,"articleLive":2,"columnArticles":168,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11722,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.36998380421090515,"acs":4112,"articleLive":2,"columnArticles":102,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11114,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3655053358443189,"acs":2329,"articleLive":2,"columnArticles":47,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6372,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5152439024390244,"acs":338,"articleLive":2,"columnArticles":11,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","submitted":656,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8425803726970384,"acs":15961,"articleLive":2,"columnArticles":198,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":18943,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5504240412979351,"acs":5971,"articleLive":2,"columnArticles":90,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10848,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4742761692650334,"acs":4259,"articleLive":2,"columnArticles":92,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":8980,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4642857142857143,"acs":1755,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":0.0,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3780,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7822391559202814,"acs":5338,"articleLive":2,"columnArticles":61,"formTitle":"[1777]每家商店的产品价格","frequency":0.0,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","submitted":6824,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5145348837209303,"acs":177,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","submitted":344,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6469121140142517,"acs":5447,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.0,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8420,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6648297820230223,"acs":5429,"articleLive":2,"columnArticles":110,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8166,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5190276186839761,"acs":4078,"articleLive":2,"columnArticles":60,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7857,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.29167683670978767,"acs":1195,"articleLive":2,"columnArticles":33,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4097,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7968855788761002,"acs":1177,"articleLive":2,"columnArticles":29,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","submitted":1477,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.4213073900124605,"acs":8791,"articleLive":2,"columnArticles":101,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":20866,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.3495854609344973,"acs":6367,"articleLive":2,"columnArticles":62,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18213,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.34144379650110596,"acs":3396,"articleLive":2,"columnArticles":88,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9946,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541837981998,"acs":11774,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":0.0,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":17998,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.7161290322580646,"acs":222,"articleLive":2,"columnArticles":16,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","submitted":310,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7099627560521415,"acs":1525,"articleLive":2,"columnArticles":30,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","submitted":2148,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6455157394575332,"acs":13042,"articleLive":2,"columnArticles":143,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":20204,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8098753280839895,"acs":9874,"articleLive":2,"columnArticles":136,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":12192,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5134648504775325,"acs":6559,"articleLive":2,"columnArticles":105,"formTitle":"[1792]最大平均通过率","frequency":0.0,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12774,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4134953629677007,"acs":3879,"articleLive":2,"columnArticles":93,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9381,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5763888888888888,"acs":166,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","submitted":288,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.787020905923345,"acs":1807,"articleLive":2,"columnArticles":28,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.0,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","submitted":2296,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48780305297815024,"acs":6519,"articleLive":2,"columnArticles":121,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":13364,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5725733488432209,"acs":4430,"articleLive":2,"columnArticles":71,"formTitle":"[1797]设计一个验证系统","frequency":0.0,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":7737,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5219470538001708,"acs":3056,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5855,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5186252771618626,"acs":2339,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.0,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4510,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6838017229204915,"acs":9684,"articleLive":2,"columnArticles":154,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":14162,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.3771460217832749,"acs":4086,"articleLive":2,"columnArticles":109,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10834,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.26257088846880905,"acs":4167,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":15870,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.4089060987415295,"acs":2112,"articleLive":2,"columnArticles":54,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5165,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5701530612244898,"acs":447,"articleLive":2,"columnArticles":26,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","submitted":784,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.48900478053020424,"acs":11252,"articleLive":2,"columnArticles":148,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":23010,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6623810748264335,"acs":5152,"articleLive":2,"columnArticles":81,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7778,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5857098733655925,"acs":5689,"articleLive":2,"columnArticles":87,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9713,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.26757619100011004,"acs":2432,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9089,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6247668780305856,"acs":1675,"articleLive":2,"columnArticles":31,"formTitle":"[1809]没有广告的剧集","frequency":0.0,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","submitted":2681,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6232876712328768,"acs":182,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","submitted":292,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.65982636148382,"acs":836,"articleLive":2,"columnArticles":27,"formTitle":"[1811]寻找面试候选人","frequency":0.0,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","submitted":1267,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7938154613466334,"acs":7958,"articleLive":2,"columnArticles":187,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":10025,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5137508443500917,"acs":5324,"articleLive":2,"columnArticles":72,"formTitle":"[1813]句子相似性 III","frequency":0.0,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10363,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.34352711284807036,"acs":3516,"articleLive":2,"columnArticles":79,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10235,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.3004720406681191,"acs":1655,"articleLive":2,"columnArticles":38,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5508,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7526457922779359,"acs":10312,"articleLive":2,"columnArticles":151,"formTitle":"[1816]截断句子","frequency":0.0,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":13701,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6977507029053421,"acs":5956,"articleLive":2,"columnArticles":96,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8536,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3739388732763516,"acs":25681,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":0.0,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":68677,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3671451355661882,"acs":2302,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6270,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5128205128205128,"acs":100,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","submitted":195,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9011235955056179,"acs":2406,"articleLive":2,"columnArticles":22,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","submitted":2670,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.810299098216836,"acs":19858,"articleLive":2,"columnArticles":197,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":24507,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7127310416306789,"acs":8252,"articleLive":2,"columnArticles":103,"formTitle":"[1823]找出游戏的获胜者","frequency":0.0,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":11578,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6569727891156463,"acs":7726,"articleLive":2,"columnArticles":153,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11760,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.28591595178629603,"acs":2633,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9209,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.43771626297577854,"acs":253,"articleLive":2,"columnArticles":20,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","submitted":578,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7946641663825434,"acs":9323,"articleLive":2,"columnArticles":138,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":11732,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8679181273323533,"acs":7675,"articleLive":2,"columnArticles":101,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8843,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6823671497584541,"acs":3955,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5796,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4863325740318907,"acs":854,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1756,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.739502999143102,"acs":863,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","submitted":1167,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8237610149365665,"acs":13181,"articleLive":2,"columnArticles":210,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":16001,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6846598949652505,"acs":43543,"articleLive":2,"columnArticles":389,"formTitle":"[1833]雪糕的最大数量","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":63598,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.35223632696642543,"acs":5938,"articleLive":2,"columnArticles":127,"formTitle":"[1834]单线程 CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":16858,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5094525959367946,"acs":3611,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.0,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7088,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7097345132743362,"acs":401,"articleLive":2,"columnArticles":27,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.0,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","submitted":565,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7963847911905256,"acs":7666,"articleLive":2,"columnArticles":86,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9626,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42938257253990253,"acs":28812,"articleLive":2,"columnArticles":307,"formTitle":"[1838]最高频元素的频数","frequency":0.0,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":67101,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5750932007811113,"acs":6479,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11266,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3892644135188867,"acs":1958,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5030,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5156794425087108,"acs":888,"articleLive":2,"columnArticles":28,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","submitted":1722,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6666666666666666,"acs":114,"articleLive":2,"columnArticles":11,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","submitted":171,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5041050903119869,"acs":614,"articleLive":2,"columnArticles":22,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","submitted":1218,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.7997876356772062,"acs":6779,"articleLive":2,"columnArticles":110,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":8476,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5384226916926185,"acs":6397,"articleLive":2,"columnArticles":61,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":11881,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.633653337016829,"acs":27524,"articleLive":2,"columnArticles":376,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":0.0,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43437,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3613354037267081,"acs":2327,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.0,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6440,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6825312416910396,"acs":7701,"articleLive":2,"columnArticles":99,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11283,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3284011508425812,"acs":5593,"articleLive":2,"columnArticles":108,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.0,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17031,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6080350244656194,"acs":2361,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.0,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3883,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40283687943262414,"acs":1988,"articleLive":2,"columnArticles":48,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4935,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7115384615384616,"acs":185,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","submitted":260,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6466117796073464,"acs":1021,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","submitted":1579,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7896061492415481,"acs":11608,"articleLive":2,"columnArticles":121,"formTitle":"[1854]人口最多的年份","frequency":0.0,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":14701,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6820228384991843,"acs":10452,"articleLive":2,"columnArticles":99,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15325,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35650350778163054,"acs":4421,"articleLive":2,"columnArticles":83,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.0,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12401,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.45102125885785743,"acs":2164,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4798,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.628131021194605,"acs":326,"articleLive":2,"columnArticles":19,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","submitted":519,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7677018633540372,"acs":6798,"articleLive":2,"columnArticles":145,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":8855,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7717202851088423,"acs":4006,"articleLive":2,"columnArticles":66,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5191,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6184603886397608,"acs":3310,"articleLive":2,"columnArticles":67,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5352,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3118957545187053,"acs":2226,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7137,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9078214311554881,"acs":12547,"articleLive":2,"columnArticles":142,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.0,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":13821,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.38738898756660745,"acs":4362,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.0,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11260,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5138035313627939,"acs":5267,"articleLive":2,"columnArticles":61,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10251,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5973009446693657,"acs":2213,"articleLive":2,"columnArticles":49,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":0.0,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3705,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7457886676875957,"acs":487,"articleLive":2,"columnArticles":14,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","submitted":653,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5407407407407407,"acs":146,"articleLive":2,"columnArticles":11,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"lock","submitted":270,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7891419656786272,"acs":12646,"articleLive":2,"columnArticles":139,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.0,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":16025,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.45664634146341465,"acs":7489,"articleLive":2,"columnArticles":70,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.0,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16400,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27612286562731997,"acs":5951,"articleLive":2,"columnArticles":126,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":21552,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6203389830508474,"acs":2013,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3245,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8100200400801604,"acs":2021,"articleLive":2,"columnArticles":32,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","submitted":2495,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8892307692307693,"acs":289,"articleLive":2,"columnArticles":18,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","submitted":325,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7471910112359551,"acs":399,"articleLive":2,"columnArticles":18,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","submitted":534,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7278063096111519,"acs":5952,"articleLive":2,"columnArticles":93,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":8178,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8205284337604575,"acs":30993,"articleLive":2,"columnArticles":400,"formTitle":"[1877]数组中最大数对和的最小值","frequency":0.0,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":37772,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.42860016090104586,"acs":2131,"articleLive":2,"columnArticles":55,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":4972,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.4125920964501005,"acs":1848,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4479,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7715512726510946,"acs":7366,"articleLive":2,"columnArticles":98,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":9547,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3532218164683708,"acs":5997,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":16978,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.27827415043909887,"acs":3644,"articleLive":2,"columnArticles":110,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13095,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.37491877842755034,"acs":1731,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4617,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6905730129390019,"acs":1868,"articleLive":2,"columnArticles":37,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":0.0,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":2705,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5198237885462555,"acs":236,"articleLive":2,"columnArticles":11,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"lock","submitted":454,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5714590899380474,"acs":5350,"articleLive":2,"columnArticles":77,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.0,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9362,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6453900709219859,"acs":5096,"articleLive":2,"columnArticles":64,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7896,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3166360294117647,"acs":2756,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8704,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.269880139193195,"acs":2094,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.0,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7759,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7051671732522796,"acs":928,"articleLive":2,"columnArticles":20,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","submitted":1316,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.47833935018050544,"acs":265,"articleLive":2,"columnArticles":10,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","submitted":554,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.33285714285714285,"acs":466,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","submitted":1400,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.591581492886966,"acs":31313,"articleLive":2,"columnArticles":409,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":0.0,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":52931,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.4583132231916342,"acs":37034,"articleLive":2,"columnArticles":513,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":80805,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5305909919291851,"acs":2038,"articleLive":2,"columnArticles":39,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3841,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5063063063063064,"acs":843,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1665,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5307842970280167,"acs":6233,"articleLive":2,"columnArticles":78,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.0,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11743,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.30948381185094687,"acs":4053,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13096,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6302047781569966,"acs":3693,"articleLive":2,"columnArticles":42,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5860,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.43472173608680437,"acs":1242,"articleLive":2,"columnArticles":34,"formTitle":"[1900]最佳运动员的比拼回合","frequency":0.0,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2857,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6586493987049029,"acs":712,"articleLive":2,"columnArticles":26,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":1081,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4418604651162791,"acs":76,"articleLive":2,"columnArticles":3,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"lock","submitted":172,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6428758626714423,"acs":7359,"articleLive":2,"columnArticles":101,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":11447,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2785714285714286,"acs":3393,"articleLive":2,"columnArticles":69,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":12180,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.57,"acs":4674,"articleLive":2,"columnArticles":93,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":8200,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.42403008032814904,"acs":2481,"articleLive":2,"columnArticles":56,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.0,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5851,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5941101152368758,"acs":464,"articleLive":2,"columnArticles":17,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","submitted":781,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6598360655737705,"acs":161,"articleLive":2,"columnArticles":7,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","submitted":244,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.3254706927175844,"acs":4581,"articleLive":2,"columnArticles":72,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.0,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":14075,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6741887355464379,"acs":3615,"articleLive":2,"columnArticles":56,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5362,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5708451704545454,"acs":3215,"articleLive":2,"columnArticles":69,"formTitle":"[1911]最大子序列交替和","frequency":0.0,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5632,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2727586802556573,"acs":1579,"articleLive":2,"columnArticles":38,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":5789,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8382872583662441,"acs":8066,"articleLive":2,"columnArticles":83,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.0,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":9622,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.44072657743785854,"acs":3227,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.0,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7322,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.39117241379310347,"acs":2836,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7250,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5511551155115512,"acs":1169,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2121,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.28369565217391307,"acs":261,"articleLive":2,"columnArticles":10,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"lock","submitted":920,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.4807692307692308,"acs":125,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","submitted":260,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.391578947368421,"acs":372,"articleLive":2,"columnArticles":12,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"lock","submitted":950,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9177921844048262,"acs":10193,"articleLive":2,"columnArticles":89,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":11106,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.3444402610441767,"acs":5489,"articleLive":2,"columnArticles":90,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.0,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":15936,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3609870740305523,"acs":4608,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.0,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12765,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23712497994545162,"acs":1478,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":0.0,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6233,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.3708609271523179,"acs":56,"articleLive":2,"columnArticles":4,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"lock","submitted":151,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6983793517406963,"acs":4654,"articleLive":2,"columnArticles":58,"formTitle":"[1925]统计平方和三元组的数目","frequency":0.0,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":6664,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3439127918194096,"acs":3565,"articleLive":2,"columnArticles":60,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10366,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4132797731568998,"acs":1749,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":0.0,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4232,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.39571045576407504,"acs":2214,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":0.0,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5595,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9158434795926181,"acs":11960,"articleLive":2,"columnArticles":106,"formTitle":"[1929]数组串联","frequency":0.0,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":13059,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.47876144788486696,"acs":5489,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.0,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11465,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5601545253863135,"acs":2030,"articleLive":2,"columnArticles":63,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.0,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3624,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.32753357753357754,"acs":1073,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.0,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3276,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5443037974683544,"acs":430,"articleLive":2,"columnArticles":24,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"lock","submitted":790,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7479224376731302,"acs":270,"articleLive":2,"columnArticles":10,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","submitted":361,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7393238434163701,"acs":6648,"articleLive":2,"columnArticles":93,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":8992,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.44997182645093775,"acs":5590,"articleLive":2,"columnArticles":63,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12423,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.24200278164116829,"acs":3132,"articleLive":2,"columnArticles":63,"formTitle":"[1937]扣分后的最大得分","frequency":0.0,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":12942,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.34322422759253596,"acs":1122,"articleLive":2,"columnArticles":41,"formTitle":"[1938]查询最大基因差","frequency":0.0,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3269,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6253776435045317,"acs":414,"articleLive":2,"columnArticles":13,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"lock","submitted":662,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.8008658008658008,"acs":370,"articleLive":2,"columnArticles":24,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"lock","submitted":462,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7714898531595447,"acs":4676,"articleLive":2,"columnArticles":83,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":6061,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.39148408433236875,"acs":2841,"articleLive":2,"columnArticles":68,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7257,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.40722996515679444,"acs":1870,"articleLive":2,"columnArticles":51,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4592,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.57592867756315,"acs":1938,"articleLive":2,"columnArticles":51,"formTitle":"[1944]队列中可以看到的人数","frequency":0.0,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3365,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6638646847770374,"acs":6476,"articleLive":2,"columnArticles":73,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.0,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":9755,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.3036534926470588,"acs":5286,"articleLive":2,"columnArticles":80,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.0,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17408,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5411061285500748,"acs":3982,"articleLive":2,"columnArticles":89,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7359,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5167567567567568,"acs":956,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.0,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1850,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.537712895377129,"acs":221,"articleLive":2,"columnArticles":12,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","submitted":411,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5418502202643172,"acs":123,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"lock","submitted":227,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6810551558752997,"acs":284,"articleLive":2,"columnArticles":12,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"lock","submitted":417,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5450992902145306,"acs":6835,"articleLive":2,"columnArticles":79,"formTitle":"[1952]三除数","frequency":0.0,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":12539,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3251212564477635,"acs":4223,"articleLive":2,"columnArticles":83,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":12989,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.48140785781103834,"acs":4117,"articleLive":2,"columnArticles":68,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8552,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49530561410231844,"acs":2585,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5219,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.44155844155844154,"acs":136,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":0.0,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"lock","submitted":308,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6044714325144908,"acs":4380,"articleLive":2,"columnArticles":58,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":7246,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.4232740943267259,"acs":2477,"articleLive":2,"columnArticles":43,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5852,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.4120988355580801,"acs":1451,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3521,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.275,"acs":605,"articleLive":2,"columnArticles":19,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2200,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5357783847054234,"acs":6866,"articleLive":2,"columnArticles":63,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.0,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":12815,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.42958184361884033,"acs":5527,"articleLive":2,"columnArticles":74,"formTitle":"[1962]移除石子使总数最小","frequency":0.0,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":12866,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6151134921753841,"acs":4363,"articleLive":2,"columnArticles":54,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.0,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7093,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3830784410458806,"acs":3106,"articleLive":2,"columnArticles":47,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8108,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7298474945533769,"acs":335,"articleLive":2,"columnArticles":12,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"lock","submitted":459,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7272727272727273,"acs":40,"articleLive":2,"columnArticles":6,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"lock","submitted":55,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7773295158771473,"acs":5973,"articleLive":2,"columnArticles":56,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":7684,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3574804369721856,"acs":4614,"articleLive":2,"columnArticles":67,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":12907,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.2789980732177264,"acs":2896,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":0.0,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10380,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4794611307420495,"acs":2171,"articleLive":2,"columnArticles":49,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":0.0,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4528,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5582278481012658,"acs":441,"articleLive":2,"columnArticles":18,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":790,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4464751958224543,"acs":171,"articleLive":2,"columnArticles":7,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.0,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"lock","submitted":383,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5517241379310345,"acs":64,"articleLive":2,"columnArticles":9,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"lock","submitted":116,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7430005792624059,"acs":3848,"articleLive":2,"columnArticles":54,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.0,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":5179,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.38044491807646197,"acs":2856,"articleLive":2,"columnArticles":45,"formTitle":"[1975]最大方阵和","frequency":0.0,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":7507,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.28722453841572365,"acs":1929,"articleLive":2,"columnArticles":37,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":6716,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.24652895360650187,"acs":728,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":2953,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5341176470588235,"acs":227,"articleLive":2,"columnArticles":10,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"lock","submitted":425,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.816017316017316,"acs":7163,"articleLive":2,"columnArticles":78,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":8778,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5806777946383409,"acs":5740,"articleLive":2,"columnArticles":91,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":9885,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.2989884102632813,"acs":4463,"articleLive":2,"columnArticles":82,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":0.0,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":14927,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.45495495495495497,"acs":808,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1776,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6571428571428571,"acs":46,"articleLive":2,"columnArticles":3,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"lock","submitted":70,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5797888695295685,"acs":5657,"articleLive":2,"columnArticles":63,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":9757,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.41186124580380457,"acs":5521,"articleLive":2,"columnArticles":79,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":13405,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2748091603053435,"acs":3528,"articleLive":2,"columnArticles":74,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.0,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":12838,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.45941505093657575,"acs":1398,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3043,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6574074074074074,"acs":142,"articleLive":2,"columnArticles":5,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":0.0,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"lock","submitted":216,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.43023255813953487,"acs":37,"articleLive":2,"columnArticles":2,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"lock","submitted":86,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.5961538461538461,"acs":155,"articleLive":2,"columnArticles":8,"formTitle":"[1990]Count the Number of Experiments","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"lock","submitted":260,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6616949152542373,"acs":3904,"articleLive":2,"columnArticles":55,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":5900,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5947847682119205,"acs":2874,"articleLive":2,"columnArticles":55,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":4832,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.38210320052253427,"acs":1755,"articleLive":2,"columnArticles":41,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4593,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.3634686346863469,"acs":1182,"articleLive":2,"columnArticles":35,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3252,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5502416431735804,"acs":5465,"articleLive":2,"columnArticles":45,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":9932,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.24607082984073764,"acs":4697,"articleLive":2,"columnArticles":95,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":19088,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.34197838736492103,"acs":2057,"articleLive":2,"columnArticles":36,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.0,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6015,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.41839684625492773,"acs":1592,"articleLive":2,"columnArticles":32,"formTitle":"[1998]数组的最大公因数排序","frequency":0.0,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3805,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6506024096385542,"acs":54,"articleLive":2,"columnArticles":5,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"lock","submitted":83,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7802424242424243,"acs":6437,"articleLive":2,"columnArticles":81,"formTitle":"[2000]反转单词前缀","frequency":0.0,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":8250,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.3572436802258437,"acs":5568,"articleLive":2,"columnArticles":121,"formTitle":"[2001]可互换矩形的组数","frequency":0.0,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":15586,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5710727333111923,"acs":3439,"articleLive":2,"columnArticles":86,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6022,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.39221556886227543,"acs":1834,"articleLive":2,"columnArticles":39,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4676,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.41358024691358025,"acs":67,"articleLive":2,"columnArticles":3,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"lock","submitted":162,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6842105263157895,"acs":26,"articleLive":2,"columnArticles":3,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"lock","submitted":38,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8866982124079916,"acs":3373,"articleLive":2,"columnArticles":46,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":3804,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.2937335319051438,"acs":2564,"articleLive":2,"columnArticles":48,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.0,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":8729,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.4187192118226601,"acs":1955,"articleLive":2,"columnArticles":38,"formTitle":"[2008]出租车的最大盈利","frequency":0.0,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":4669,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.41902228134353176,"acs":1260,"articleLive":2,"columnArticles":39,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3007,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6153846153846154,"acs":40,"articleLive":2,"columnArticles":2,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"lock","submitted":65,"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.9050929424210368,"acs":5989,"articleLive":2,"columnArticles":51,"formTitle":"[2011]执行操作后的变量值","frequency":0.0,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":6617,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.35358969835949905,"acs":4009,"articleLive":2,"columnArticles":73,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":11338,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.32545099951243295,"acs":2670,"articleLive":2,"columnArticles":50,"formTitle":"[2013]检测正方形","frequency":0.0,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8204,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5189873417721519,"acs":1353,"articleLive":2,"columnArticles":24,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2607,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.8484848484848485,"acs":28,"articleLive":2,"columnArticles":2,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"lock","submitted":33,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5507549361207897,"acs":4742,"articleLive":2,"columnArticles":62,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.0,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":8610,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.3416519434628975,"acs":3094,"articleLive":2,"columnArticles":85,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":9056,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.4100548010483679,"acs":1721,"articleLive":2,"columnArticles":45,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.0,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":4197,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.32919020715630887,"acs":874,"articleLive":2,"columnArticles":29,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.0,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":2655,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.8387096774193549,"acs":52,"articleLive":2,"columnArticles":3,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"lock","submitted":62,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.8275862068965517,"acs":24,"articleLive":2,"columnArticles":4,"formTitle":"[2021]Brightest Position on Street","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"lock","submitted":29,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.6566799143992663,"acs":2148,"articleLive":2,"columnArticles":24,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":3271,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7531806615776081,"acs":2072,"articleLive":2,"columnArticles":25,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":2751,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.45602512849800114,"acs":1597,"articleLive":2,"columnArticles":44,"formTitle":"[2024]考试的最大困扰度","frequency":0.0,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":3502,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.22294802612894063,"acs":785,"articleLive":2,"columnArticles":32,"formTitle":"[2025]分割数组的最多方案数","frequency":0.0,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":3521,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.9583333333333334,"acs":23,"articleLive":2,"columnArticles":4,"formTitle":"[2026]Low-Quality Problems","frequency":0.0,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":24,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.527802294792586,"acs":2990,"articleLive":2,"columnArticles":31,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":5665,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.4100687838431143,"acs":2802,"articleLive":2,"columnArticles":37,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":6833,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.19054300547214817,"acs":1358,"articleLive":2,"columnArticles":58,"formTitle":"[2029]石子游戏 IX","frequency":0.0,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":7127,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.3088305489260143,"acs":647,"articleLive":2,"columnArticles":21,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.0,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":2095,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.8451381428675727,"acs":81031,"articleLive":2,"columnArticles":625,"formTitle":"[LCP 01]猜数字","frequency":0.0,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":95879,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6909515825839557,"acs":13600,"articleLive":2,"columnArticles":234,"formTitle":"[LCP 02]分式化简","frequency":0.0,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":19683,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21905759576234335,"acs":11083,"articleLive":2,"columnArticles":182,"formTitle":"[LCP 03]机器人大冒险","frequency":0.0,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":50594,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.37719555035128804,"acs":2577,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6832,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19964836882203554,"acs":2044,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10238,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8398749565821466,"acs":43524,"articleLive":2,"columnArticles":656,"formTitle":"[LCP 06]拿硬币","frequency":0.0,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":51822,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7695930968967701,"acs":38886,"articleLive":2,"columnArticles":468,"formTitle":"[LCP 07]传递信息","frequency":0.0,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":50528,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2874992868146289,"acs":5039,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17527,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.27367181256046774,"acs":6506,"articleLive":2,"columnArticles":104,"formTitle":"[LCP 09]最小跳跃次数","frequency":0.0,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":23773,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5884096147513994,"acs":1787,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.0,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3037,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6889716240692292,"acs":6847,"articleLive":2,"columnArticles":67,"formTitle":"[LCP 11]期望个数统计","frequency":0.0,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":9938,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4104038772213247,"acs":6351,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 12]小张刷题计划","frequency":0.0,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":15475,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6125389408099688,"acs":9438,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15408,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21057118499573743,"acs":2717,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":0.0,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12903,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5753887762001352,"acs":851,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.0,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1479,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.3105749486652977,"acs":605,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1948,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7988804071246819,"acs":23547,"articleLive":2,"columnArticles":248,"formTitle":"[LCP 17]速算机器人","frequency":0.0,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":29475,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2863538357720098,"acs":17398,"articleLive":2,"columnArticles":225,"formTitle":"[LCP 18]早餐组合","frequency":0.0,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":60757,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5163197729422895,"acs":19647,"articleLive":2,"columnArticles":204,"formTitle":"[LCP 19]秋叶收藏集","frequency":0.0,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38052,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.31161971830985913,"acs":1770,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5680,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.33458333333333334,"acs":803,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2400,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3333084642071101,"acs":8935,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26807,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3413833836461478,"acs":2601,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7619,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2811045609680422,"acs":906,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3223,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.3315170633782621,"acs":1156,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3487,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.33292831105710813,"acs":548,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1646,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.328397673188789,"acs":1242,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3782,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.2811923786109404,"acs":10065,"articleLive":2,"columnArticles":171,"formTitle":"[LCP 28]采购方案","frequency":0.0,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":35794,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.18653924510130757,"acs":5036,"articleLive":2,"columnArticles":122,"formTitle":"[LCP 29]乐团站位","frequency":0.0,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":26997,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3483632258873699,"acs":5555,"articleLive":2,"columnArticles":96,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":15946,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.25195226167673496,"acs":1710,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6787,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.40552099533437014,"acs":1043,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":0.0,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2572,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.21608939628482973,"acs":4467,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 33]蓄水","frequency":0.0,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":20672,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.48025210084033615,"acs":2286,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 34]二叉树染色","frequency":0.0,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4760,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.39631816602987147,"acs":1141,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 35]电动车游城市","frequency":0.0,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2879,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.26058743169398907,"acs":763,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":0.0,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":2928,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19312436804853386,"acs":764,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 37]最小矩形面积","frequency":0.0,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":3956,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5637910085054678,"acs":464,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":823,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5014949714596357,"acs":3690,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7358,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.2286026568017488,"acs":2719,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":11894,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.413691451031772,"acs":1263,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3053,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.19866115377042726,"acs":1009,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5079,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.39525283797729616,"acs":383,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":969,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8589688964635706,"acs":2016,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":2347,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.18283719220874678,"acs":995,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5442,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.3646384479717813,"acs":827,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2268,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.35067347886669764,"acs":755,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2153,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.1494318181818182,"acs":263,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 48]无限棋局","frequency":0.0,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":1760,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.21791559000861327,"acs":253,"articleLive":2,"columnArticles":8,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1161,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5432795698924732,"acs":4042,"articleLive":2,"columnArticles":94,"formTitle":"[LCS 01]下载插件","frequency":0.0,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":7440,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6968998743192292,"acs":3327,"articleLive":2,"columnArticles":67,"formTitle":"[LCS 02]完成一半题目","frequency":0.0,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":4774,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4150099403578529,"acs":1670,"articleLive":2,"columnArticles":54,"formTitle":"[LCS 03]主题空间","frequency":0.0,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4024,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6781733158916278,"acs":398673,"articleLive":2,"columnArticles":2781,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":587863,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.40312032478940213,"acs":259753,"articleLive":2,"columnArticles":2075,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":0.0,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":644356,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7607290821395765,"acs":284057,"articleLive":2,"columnArticles":1931,"formTitle":"[剑指 Offer 05]替换空格","frequency":0.0,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":373401,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7515142565375836,"acs":300257,"articleLive":2,"columnArticles":2075,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":399536,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6975703301137647,"acs":188427,"articleLive":2,"columnArticles":1446,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":270119,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7158632802316168,"acs":260857,"articleLive":2,"columnArticles":1654,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":0.0,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":364395,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.35989587487383146,"acs":261717,"articleLive":2,"columnArticles":1855,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":727202,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.443554135936172,"acs":194133,"articleLive":2,"columnArticles":1308,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":437676,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.4929320859058369,"acs":260278,"articleLive":2,"columnArticles":1625,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":528020,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.4520694116548624,"acs":169465,"articleLive":2,"columnArticles":1131,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":374865,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5263573898594333,"acs":175806,"articleLive":2,"columnArticles":1705,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":0.0,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":334005,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5691154998568887,"acs":157081,"articleLive":2,"columnArticles":1303,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":276009,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3118237498307023,"acs":82884,"articleLive":2,"columnArticles":487,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":265804,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7470675231719295,"acs":198519,"articleLive":2,"columnArticles":1249,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":265731,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.33957133893286073,"acs":123388,"articleLive":2,"columnArticles":757,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":0.0,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":363364,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7772051649332586,"acs":149755,"articleLive":2,"columnArticles":1118,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":192684,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.596440093447547,"acs":187649,"articleLive":2,"columnArticles":1451,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":314615,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3763167453686887,"acs":66304,"articleLive":2,"columnArticles":443,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":0.0,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":176192,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24153860747486244,"acs":76389,"articleLive":2,"columnArticles":852,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":316260,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6429866595428514,"acs":192552,"articleLive":2,"columnArticles":1624,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":0.0,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":299465,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7978433594697772,"acs":259777,"articleLive":2,"columnArticles":2436,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":325599,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7428243016302122,"acs":290165,"articleLive":2,"columnArticles":1820,"formTitle":"[剑指 Offer 24]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":390624,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.728651135900147,"acs":184007,"articleLive":2,"columnArticles":1182,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":252531,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.46540219245766185,"acs":144304,"articleLive":2,"columnArticles":1180,"formTitle":"[剑指 Offer 26]树的子结构","frequency":0.0,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":310063,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7916512452852158,"acs":190366,"articleLive":2,"columnArticles":1398,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":0.0,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":240467,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5800526775138707,"acs":148874,"articleLive":2,"columnArticles":1083,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":256656,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.44020871046746884,"acs":144690,"articleLive":2,"columnArticles":1480,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":0.0,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":328685,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.569419072723186,"acs":139334,"articleLive":2,"columnArticles":929,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":0.0,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":244695,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6153019663306308,"acs":112244,"articleLive":2,"columnArticles":945,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":182421,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6444145560628162,"acs":136072,"articleLive":2,"columnArticles":950,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":211156,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6862656072644722,"acs":136035,"articleLive":2,"columnArticles":1090,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":198225,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5887341665552072,"acs":118846,"articleLive":2,"columnArticles":1133,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":201867,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.551144835975514,"acs":112363,"articleLive":2,"columnArticles":948,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":203872,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5764536970567121,"acs":132495,"articleLive":2,"columnArticles":866,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":229845,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7201930039124059,"acs":118363,"articleLive":2,"columnArticles":822,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":0.0,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":164349,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6544930868299215,"acs":103620,"articleLive":2,"columnArticles":894,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":158321,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.561001924534904,"acs":76956,"articleLive":2,"columnArticles":559,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":137176,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5792512510448388,"acs":157309,"articleLive":2,"columnArticles":1114,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":0.0,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":271573,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6907920808427727,"acs":167343,"articleLive":2,"columnArticles":1022,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":242248,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5699883424222268,"acs":245938,"articleLive":2,"columnArticles":1809,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":431479,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5812169778908565,"acs":62593,"articleLive":2,"columnArticles":457,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":107693,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.605388546933392,"acs":220313,"articleLive":2,"columnArticles":1517,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":0.0,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":363920,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4852422296225817,"acs":48959,"articleLive":2,"columnArticles":507,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":100896,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41462865040259583,"acs":55202,"articleLive":2,"columnArticles":460,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":133136,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5612204560585885,"acs":107898,"articleLive":2,"columnArticles":805,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":0.0,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":192256,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5360821482137371,"acs":118665,"articleLive":2,"columnArticles":1432,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":221356,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6887514034431138,"acs":117782,"articleLive":2,"columnArticles":986,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":0.0,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":171008,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46444051716119433,"acs":149796,"articleLive":2,"columnArticles":1029,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":322530,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6513863326453209,"acs":87418,"articleLive":2,"columnArticles":516,"formTitle":"[剑指 Offer 49]丑数","frequency":0.0,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":134203,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6145324090964368,"acs":151599,"articleLive":2,"columnArticles":1049,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":0.0,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":246690,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4825751973856833,"acs":101155,"articleLive":2,"columnArticles":843,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":0.0,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":209615,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6494541758073377,"acs":173779,"articleLive":2,"columnArticles":1043,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":267577,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5380073990633952,"acs":188181,"articleLive":2,"columnArticles":1577,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":349774,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.447210095057852,"acs":166355,"articleLive":2,"columnArticles":1462,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":371984,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7563138009527609,"acs":161144,"articleLive":2,"columnArticles":1141,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":213065,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.789802746656381,"acs":176096,"articleLive":2,"columnArticles":1268,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":222962,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.587776557758315,"acs":135968,"articleLive":2,"columnArticles":938,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":231326,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6993827877927782,"acs":114333,"articleLive":2,"columnArticles":1024,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":163477,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.8002056969100747,"acs":89475,"articleLive":2,"columnArticles":692,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":111815,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6657149869519702,"acs":132908,"articleLive":2,"columnArticles":834,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":199647,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7072275983282411,"acs":138420,"articleLive":2,"columnArticles":1856,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":195722,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4418064099081597,"acs":128491,"articleLive":2,"columnArticles":971,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":290831,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8575737378509719,"acs":203293,"articleLive":2,"columnArticles":1778,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":237056,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44420216891404624,"acs":130583,"articleLive":2,"columnArticles":1184,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":293972,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.47516851203368216,"acs":93899,"articleLive":2,"columnArticles":1065,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":197612,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5613430833802086,"acs":64866,"articleLive":2,"columnArticles":586,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":0.0,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":115555,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.45956661641277197,"acs":102118,"articleLive":2,"columnArticles":975,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":0.0,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":222205,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6555026791172698,"acs":109368,"articleLive":2,"columnArticles":763,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":166846,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6337722414697133,"acs":129332,"articleLive":2,"columnArticles":942,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":0.0,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":204067,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8568923733961212,"acs":136838,"articleLive":2,"columnArticles":1292,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":0.0,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":159691,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5836223871866065,"acs":70836,"articleLive":2,"columnArticles":491,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":0.0,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":121373,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5977321635490813,"acs":72218,"articleLive":2,"columnArticles":522,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":0.0,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":120820,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.2865013309970684,"acs":68020,"articleLive":2,"columnArticles":554,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":0.0,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":237416,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.693614472833789,"acs":116976,"articleLive":2,"columnArticles":686,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":168647,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7003860585291231,"acs":116290,"articleLive":2,"columnArticles":682,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":166037,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.2025639661684132,"acs":7616,"articleLive":2,"columnArticles":101,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":37598,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5766399476525438,"acs":7050,"articleLive":2,"columnArticles":118,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":12226,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7820375335120644,"acs":8751,"articleLive":2,"columnArticles":135,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":11190,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6833954688844279,"acs":7149,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":10461,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7098638052001651,"acs":5160,"articleLive":2,"columnArticles":79,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":7269,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6624605678233438,"acs":6300,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":9510,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.45467638088783463,"acs":5367,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":11804,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5055597436863928,"acs":5365,"articleLive":2,"columnArticles":84,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":10612,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.542675318193162,"acs":4349,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":8014,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.43730308758664144,"acs":4858,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":11109,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5657681065280935,"acs":3484,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":6158,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6617487187451467,"acs":4261,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.0,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":6439,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6597268860532796,"acs":2947,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":4467,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5039487408731933,"acs":3382,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":6711,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6398126463700234,"acs":2732,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":4270,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.49457419202642133,"acs":4193,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":8478,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.525478441318884,"acs":2279,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":4337,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5313886275036968,"acs":3953,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":7439,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4702787258248009,"acs":3307,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":7032,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.6993006993006993,"acs":3300,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":4719,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5341114058355437,"acs":5034,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":9425,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5185738122420304,"acs":5905,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":11387,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7036661598242946,"acs":4165,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":5919,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7694291489510002,"acs":11039,"articleLive":2,"columnArticles":114,"formTitle":"[剑指 Offer II 024]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":14347,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6025486481832272,"acs":3499,"articleLive":2,"columnArticles":63,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":0.0,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":5807,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6454816285998014,"acs":3900,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":6042,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6032921810699589,"acs":5864,"articleLive":2,"columnArticles":82,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":9720,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6189345096708517,"acs":1824,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":2947,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.29009433962264153,"acs":1968,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":6784,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5422776911076443,"acs":1738,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":3205,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5613768666160466,"acs":2218,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":3951,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.6018177883574983,"acs":2781,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":4621,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7954711468224982,"acs":2178,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":2738,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5782493368700266,"acs":1962,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":3393,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6833000665335994,"acs":2054,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":3006,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5832049306625577,"acs":2271,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":3894,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4410092395167022,"acs":2482,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":5628,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7735751295336788,"acs":2986,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":3860,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5108317732013907,"acs":1910,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":3739,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.571301247771836,"acs":1282,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.0,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":2244,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.78307962529274,"acs":2675,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":3416,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8485768500948767,"acs":2236,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":2635,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6494944631680308,"acs":1349,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":2077,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6437327995996998,"acs":2573,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":3997,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8081044876088412,"acs":2413,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":2986,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7209876543209877,"acs":2336,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":3240,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6827309236947792,"acs":2210,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":3237,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6622073578595318,"acs":1386,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":2093,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7444129682090022,"acs":2365,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":3177,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6148343373493976,"acs":1633,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":2656,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.4147275405007364,"acs":1408,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":3395,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7330459770114942,"acs":2551,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":3480,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6267813928475396,"acs":2331,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":3719,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.841133533705453,"acs":1959,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":2329,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8963133640552995,"acs":1556,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":1736,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7264697764283743,"acs":2632,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":3623,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.35634197617379115,"acs":1017,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":2854,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5899408284023668,"acs":997,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":1690,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6218424962852898,"acs":1674,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":2692,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6813228109733183,"acs":1813,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":2661,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.535029004908523,"acs":1199,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":2241,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7550052687038988,"acs":1433,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":1898,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7202572347266881,"acs":1120,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":1555,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.627177700348432,"acs":900,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":1435,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6370597243491577,"acs":832,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":1306,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6470160116448326,"acs":889,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":1374,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6517128874388255,"acs":799,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":1226,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5089567966280295,"acs":2415,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":4745,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7251515151515151,"acs":2393,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"","submitted":3300,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6715809284818067,"acs":2141,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":3188,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5047114252061249,"acs":857,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":1698,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4208865299096256,"acs":2934,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":6971,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5416498993963783,"acs":1346,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":2485,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5432573468827245,"acs":1978,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.0,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":3641,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7109483960948396,"acs":2039,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":2868,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6738166991668144,"acs":3801,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":5641,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5840509817430245,"acs":3391,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":5806,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6284556720686368,"acs":2637,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":4196,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8524477918521054,"acs":2490,"articleLive":2,"columnArticles":63,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":2921,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.7995584988962472,"acs":1811,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":2265,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7813235678786293,"acs":2987,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":3823,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6385577202675197,"acs":2196,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":3439,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8546255506607929,"acs":2716,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":3178,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6738384783286561,"acs":2161,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":3207,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8602116062840655,"acs":2683,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.0,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":3119,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7607843137254902,"acs":1746,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":2295,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6364927227547036,"acs":1793,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":2817,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7373082739252539,"acs":3413,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":4629,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6262657256827248,"acs":2041,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":3259,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5221162185602776,"acs":1204,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":2306,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7599067599067599,"acs":1630,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.0,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":2145,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6695278969957081,"acs":1248,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":1864,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5662217659137577,"acs":1103,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":1948,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5810635538261998,"acs":896,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":1542,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6622881912518062,"acs":5042,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":7613,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.48537095088819227,"acs":929,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":1914,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5396383866481224,"acs":776,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":1438,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7686532144533083,"acs":1638,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":2131,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.688982287601321,"acs":2295,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":3331,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7381837493361657,"acs":1390,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":1883,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.47179898422881583,"acs":1765,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":3741,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5896780786918753,"acs":1154,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":1957,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.4972326765552358,"acs":2246,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":4517,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.580373269114991,"acs":964,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":1661,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6919291338582677,"acs":2812,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":4064,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5514603616133519,"acs":793,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":1438,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5425181278839816,"acs":823,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":1517,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.560145808019441,"acs":461,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":823,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.6140468227424749,"acs":918,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":1495,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8343828715365239,"acs":1325,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":1588,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6887519260400616,"acs":447,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":649,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5625774473358116,"acs":908,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":1614,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5863552550706822,"acs":954,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":1627,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.4206268958543984,"acs":416,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":989,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.28343949044585987,"acs":534,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":1884,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6333210059171598,"acs":3425,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 116]朋友圈","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":5408,"title":"朋友圈","titleSlug":"bLyHh0"},{"acceptance":0.6404066073697586,"acs":504,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":787,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6931702344546381,"acs":680,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":981,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.4532322137955941,"acs":2510,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":5538,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7198756449696437,"acs":88454,"articleLive":2,"columnArticles":1521,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":0.0,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":122874,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6481829681036546,"acs":56880,"articleLive":2,"columnArticles":1097,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":0.0,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":87753,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5791396049992695,"acs":43604,"articleLive":2,"columnArticles":479,"formTitle":"[面试题 01.03]URL化","frequency":0.0,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":75291,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5508786945897814,"acs":39904,"articleLive":2,"columnArticles":767,"formTitle":"[面试题 01.04]回文排列","frequency":0.0,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":72437,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.33236702929044193,"acs":31988,"articleLive":2,"columnArticles":549,"formTitle":"[面试题 01.05]一次编辑","frequency":0.0,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":96243,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4719244379683597,"acs":72548,"articleLive":2,"columnArticles":1162,"formTitle":"[面试题 01.06]字符串压缩","frequency":0.0,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":153728,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7537569298357759,"acs":64854,"articleLive":2,"columnArticles":955,"formTitle":"[面试题 01.07]旋转矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":86041,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6211576500483678,"acs":43022,"articleLive":2,"columnArticles":481,"formTitle":"[面试题 01.08]零矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":69261,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5502316032373551,"acs":32429,"articleLive":2,"columnArticles":409,"formTitle":"[面试题 01.09]字符串轮转","frequency":0.0,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":58937,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6829247078010329,"acs":62812,"articleLive":2,"columnArticles":682,"formTitle":"[面试题 02.01]移除重复节点","frequency":0.0,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":91975,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7799604466632901,"acs":64679,"articleLive":2,"columnArticles":941,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":0.0,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":82926,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8544531034234321,"acs":71158,"articleLive":2,"columnArticles":678,"formTitle":"[面试题 02.03]删除中间节点","frequency":0.0,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":83279,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6549502357255107,"acs":25006,"articleLive":2,"columnArticles":357,"formTitle":"[面试题 02.04]分割链表","frequency":0.0,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":38180,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46666325734814684,"acs":36501,"articleLive":2,"columnArticles":517,"formTitle":"[面试题 02.05]链表求和","frequency":0.0,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":78217,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.483421725837649,"acs":38739,"articleLive":2,"columnArticles":500,"formTitle":"[面试题 02.06]回文链表","frequency":0.0,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":80135,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6848735819894433,"acs":46970,"articleLive":2,"columnArticles":417,"formTitle":"[面试题 02.07]链表相交","frequency":0.0,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":68582,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5317949829546574,"acs":26987,"articleLive":2,"columnArticles":279,"formTitle":"[面试题 02.08]环路检测","frequency":0.0,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":50747,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5381141439205955,"acs":10843,"articleLive":2,"columnArticles":175,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":20150,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6134502083632706,"acs":25614,"articleLive":2,"columnArticles":290,"formTitle":"[面试题 03.02]栈的最小值","frequency":0.0,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":41754,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.38651029155480193,"acs":8206,"articleLive":2,"columnArticles":122,"formTitle":"[面试题 03.03]堆盘子","frequency":0.0,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":21231,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7127675958724781,"acs":23140,"articleLive":2,"columnArticles":338,"formTitle":"[面试题 03.04]化栈为队","frequency":0.0,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":32465,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5432525951557093,"acs":14287,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 03.05]栈排序","frequency":0.0,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":26299,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5875936535918908,"acs":10666,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 03.06]动物收容所","frequency":0.0,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":18152,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5319688406903925,"acs":17414,"articleLive":2,"columnArticles":241,"formTitle":"[面试题 04.01]节点间通路","frequency":0.0,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":32735,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7900851161720727,"acs":34345,"articleLive":2,"columnArticles":416,"formTitle":"[面试题 04.02]最小高度树","frequency":0.0,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":43470,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.805893896332386,"acs":23819,"articleLive":2,"columnArticles":518,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":0.0,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":29556,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5843284511754552,"acs":32834,"articleLive":2,"columnArticles":381,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":56191,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35172490664883244,"acs":25244,"articleLive":2,"columnArticles":319,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":0.0,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":71772,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5903392549462302,"acs":19872,"articleLive":2,"columnArticles":240,"formTitle":"[面试题 04.06]后继者","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":33662,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7169745707454901,"acs":16494,"articleLive":2,"columnArticles":174,"formTitle":"[面试题 04.08]首个共同祖先","frequency":0.0,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":23005,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47612511738784946,"acs":6591,"articleLive":2,"columnArticles":109,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.0,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":13843,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7171510073096808,"acs":16090,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 04.10]检查子树","frequency":0.0,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":22436,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.486511419865254,"acs":17403,"articleLive":2,"columnArticles":256,"formTitle":"[面试题 04.12]求和路径","frequency":0.0,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":35771,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5051764323269554,"acs":9320,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":18449,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6892405063291139,"acs":7623,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.0,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11060,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.38716685979142523,"acs":10692,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 05.03]翻转数位","frequency":0.0,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":27616,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3874907475943745,"acs":5235,"articleLive":2,"columnArticles":136,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":13510,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5277586760188878,"acs":11512,"articleLive":2,"columnArticles":225,"formTitle":"[面试题 05.06]整数转换","frequency":0.0,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":21813,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7033021806853582,"acs":11288,"articleLive":2,"columnArticles":202,"formTitle":"[面试题 05.07]配对交换","frequency":0.0,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":16050,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5529859021067638,"acs":3491,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 05.08]绘制直线","frequency":0.0,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6313,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.3631618131562508,"acs":42438,"articleLive":2,"columnArticles":469,"formTitle":"[面试题 08.01]三步问题","frequency":0.0,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":116857,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36132952108649036,"acs":12132,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":33576,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6758718842623421,"acs":51763,"articleLive":2,"columnArticles":432,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":76587,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8199786113201568,"acs":20702,"articleLive":2,"columnArticles":322,"formTitle":"[面试题 08.04]幂集","frequency":0.0,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":25247,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6802480916030534,"acs":21387,"articleLive":2,"columnArticles":472,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":31440,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6561598224195339,"acs":23648,"articleLive":2,"columnArticles":265,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":0.0,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":36040,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8131157518353684,"acs":21376,"articleLive":2,"columnArticles":312,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":26289,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7185513219625553,"acs":16388,"articleLive":2,"columnArticles":235,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":22807,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8130111803106476,"acs":21670,"articleLive":2,"columnArticles":343,"formTitle":"[面试题 08.09]括号","frequency":0.0,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":26654,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5589895743190341,"acs":13565,"articleLive":2,"columnArticles":215,"formTitle":"[面试题 08.10]颜色填充","frequency":0.0,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":24267,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4948202759605438,"acs":33961,"articleLive":2,"columnArticles":324,"formTitle":"[面试题 08.11]硬币","frequency":0.0,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":68633,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7606590481435587,"acs":16574,"articleLive":2,"columnArticles":295,"formTitle":"[面试题 08.12]八皇后","frequency":0.0,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":21789,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5012940915477335,"acs":6779,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 08.13]堆箱子","frequency":0.0,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":13523,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5342801807617817,"acs":4138,"articleLive":2,"columnArticles":74,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7745,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5549114173228347,"acs":56379,"articleLive":2,"columnArticles":2372,"formTitle":"[面试题 10.01]合并排序的数组","frequency":0.0,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":101600,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7396123069023065,"acs":34568,"articleLive":2,"columnArticles":427,"formTitle":"[面试题 10.02]变位词组","frequency":0.0,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46738,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3953905016397425,"acs":13021,"articleLive":2,"columnArticles":207,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":0.0,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":32932,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5529553817847286,"acs":19234,"articleLive":2,"columnArticles":253,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.0,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":34784,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4553615607549304,"acs":12884,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":0.0,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":28294,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6271748135874068,"acs":4542,"articleLive":2,"columnArticles":83,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7242,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6669000525118152,"acs":7620,"articleLive":2,"columnArticles":94,"formTitle":"[面试题 10.11]峰与谷","frequency":0.0,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":11426,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8321516900247321,"acs":25235,"articleLive":2,"columnArticles":399,"formTitle":"[面试题 16.01]交换数字","frequency":0.0,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":30325,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7658796489761805,"acs":14662,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":19144,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44253803820006476,"acs":9569,"articleLive":2,"columnArticles":232,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21623,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.46013887102996015,"acs":7157,"articleLive":2,"columnArticles":155,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":15554,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.4639643536944108,"acs":10725,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.0,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":23116,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.42341199639507326,"acs":12685,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 16.06]最小差","frequency":0.0,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":29959,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7330876546459595,"acs":19495,"articleLive":2,"columnArticles":286,"formTitle":"[面试题 16.07]最大数值","frequency":0.0,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":26593,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3754339560257894,"acs":2271,"articleLive":2,"columnArticles":62,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6049,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5508062452009215,"acs":2152,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3907,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6823780041275548,"acs":10250,"articleLive":2,"columnArticles":192,"formTitle":"[面试题 16.10]生存人数","frequency":0.0,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":15021,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4410069920241734,"acs":50206,"articleLive":2,"columnArticles":580,"formTitle":"[面试题 16.11]跳水板","frequency":0.0,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":113844,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4315463003987594,"acs":1948,"articleLive":2,"columnArticles":52,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4514,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5487409238374787,"acs":3552,"articleLive":2,"columnArticles":59,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6473,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5035079778205274,"acs":8899,"articleLive":2,"columnArticles":224,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.0,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":17674,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.45335490567189696,"acs":14851,"articleLive":2,"columnArticles":211,"formTitle":"[面试题 16.16]部分排序","frequency":0.0,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":32758,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6007298505377846,"acs":34405,"articleLive":2,"columnArticles":374,"formTitle":"[面试题 16.17]连续数列","frequency":0.0,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":57272,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3440216034674473,"acs":15160,"articleLive":2,"columnArticles":312,"formTitle":"[面试题 16.18]模式匹配","frequency":0.0,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":44067,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6113535803509617,"acs":20311,"articleLive":2,"columnArticles":359,"formTitle":"[面试题 16.19]水域大小","frequency":0.0,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":33223,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7215741045021361,"acs":8783,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 16.20]T9键盘","frequency":0.0,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12172,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46509803921568627,"acs":9488,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":20400,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5829577162481219,"acs":2716,"articleLive":2,"columnArticles":58,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4659,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.4720221363316936,"acs":10747,"articleLive":2,"columnArticles":161,"formTitle":"[面试题 16.24]数对和","frequency":0.0,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":22768,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.545659584725044,"acs":31693,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 16.25]LRU 缓存","frequency":0.0,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":58082,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3875674808915495,"acs":14502,"articleLive":2,"columnArticles":202,"formTitle":"[面试题 16.26]计算器","frequency":0.0,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":37418,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5969542650083244,"acs":12191,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 17.01]不用加号的加法","frequency":0.0,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":20422,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6445799962749116,"acs":27686,"articleLive":2,"columnArticles":452,"formTitle":"[面试题 17.04]消失的数字","frequency":0.0,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":42952,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.3871036693979337,"acs":5433,"articleLive":2,"columnArticles":94,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":14035,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.45,"acs":4653,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.0,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10340,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4115220483641536,"acs":8679,"articleLive":2,"columnArticles":216,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.0,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":21090,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27157901643646865,"acs":8278,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.08]马戏团人塔","frequency":0.0,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":30481,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5493074138202424,"acs":13959,"articleLive":2,"columnArticles":145,"formTitle":"[面试题 17.09]第 k 个数","frequency":0.0,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":25412,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5709396151180401,"acs":66724,"articleLive":2,"columnArticles":926,"formTitle":"[面试题 17.10]主要元素","frequency":0.0,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":116867,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6865422256170335,"acs":14381,"articleLive":2,"columnArticles":261,"formTitle":"[面试题 17.11]单词距离","frequency":0.0,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":20947,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6312528612849077,"acs":20683,"articleLive":2,"columnArticles":289,"formTitle":"[面试题 17.12]BiNode","frequency":0.0,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":32765,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5527298915245082,"acs":24560,"articleLive":2,"columnArticles":270,"formTitle":"[面试题 17.13]恢复空格","frequency":0.0,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":44434,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5971241504410311,"acs":76700,"articleLive":2,"columnArticles":759,"formTitle":"[面试题 17.14]最小K个数","frequency":0.0,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":128449,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40230599281966306,"acs":5827,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.15]最长单词","frequency":0.0,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":14484,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5183686335985823,"acs":60843,"articleLive":2,"columnArticles":1136,"formTitle":"[面试题 17.16]按摩师","frequency":0.0,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":117374,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4450629779577148,"acs":7915,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 17.17]多次搜索","frequency":0.0,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":17784,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.44499097191955667,"acs":7147,"articleLive":2,"columnArticles":119,"formTitle":"[面试题 17.18]最短超串","frequency":0.0,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":16061,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5791175479959583,"acs":8597,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.0,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":14845,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5698545614808286,"acs":3879,"articleLive":2,"columnArticles":68,"formTitle":"[面试题 17.20]连续中值","frequency":0.0,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6807,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6358939770101747,"acs":44311,"articleLive":2,"columnArticles":534,"formTitle":"[面试题 17.21]直方图的水量","frequency":0.0,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":69683,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3743543774277543,"acs":8770,"articleLive":2,"columnArticles":152,"formTitle":"[面试题 17.22]单词转换","frequency":0.0,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":23427,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3787495786990226,"acs":4495,"articleLive":2,"columnArticles":100,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.0,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":11868,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5223440342166068,"acs":10625,"articleLive":2,"columnArticles":119,"formTitle":"[面试题 17.24]最大子矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":20341,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5051746442432082,"acs":1562,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 17.25]单词矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3092,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3423,"acs":3423,"articleLive":2,"columnArticles":52,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.0,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":10000,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}]
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/doc/content/LicenseKeyFormatting.md b/src/main/java/leetcode/editor/cn/doc/content/LicenseKeyFormatting.md
new file mode 100644
index 0000000..cdf76c0
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/doc/content/LicenseKeyFormatting.md
@@ -0,0 +1,35 @@
+有一个密钥字符串 S ，只包含字母，数字以及 '-'（破折号）。其中， N 个 '-' 将字符串分成了 N+1 组。
+
+给你一个数字 K，请你重新格式化字符串，使每个分组恰好包含 K 个字符。特别地，第一个分组包含的字符个数必须小于等于 K，但至少要包含 1 个字符。两个分组之间需要用 '-'（破折号）隔开，并且将所有的小写字母转换为大写字母。
+
+给定非空字符串 S 和数字 K，按照上面描述的规则进行格式化。
+
+
+
+示例 1：
+
+输入：S = "5F3Z-2e-9-w", K = 4
+输出："5F3Z-2E9W"
+解释：字符串 S 被分成了两个部分，每部分 4 个字符；
+ 注意，两个额外的破折号需要删掉。
+
+
+示例 2：
+
+输入：S = "2-5g-3-J", K = 2
+输出："2-5G-3J"
+解释：字符串 S 被分成了 3 个部分，按照前面的规则描述，第一部分的字符可以少于给定的数量，其余部分皆为 2 个字符。
+
+
+
+
+提示:
+
+
+ - S 的长度可能很长，请按需分配大小。K 为正整数。
+ - S 只包含字母数字（a-z，A-Z，0-9）以及破折号'-'
+ - S 非空
+
+
+
+
👍 113👎 0
\ No newline at end of file