diff --git a/src/main/java/leetcode/editor/cn/GetMaximumInGeneratedArray.java b/src/main/java/leetcode/editor/cn/GetMaximumInGeneratedArray.java new file mode 100644 index 0000000..29fd0cb --- /dev/null +++ b/src/main/java/leetcode/editor/cn/GetMaximumInGeneratedArray.java @@ -0,0 +1,93 @@ +//给你一个整数 n 。按下述规则生成一个长度为 n + 1 的数组 nums ： +// +// +// nums[0] = 0 +// nums[1] = 1 +// 当 2 <= 2 * i <= n 时，nums[2 * i] = nums[i] +// 当 2 <= 2 * i + 1 <= n 时，nums[2 * i + 1] = nums[i] + nums[i + 1] +// +// +// 返回生成数组 nums 中的 最大 值。 +// +// +// +// 示例 1： +// +// +//输入：n = 7 +//输出：3 +//解释：根据规则： +// nums[0] = 0 +// nums[1] = 1 +// nums[(1 * 2) = 2] = nums[1] = 1 +// nums[(1 * 2) + 1 = 3] = nums[1] + nums[2] = 1 + 1 = 2 +// nums[(2 * 2) = 4] = nums[2] = 1 +// nums[(2 * 2) + 1 = 5] = nums[2] + nums[3] = 1 + 2 = 3 +// nums[(3 * 2) = 6] = nums[3] = 2 +// nums[(3 * 2) + 1 = 7] = nums[3] + nums[4] = 2 + 1 = 3 +//因此，nums = [0,1,1,2,1,3,2,3]，最大值 3 +// +// +// 示例 2： +// +// +//输入：n = 2 +//输出：1 +//解释：根据规则，nums[0]、nums[1] 和 nums[2] 之中的最大值是 1 +// +// +// 示例 3： +// +// +//输入：n = 3 +//输出：2 +//解释：根据规则，nums[0]、nums[1]、nums[2] 和 nums[3] 之中的最大值是 2 +// +// +// +// +// 提示： +// +// +// 0 <= n <= 100 +// +// Related Topics 数组 动态规划 模拟 👍 40 👎 0 + +package leetcode.editor.cn; + +//1646:获取生成数组中的最大值 +class GetMaximumInGeneratedArray { + public static void main(String[] args) { + //测试代码 + Solution solution = new GetMaximumInGeneratedArray().new Solution(); + } + + //力扣代码 + //leetcode submit region begin(Prohibit modification and deletion) + class Solution { + public int getMaximumGenerated(int n) { + if (n == 0) { + return 0; + } + if (n == 1) { + return 1; + } + int max = 1; + int[] arr = new int[n + 1]; + arr[0] = 0; + arr[1] = 1; + for (int i = 2; i <= n; i++) { + int index = i / 2; + if (i % 2 == 0) { + arr[i] = arr[index]; + } else { + arr[i] = arr[index] + arr[index + 1]; + max = Math.max(max, arr[i]); + } + } + return max; + } + } +//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 634c4a7..85ce31c 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.6835993015795672,"acs":16835,"articleLive":2,"columnArticles":261,"formTitle":"[789]逃脱阻碍者","frequency":0.1739305804,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"","submitted":24627,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.5185868469127575,"acs":2388764,"articleLive":2,"columnArticles":13746,"formTitle":"[1]两数之和","frequency":4.8116987313,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4606295,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.40722187586086905,"acs":954941,"articleLive":2,"columnArticles":6841,"formTitle":"[2]两数相加","frequency":4.7769126152,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2345014,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.37824185941712574,"acs":1168377,"articleLive":2,"columnArticles":7031,"formTitle":"[3]无重复字符的最长子串","frequency":4.707340383,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3088968,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4066947035049428,"acs":481300,"articleLive":2,"columnArticles":3584,"formTitle":"[4]寻找两个正序数组的中位数","frequency":4.5944484701,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1183443,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35172657771289767,"acs":691983,"articleLive":2,"columnArticles":3775,"formTitle":"[5]最长回文子串","frequency":4.6101977024,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":1967389,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5058972966343711,"acs":288751,"articleLive":2,"columnArticles":2327,"formTitle":"[6]Z 字形变换","frequency":3.7310943636,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":570770,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3538630440809537,"acs":797740,"articleLive":2,"columnArticles":5055,"formTitle":"[7]整数反转","frequency":4.7421264991,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2254375,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21672916527307234,"acs":330476,"articleLive":2,"columnArticles":2581,"formTitle":"[8]字符串转换整数 (atoi)","frequency":3.5501417324,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1524834,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5856139674672179,"acs":735366,"articleLive":2,"columnArticles":4720,"formTitle":"[9]回文数","frequency":3.7856830093,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1255718,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.316255973776238,"acs":194888,"articleLive":2,"columnArticles":1189,"formTitle":"[10]正则表达式匹配","frequency":4.2000398183,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":616235,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6323870995032241,"acs":508302,"articleLive":2,"columnArticles":2874,"formTitle":"[11]盛最多水的容器","frequency":4.0597976635,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":803783,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6657458733299738,"acs":216663,"articleLive":2,"columnArticles":1703,"formTitle":"[12]整数转罗马数字","frequency":3.6478120152,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":325444,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6331362038190532,"acs":446223,"articleLive":2,"columnArticles":3728,"formTitle":"[13]罗马数字转整数","frequency":3.8784617257,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":704782,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4060041747938268,"acs":593233,"articleLive":2,"columnArticles":3705,"formTitle":"[14]最长公共前缀","frequency":4.2293164334,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1461150,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.33196787596100846,"acs":613712,"articleLive":2,"columnArticles":2895,"formTitle":"[15]三数之和","frequency":4.4579206881,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":1848709,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.45987571127688726,"acs":247386,"articleLive":2,"columnArticles":1356,"formTitle":"[16]最接近的三数之和","frequency":4.1060935393,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":537941,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.571330155389978,"acs":319289,"articleLive":2,"columnArticles":2896,"formTitle":"[17]电话号码的字母组合","frequency":3.8184861857,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":558852,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.4024063298189011,"acs":209537,"articleLive":2,"columnArticles":1441,"formTitle":"[18]四数之和","frequency":3.3076040184,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":520710,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.4271399128362567,"acs":477498,"articleLive":2,"columnArticles":3592,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":3.6915861625,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1117896,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4445090329654195,"acs":738686,"articleLive":2,"columnArticles":5291,"formTitle":"[20]有效的括号","frequency":4.3843926789,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1661802,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6660967674880972,"acs":669721,"articleLive":2,"columnArticles":3255,"formTitle":"[21]合并两个有序链表","frequency":4.0633092412,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1005441,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7725584613646633,"acs":328257,"articleLive":2,"columnArticles":2493,"formTitle":"[22]括号生成","frequency":4.3860880103,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":424896,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5581716437041757,"acs":304822,"articleLive":2,"columnArticles":1994,"formTitle":"[23]合并K个升序链表","frequency":3.9912015677,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":546108,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.702166187927313,"acs":298962,"articleLive":2,"columnArticles":2399,"formTitle":"[24]两两交换链表中的节点","frequency":2.9465676244,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":425771,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6559664609407657,"acs":213420,"articleLive":2,"columnArticles":2054,"formTitle":"[25]K 个一组翻转链表","frequency":4.4133532952,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":325352,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5404071171100356,"acs":769998,"articleLive":2,"columnArticles":4310,"formTitle":"[26]删除有序数组中的重复项","frequency":3.9179717369,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1424848,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5982852184035491,"acs":454336,"articleLive":2,"columnArticles":3868,"formTitle":"[27]移除元素","frequency":3.5550155114,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":759397,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40718555752160573,"acs":445053,"articleLive":2,"columnArticles":3102,"formTitle":"[28]实现 strStr()","frequency":3.6364688808,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1092998,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.20725917961271945,"acs":104475,"articleLive":2,"columnArticles":853,"formTitle":"[29]两数相除","frequency":3.2651919021,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","submitted":504079,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.3551040063451896,"acs":75216,"articleLive":2,"columnArticles":554,"formTitle":"[30]串联所有单词的子串","frequency":2.8917165603,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":211814,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3730894466085819,"acs":200746,"articleLive":2,"columnArticles":1639,"formTitle":"[31]下一个排列","frequency":3.849879236,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":538064,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3551473288276218,"acs":178925,"articleLive":2,"columnArticles":1243,"formTitle":"[32]最长有效括号","frequency":3.7310943636,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":503805,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.42500121924836776,"acs":339862,"articleLive":2,"columnArticles":2273,"formTitle":"[33]搜索旋转排序数组","frequency":3.6585428832,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":799673,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4247733504274425,"acs":315418,"articleLive":2,"columnArticles":3059,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":3.4669781849,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":742556,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4668199645064758,"acs":466116,"articleLive":2,"columnArticles":3677,"formTitle":"[35]搜索插入位置","frequency":3.4601196827,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":998492,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6282561055509116,"acs":166851,"articleLive":2,"columnArticles":1087,"formTitle":"[36]有效的数独","frequency":2.5582760756,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":265578,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6706692565777856,"acs":94950,"articleLive":2,"columnArticles":808,"formTitle":"[37]解数独","frequency":3.1498702979,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":141575,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.579225840837673,"acs":208658,"articleLive":2,"columnArticles":2196,"formTitle":"[38]外观数列","frequency":3.1095585117,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":360236,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7266860735910573,"acs":312039,"articleLive":2,"columnArticles":1838,"formTitle":"[39]组合总和","frequency":3.4588548284,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":429400,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6291197553795707,"acs":187640,"articleLive":2,"columnArticles":1308,"formTitle":"[40]组合总和 II","frequency":3.3626082587,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":298258,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4181017155837814,"acs":154974,"articleLive":2,"columnArticles":1365,"formTitle":"[41]缺失的第一个正数","frequency":4.1373893473,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":370661,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5731922465719533,"acs":301181,"articleLive":2,"columnArticles":2320,"formTitle":"[42]接雨水","frequency":4.5284484822,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":525445,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4486992246074262,"acs":160987,"articleLive":2,"columnArticles":1079,"formTitle":"[43]字符串相乘","frequency":3.8748244058,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":358786,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.3276874444575199,"acs":80753,"articleLive":2,"columnArticles":525,"formTitle":"[44]通配符匹配","frequency":3.1498702979,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":246433,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4237561521305706,"acs":179173,"articleLive":2,"columnArticles":1478,"formTitle":"[45]跳跃游戏 II","frequency":4.6725542669,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":422821,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7820589597406538,"acs":391774,"articleLive":2,"columnArticles":2524,"formTitle":"[46]全排列","frequency":4.6037427355,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":500952,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.635866893732538,"acs":200506,"articleLive":2,"columnArticles":1396,"formTitle":"[47]全排列 II","frequency":3.3104995707,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":315327,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7347550851708716,"acs":207993,"articleLive":2,"columnArticles":1776,"formTitle":"[48]旋转图像","frequency":3.4715772686,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":283078,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6635242451747804,"acs":221497,"articleLive":2,"columnArticles":1243,"formTitle":"[49]字母异位词分组","frequency":3.2833902934,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"","submitted":333819,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37675461386685466,"acs":207368,"articleLive":2,"columnArticles":1233,"formTitle":"[50]Pow(x, n)","frequency":3.2146721849,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":550406,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.739008061349881,"acs":144935,"articleLive":2,"columnArticles":1464,"formTitle":"[51]N 皇后","frequency":3.1953541341,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":196121,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8237622845501164,"acs":71164,"articleLive":2,"columnArticles":583,"formTitle":"[52]N皇后 II","frequency":1.3501774273,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":86389,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5502624362390828,"acs":625250,"articleLive":2,"columnArticles":3534,"formTitle":"[53]最大子序和","frequency":3.6794193008,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1136276,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.4783640103651858,"acs":179066,"articleLive":2,"columnArticles":1901,"formTitle":"[54]螺旋矩阵","frequency":4.1899054524,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":374330,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4316106298209446,"acs":298129,"articleLive":2,"columnArticles":2319,"formTitle":"[55]跳跃游戏","frequency":3.5797121897,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":690736,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4654431578180759,"acs":281204,"articleLive":2,"columnArticles":2182,"formTitle":"[56]合并区间","frequency":4.1873557315,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"","submitted":604164,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4104843304843305,"acs":82846,"articleLive":2,"columnArticles":898,"formTitle":"[57]插入区间","frequency":1.9195714052,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":201825,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.35150469000760903,"acs":211577,"articleLive":2,"columnArticles":2280,"formTitle":"[58]最后一个单词的长度","frequency":2.6562496217,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"","submitted":601918,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7935232952874823,"acs":118746,"articleLive":2,"columnArticles":1484,"formTitle":"[59]螺旋矩阵 II","frequency":3.6117200429,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":149644,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.523265864726644,"acs":87174,"articleLive":2,"columnArticles":907,"formTitle":"[60]排列序列","frequency":1.7608063999,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":166596,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4183071630263359,"acs":188585,"articleLive":2,"columnArticles":1917,"formTitle":"[61]旋转链表","frequency":3.5586553204,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":450829,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6592900406622002,"acs":295416,"articleLive":2,"columnArticles":2302,"formTitle":"[62]不同路径","frequency":3.1690021481,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":448082,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.38937118562710005,"acs":170346,"articleLive":2,"columnArticles":1616,"formTitle":"[63]不同路径 II","frequency":3.3076040184,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":437490,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6875658003350573,"acs":254048,"articleLive":2,"columnArticles":1983,"formTitle":"[64]最小路径和","frequency":3.4181575255,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":369489,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.26887352133945375,"acs":44868,"articleLive":2,"columnArticles":622,"formTitle":"[65]有效数字","frequency":2.2483149645,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":166874,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.4585363769665832,"acs":332725,"articleLive":2,"columnArticles":3033,"formTitle":"[66]加一","frequency":2.999274265,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":725624,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.544122970921406,"acs":186373,"articleLive":2,"columnArticles":1715,"formTitle":"[67]二进制求和","frequency":2.9326761969,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":342520,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.47008987770738175,"acs":19143,"articleLive":2,"columnArticles":289,"formTitle":"[68]文本左右对齐","frequency":2.1190846538,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"","submitted":40722,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39296208886255796,"acs":364145,"articleLive":2,"columnArticles":1839,"formTitle":"[69]x 的平方根","frequency":3.7163084855,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":926667,"title":"x 的平方根","titleSlug":"sqrtx"},{"acceptance":0.5272475718861821,"acs":534280,"articleLive":2,"columnArticles":3367,"formTitle":"[70]爬楼梯","frequency":4.2896013863,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1013338,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.421397952116209,"acs":90046,"articleLive":2,"columnArticles":792,"formTitle":"[71]简化路径","frequency":2.5567611992,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":213684,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.61233584192852,"acs":163381,"articleLive":2,"columnArticles":1169,"formTitle":"[72]编辑距离","frequency":4.4181103952,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":266816,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6006151142355008,"acs":124397,"articleLive":2,"columnArticles":911,"formTitle":"[73]矩阵置零","frequency":2.5371904066,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":207116,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4576203557783117,"acs":159418,"articleLive":2,"columnArticles":1611,"formTitle":"[74]搜索二维矩阵","frequency":3.6346660391,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":348363,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.593613008160789,"acs":251461,"articleLive":2,"columnArticles":1759,"formTitle":"[75]颜色分类","frequency":2.2622725745,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":423611,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4230178188672114,"acs":170120,"articleLive":2,"columnArticles":1175,"formTitle":"[76]最小覆盖子串","frequency":4.011770922,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":402158,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7700632745031561,"acs":202147,"articleLive":2,"columnArticles":1192,"formTitle":"[77]组合","frequency":3.4527187104,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":262507,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8002453352233232,"acs":293566,"articleLive":2,"columnArticles":1934,"formTitle":"[78]子集","frequency":3.6893043653,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":366845,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4567705404749038,"acs":208772,"articleLive":2,"columnArticles":1328,"formTitle":"[79]单词搜索","frequency":3.5683894625,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":457061,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6157530647231627,"acs":142952,"articleLive":2,"columnArticles":1289,"formTitle":"[80]删除有序数组中的重复项 II","frequency":3.2000716802,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":232158,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.416270638381265,"acs":118951,"articleLive":2,"columnArticles":954,"formTitle":"[81]搜索旋转排序数组 II","frequency":3.4418890616,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":285754,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5283605946311354,"acs":167261,"articleLive":2,"columnArticles":1607,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":3.8373262305,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":316566,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5385173985378834,"acs":298113,"articleLive":2,"columnArticles":1836,"formTitle":"[83]删除排序链表中的重复元素","frequency":3.3230069645,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":553581,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43246582400048017,"acs":172918,"articleLive":2,"columnArticles":1096,"formTitle":"[84]柱状图中最大的矩形","frequency":3.8694656233,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":399842,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5161952056138148,"acs":92098,"articleLive":2,"columnArticles":650,"formTitle":"[85]最大矩形","frequency":2.8985276478,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":178417,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6320042331308633,"acs":114662,"articleLive":2,"columnArticles":1058,"formTitle":"[86]分隔链表","frequency":2.7884728933,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":181426,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.4894783782480837,"acs":40613,"articleLive":2,"columnArticles":302,"formTitle":"[87]扰乱字符串","frequency":3.3252486656,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":82972,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5146050046697369,"acs":431433,"articleLive":2,"columnArticles":3047,"formTitle":"[88]合并两个有序数组","frequency":4.6196152448,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":838377,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7090674525378495,"acs":56061,"articleLive":2,"columnArticles":454,"formTitle":"[89]格雷编码","frequency":2.2143006507,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":79063,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6338142554513476,"acs":129551,"articleLive":2,"columnArticles":1151,"formTitle":"[90]子集 II","frequency":3.6082686693,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":204399,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3039659864758785,"acs":152566,"articleLive":2,"columnArticles":1451,"formTitle":"[91]解码方法","frequency":3.1723343737,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":501918,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5466056318490775,"acs":197024,"articleLive":2,"columnArticles":1932,"formTitle":"[92]反转链表 II","frequency":4.3178853333,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":360450,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.53670768568938,"acs":142227,"articleLive":2,"columnArticles":1251,"formTitle":"[93]复原 IP 地址","frequency":3.9459847732,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":264999,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.755938598252474,"acs":523331,"articleLive":2,"columnArticles":2166,"formTitle":"[94]二叉树的中序遍历","frequency":2.9910668684,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":692293,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.6985517206085552,"acs":95550,"articleLive":2,"columnArticles":592,"formTitle":"[95]不同的二叉搜索树 II","frequency":2.8985276478,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":136783,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6992804759928047,"acs":151611,"articleLive":2,"columnArticles":1213,"formTitle":"[96]不同的二叉搜索树","frequency":3.3154630683,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":216810,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.45712450830858153,"acs":56944,"articleLive":2,"columnArticles":513,"formTitle":"[97]交错字符串","frequency":2.0893853813,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":124570,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.3481084066770429,"acs":325198,"articleLive":2,"columnArticles":1823,"formTitle":"[98]验证二叉搜索树","frequency":3.5153435102,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":934186,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6158563091351357,"acs":66587,"articleLive":2,"columnArticles":553,"formTitle":"[99]恢复二叉搜索树","frequency":2.7085894701,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":108121,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6039108372043109,"acs":236355,"articleLive":2,"columnArticles":1795,"formTitle":"[100]相同的树","frequency":2.700865933,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":391374,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.560377706648224,"acs":385685,"articleLive":2,"columnArticles":2137,"formTitle":"[101]对称二叉树","frequency":3.5227707576,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":688259,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6420960239046998,"acs":370892,"articleLive":2,"columnArticles":2365,"formTitle":"[102]二叉树的层序遍历","frequency":4.272940681,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":577627,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5715202477652648,"acs":163868,"articleLive":2,"columnArticles":1513,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":3.8826323705,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":286723,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7655172957213774,"acs":485759,"articleLive":2,"columnArticles":2416,"formTitle":"[104]二叉树的最大深度","frequency":3.6339306151,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":634550,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7029839215875622,"acs":232952,"articleLive":2,"columnArticles":1353,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":3.9179717369,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":331376,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7211845232981069,"acs":125908,"articleLive":2,"columnArticles":833,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":3.2854491782,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":174585,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6949717008706743,"acs":156926,"articleLive":2,"columnArticles":1268,"formTitle":"[107]二叉树的层序遍历 II","frequency":3.0058904524,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":225802,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7587298018594155,"acs":182234,"articleLive":2,"columnArticles":1143,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":2.4369767663,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":240183,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7634474999788529,"acs":90254,"articleLive":2,"columnArticles":690,"formTitle":"[109]有序链表转换二叉搜索树","frequency":2.7949153843,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":118219,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5622078397398181,"acs":242704,"articleLive":2,"columnArticles":1389,"formTitle":"[110]平衡二叉树","frequency":3.0782210822,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":431698,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.48392669541505007,"acs":255191,"articleLive":2,"columnArticles":1703,"formTitle":"[111]二叉树的最小深度","frequency":2.0826640224,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":527334,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5258457152602468,"acs":249752,"articleLive":2,"columnArticles":1572,"formTitle":"[112]路径总和","frequency":2.7149804934,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":474953,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6257102646888382,"acs":166280,"articleLive":2,"columnArticles":1169,"formTitle":"[113]路径总和 II","frequency":3.0624329424,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":265746,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7251525957688858,"acs":165730,"articleLive":2,"columnArticles":1232,"formTitle":"[114]二叉树展开为链表","frequency":2.1954027481,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":228545,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5257084322932719,"acs":57993,"articleLive":2,"columnArticles":653,"formTitle":"[115]不同的子序列","frequency":3.2259236589,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":110314,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7021427811675063,"acs":145227,"articleLive":2,"columnArticles":1092,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":2.4741575728,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":206834,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6091552879931365,"acs":83782,"articleLive":2,"columnArticles":705,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":1.2416110468,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":137538,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7244438980648521,"acs":200358,"articleLive":2,"columnArticles":1640,"formTitle":"[118]杨辉三角","frequency":3.4294036142,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":276568,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6621502397862871,"acs":134343,"articleLive":2,"columnArticles":1150,"formTitle":"[119]杨辉三角 II","frequency":2.6524589145,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":202889,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6786423847731733,"acs":168399,"articleLive":2,"columnArticles":1485,"formTitle":"[120]三角形最小路径和","frequency":2.4610598086,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":248141,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5726437904266971,"acs":526495,"articleLive":2,"columnArticles":3223,"formTitle":"[121]买卖股票的最佳时机","frequency":4.01295807,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":919411,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6864229433866544,"acs":432975,"articleLive":2,"columnArticles":2529,"formTitle":"[122]买卖股票的最佳时机 II","frequency":3.3213567923,"frontendQuestionId":"122","leaf":true,"level":1,"nodeType":"def","questionId":"122","status":"","submitted":630770,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5325584585966507,"acs":124215,"articleLive":2,"columnArticles":791,"formTitle":"[123]买卖股票的最佳时机 III","frequency":2.9070499424,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":233242,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4425510993326658,"acs":147620,"articleLive":2,"columnArticles":1037,"formTitle":"[124]二叉树中的最大路径和","frequency":3.9788450531,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":333566,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.4738621246546671,"acs":264661,"articleLive":2,"columnArticles":1776,"formTitle":"[125]验证回文串","frequency":3.1868504232,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":558519,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.39316683626067334,"acs":35547,"articleLive":2,"columnArticles":317,"formTitle":"[126]单词接龙 II","frequency":1.9718656439,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":90412,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46685769238317665,"acs":118939,"articleLive":2,"columnArticles":629,"formTitle":"[127]单词接龙","frequency":2.3762632719,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":254765,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5426932175019713,"acs":156923,"articleLive":2,"columnArticles":1031,"formTitle":"[128]最长连续序列","frequency":3.6420246271,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":289156,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.679310802175145,"acs":112680,"articleLive":2,"columnArticles":1069,"formTitle":"[129]求根节点到叶节点数字之和","frequency":3.1095585117,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":165874,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.4413774134990924,"acs":120357,"articleLive":2,"columnArticles":1109,"formTitle":"[130]被围绕的区域","frequency":2.7884728933,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":272685,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7238437024489679,"acs":126061,"articleLive":2,"columnArticles":829,"formTitle":"[131]分割回文串","frequency":4.0242588566,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":174155,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49285126517177535,"acs":47915,"articleLive":2,"columnArticles":428,"formTitle":"[132]分割回文串 II","frequency":3.1600615431,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":97220,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6753617281434685,"acs":69594,"articleLive":2,"columnArticles":506,"formTitle":"[133]克隆图","frequency":0.272605588,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":103047,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5759079192011379,"acs":118633,"articleLive":2,"columnArticles":923,"formTitle":"[134]加油站","frequency":3.4906191495,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":205993,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4850593897785546,"acs":92414,"articleLive":2,"columnArticles":737,"formTitle":"[135]分发糖果","frequency":4.1093488167,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"","submitted":190521,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7188473293997667,"acs":470147,"articleLive":2,"columnArticles":2142,"formTitle":"[136]只出现一次的数字","frequency":3.7006704612,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":654029,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7194468427163655,"acs":96662,"articleLive":2,"columnArticles":740,"formTitle":"[137]只出现一次的数字 II","frequency":3.4828369333,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":134356,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6585815506953364,"acs":107169,"articleLive":2,"columnArticles":832,"formTitle":"[138]复制带随机指针的链表","frequency":3.2460620816,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":162727,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5120387261732048,"acs":178233,"articleLive":2,"columnArticles":1131,"formTitle":"[139]单词拆分","frequency":3.7310943636,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":348085,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.4808712228450635,"acs":50956,"articleLive":2,"columnArticles":514,"formTitle":"[140]单词拆分 II","frequency":2.0055842799,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":105966,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5120713601185609,"acs":494791,"articleLive":2,"columnArticles":2582,"formTitle":"[141]环形链表","frequency":3.7852517034,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":966254,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5513122966688622,"acs":276224,"articleLive":2,"columnArticles":1624,"formTitle":"[142]环形链表 II","frequency":3.4373954799,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":501030,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6161645453490947,"acs":116863,"articleLive":2,"columnArticles":1023,"formTitle":"[143]重排链表","frequency":4.3859105852,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":189662,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7022379144945696,"acs":384457,"articleLive":2,"columnArticles":1744,"formTitle":"[144]二叉树的前序遍历","frequency":2.6146914124,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":547474,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7490484628191196,"acs":279849,"articleLive":2,"columnArticles":1473,"formTitle":"[145]二叉树的后序遍历","frequency":3.1419368966,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":373606,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5263325440222542,"acs":214940,"articleLive":2,"columnArticles":1310,"formTitle":"[146]LRU 缓存机制","frequency":4.423134572,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":408373,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.680227919423282,"acs":96340,"articleLive":2,"columnArticles":759,"formTitle":"[147]对链表进行插入排序","frequency":2.2836044414,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":141629,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6675549296913427,"acs":198153,"articleLive":2,"columnArticles":1192,"formTitle":"[148]排序链表","frequency":3.8744234917,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":296834,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.33522585898798885,"acs":44460,"articleLive":2,"columnArticles":490,"formTitle":"[149]直线上最多的点数","frequency":3.1095585117,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":132627,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5368723427727662,"acs":126529,"articleLive":2,"columnArticles":1003,"formTitle":"[150]逆波兰表达式求值","frequency":3.3626082587,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":235678,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.47919445707454705,"acs":159140,"articleLive":2,"columnArticles":1358,"formTitle":"[151]翻转字符串里的单词","frequency":2.9201641474,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":332099,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.4200136951884566,"acs":170518,"articleLive":2,"columnArticles":1163,"formTitle":"[152]乘积最大子数组","frequency":3.5958441737,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":405982,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5651655064639863,"acs":198910,"articleLive":2,"columnArticles":1408,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":2.7041408663,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":351950,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5319716025732106,"acs":108577,"articleLive":2,"columnArticles":858,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":3.0478605232,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":204103,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5720232162748432,"acs":273196,"articleLive":2,"columnArticles":1527,"formTitle":"[155]最小栈","frequency":3.2432488237,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":477596,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7265160523186682,"acs":6110,"articleLive":2,"columnArticles":105,"formTitle":"[156]上下翻转二叉树","frequency":0.8139139155,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"","submitted":8410,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5303832969772515,"acs":5106,"articleLive":2,"columnArticles":79,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"","submitted":9627,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5877013841615611,"acs":2590,"articleLive":2,"columnArticles":61,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.4223167489,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"","submitted":4407,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5391425557564798,"acs":14311,"articleLive":2,"columnArticles":178,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":2.067716061,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"","submitted":26544,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6113076195415494,"acs":314714,"articleLive":2,"columnArticles":1865,"formTitle":"[160]相交链表","frequency":3.5153435102,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":514821,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33679267433669874,"acs":7172,"articleLive":2,"columnArticles":96,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.2999147674,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"","submitted":21295,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49435635525302796,"acs":117509,"articleLive":2,"columnArticles":688,"formTitle":"[162]寻找峰值","frequency":2.9201641474,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":237701,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3224025114414312,"acs":8524,"articleLive":2,"columnArticles":133,"formTitle":"[163]缺失的区间","frequency":0.7843696691,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"","submitted":26439,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6106658973372655,"acs":57151,"articleLive":2,"columnArticles":482,"formTitle":"[164]最大间距","frequency":2.8197964157,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":93588,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.4848422777550184,"acs":52074,"articleLive":2,"columnArticles":517,"formTitle":"[165]比较版本号","frequency":3.84648271,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"","submitted":107404,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.29788804160663457,"acs":25431,"articleLive":2,"columnArticles":198,"formTitle":"[166]分数到小数","frequency":2.4941480215,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":85371,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5861916932767882,"acs":268569,"articleLive":2,"columnArticles":1758,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":2.7163272224,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":458159,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43256272891563036,"acs":80663,"articleLive":2,"columnArticles":730,"formTitle":"[168]Excel表列名称","frequency":2.9620814323,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":186477,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6640560255721402,"acs":364590,"articleLive":2,"columnArticles":2082,"formTitle":"[169]多数元素","frequency":3.4527187104,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":549035,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.41638631540810517,"acs":8045,"articleLive":2,"columnArticles":79,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.2999147674,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"","submitted":19321,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7172608322013695,"acs":103495,"articleLive":2,"columnArticles":887,"formTitle":"[171]Excel 表列序号","frequency":1.0455851684,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":144292,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.43703737341628446,"acs":86616,"articleLive":2,"columnArticles":565,"formTitle":"[172]阶乘后的零","frequency":2.2546337016,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","questionId":"172","status":"","submitted":198189,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8030123615276502,"acs":72561,"articleLive":2,"columnArticles":608,"formTitle":"[173]二叉搜索树迭代器","frequency":2.3391434217,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":90361,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4795237472196781,"acs":36650,"articleLive":2,"columnArticles":394,"formTitle":"[174]地下城游戏","frequency":3.0659630223,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":76430,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.739760572250754,"acs":288949,"articleLive":2,"columnArticles":1415,"formTitle":"[175]组合两个表","frequency":4.4903986557,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":390598,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3561412129062998,"acs":239188,"articleLive":2,"columnArticles":972,"formTitle":"[176]第二高的薪水","frequency":4.5251847718,"frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","questionId":"176","status":"","submitted":671610,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46180575509250216,"acs":120541,"articleLive":2,"columnArticles":462,"formTitle":"[177]第N高的薪水","frequency":3.7321984821,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":261021,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6013054032763693,"acs":112209,"articleLive":2,"columnArticles":636,"formTitle":"[178]分数排名","frequency":3.3950786438,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":186609,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.40974688057041,"acs":114934,"articleLive":2,"columnArticles":929,"formTitle":"[179]最大数","frequency":3.9218034529,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":280500,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.4869835997508823,"acs":82103,"articleLive":2,"columnArticles":471,"formTitle":"[180]连续出现的数字","frequency":3.5328939782,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":168595,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7031749287749288,"acs":154259,"articleLive":2,"columnArticles":639,"formTitle":"[181]超过经理收入的员工","frequency":3.4487942126,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":219375,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7971370238039999,"acs":171791,"articleLive":2,"columnArticles":550,"formTitle":"[182]查找重复的电子邮箱","frequency":3.0362333866,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":215510,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6777241694954041,"acs":142154,"articleLive":2,"columnArticles":521,"formTitle":"[183]从不订购的客户","frequency":2.1190846538,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":209752,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47395400728373643,"acs":96434,"articleLive":2,"columnArticles":632,"formTitle":"[184]部门工资最高的员工","frequency":3.7321984821,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":203467,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.4917960154184697,"acs":66600,"articleLive":2,"columnArticles":595,"formTitle":"[185]部门工资前三高的所有员工","frequency":3.6563321315,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":135422,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7528548978522787,"acs":7186,"articleLive":2,"columnArticles":105,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.2999147674,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"","submitted":9545,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.4816885119506554,"acs":39984,"articleLive":2,"columnArticles":264,"formTitle":"[187]重复的DNA序列","frequency":1.6511803438,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"","submitted":83008,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3879210274174528,"acs":84213,"articleLive":2,"columnArticles":660,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":2.3981459832,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":217088,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.45321821351738717,"acs":315584,"articleLive":2,"columnArticles":1567,"formTitle":"[189]旋转数组","frequency":3.0782210822,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":696318,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6949368068379093,"acs":125696,"articleLive":2,"columnArticles":790,"formTitle":"[190]颠倒二进制位","frequency":2.4610598086,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":180874,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7468328456579104,"acs":181983,"articleLive":2,"columnArticles":1149,"formTitle":"[191]位1的个数","frequency":2.883269494,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":243673,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3551697727852949,"acs":20868,"articleLive":2,"columnArticles":167,"formTitle":"[192]统计词频","frequency":2.7759135205,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":58755,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.32353509710176676,"acs":25106,"articleLive":2,"columnArticles":136,"formTitle":"[193]有效电话号码","frequency":2.067716061,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":77599,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34592007824507476,"acs":9903,"articleLive":2,"columnArticles":67,"formTitle":"[194]转置文件","frequency":1.4416488308,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":28628,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.43569403658645106,"acs":34273,"articleLive":2,"columnArticles":139,"formTitle":"[195]第十行","frequency":2.5485791866,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":78663,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6646210409194259,"acs":96170,"articleLive":2,"columnArticles":362,"formTitle":"[196]删除重复的电子邮箱","frequency":2.868247994,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":144699,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5334353591028109,"acs":89232,"articleLive":2,"columnArticles":484,"formTitle":"[197]上升的温度","frequency":2.7699550926,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":167278,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5101859512635405,"acs":359501,"articleLive":2,"columnArticles":2514,"formTitle":"[198]打家劫舍","frequency":3.8521785105,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":704647,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6518502658885857,"acs":130915,"articleLive":2,"columnArticles":1504,"formTitle":"[199]二叉树的右视图","frequency":3.9770673065,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":200836,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5503963677506903,"acs":302576,"articleLive":2,"columnArticles":2016,"formTitle":"[200]岛屿数量","frequency":4.3056019774,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":549742,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5218811664108748,"acs":47606,"articleLive":2,"columnArticles":311,"formTitle":"[201]数字范围按位与","frequency":1.7608063999,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":91220,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6177715581051073,"acs":160245,"articleLive":2,"columnArticles":1316,"formTitle":"[202]快乐数","frequency":2.6793133746,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":259392,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5123972021492108,"acs":216764,"articleLive":2,"columnArticles":1550,"formTitle":"[203]移除链表元素","frequency":2.823239471,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":423039,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37947471682563766,"acs":162082,"articleLive":2,"columnArticles":706,"formTitle":"[204]计数质数","frequency":2.5185056082,"frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","questionId":"204","status":"","submitted":427122,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5010807461967371,"acs":109188,"articleLive":2,"columnArticles":842,"formTitle":"[205]同构字符串","frequency":2.3443580135,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":217905,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7218020330415795,"acs":659159,"articleLive":2,"columnArticles":7145,"formTitle":"[206]反转链表","frequency":4.6527534042,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":913213,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5452480121166224,"acs":132480,"articleLive":2,"columnArticles":882,"formTitle":"[207]课程表","frequency":3.3060320865,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":242972,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.716110040338294,"acs":135985,"articleLive":2,"columnArticles":921,"formTitle":"[208]实现 Trie (前缀树)","frequency":3.0697507622,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":189894,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.46842882032319766,"acs":175836,"articleLive":2,"columnArticles":1255,"formTitle":"[209]长度最小的子数组","frequency":2.7041408663,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":375374,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5407959035142441,"acs":83222,"articleLive":2,"columnArticles":644,"formTitle":"[210]课程表 II","frequency":2.3391434217,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":153888,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4814304885062479,"acs":27624,"articleLive":2,"columnArticles":302,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":1.6511803438,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":57379,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.45120119272168696,"acs":39948,"articleLive":2,"columnArticles":386,"formTitle":"[212]单词搜索 II","frequency":2.0055842799,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"","submitted":88537,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.43184306569343067,"acs":151456,"articleLive":2,"columnArticles":1422,"formTitle":"[213]打家劫舍 II","frequency":3.5018908751,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":350720,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3706183102217972,"acs":30228,"articleLive":2,"columnArticles":296,"formTitle":"[214]最短回文串","frequency":2.8461439831,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":81561,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6469843387645219,"acs":409270,"articleLive":2,"columnArticles":2173,"formTitle":"[215]数组中的第K个最大元素","frequency":4.3393749861,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":632581,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7397545579800698,"acs":92348,"articleLive":2,"columnArticles":972,"formTitle":"[216]组合总和 III","frequency":2.9898417159,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":124836,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5615056834908763,"acs":333782,"articleLive":2,"columnArticles":1545,"formTitle":"[217]存在重复元素","frequency":3.1419368966,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":594441,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5422145266309543,"acs":30062,"articleLive":2,"columnArticles":263,"formTitle":"[218]天际线问题","frequency":2.9620814323,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":55443,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4255322587161152,"acs":105332,"articleLive":2,"columnArticles":835,"formTitle":"[219]存在重复元素 II","frequency":2.067716061,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"","submitted":247530,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28700202208168474,"acs":62309,"articleLive":2,"columnArticles":410,"formTitle":"[220]存在重复元素 III","frequency":3.0058904524,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":217103,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4715746123148131,"acs":129393,"articleLive":2,"columnArticles":936,"formTitle":"[221]最大正方形","frequency":3.572029669,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":274385,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7796670359953408,"acs":109774,"articleLive":2,"columnArticles":843,"formTitle":"[222]完全二叉树的节点个数","frequency":1.877532353,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":140796,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.45910942614265193,"acs":19497,"articleLive":2,"columnArticles":244,"formTitle":"[223]矩形面积","frequency":2.3165346477,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"","submitted":42467,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.41767942776671446,"acs":67327,"articleLive":2,"columnArticles":632,"formTitle":"[224]基本计算器","frequency":4.2933384511,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":161193,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6754054913601187,"acs":127422,"articleLive":2,"columnArticles":4712,"formTitle":"[225]用队列实现栈","frequency":2.6793133746,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":188660,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7872732657755536,"acs":284419,"articleLive":2,"columnArticles":1756,"formTitle":"[226]翻转二叉树","frequency":3.7434053309,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":361271,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43682465651849184,"acs":81297,"articleLive":2,"columnArticles":677,"formTitle":"[227]基本计算器 II","frequency":3.6701194314,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":186109,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5817310749793314,"acs":54884,"articleLive":2,"columnArticles":619,"formTitle":"[228]汇总区间","frequency":1.1156189128,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":94346,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.46280727466524546,"acs":34736,"articleLive":2,"columnArticles":299,"formTitle":"[229]求众数 II","frequency":1.7920101796,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":75055,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7402007607172477,"acs":129413,"articleLive":2,"columnArticles":800,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":2.0055842799,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":174835,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5033579796367046,"acs":158893,"articleLive":2,"columnArticles":1152,"formTitle":"[231]2 的幂","frequency":2.1218320592,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":315666,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6907563103364893,"acs":148543,"articleLive":2,"columnArticles":1197,"formTitle":"[232]用栈实现队列","frequency":3.3076040184,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":215044,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47585212942278593,"acs":33017,"articleLive":2,"columnArticles":401,"formTitle":"[233]数字 1 的个数","frequency":2.067716061,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":69385,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.4917207144576508,"acs":292118,"articleLive":2,"columnArticles":1887,"formTitle":"[234]回文链表","frequency":3.7068959426,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":594073,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6656024814489417,"acs":161368,"articleLive":2,"columnArticles":923,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":2.4068827153,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":242439,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6789699740824157,"acs":239967,"articleLive":2,"columnArticles":1306,"formTitle":"[236]二叉树的最近公共祖先","frequency":3.5494962463,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":353428,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8479202060612704,"acs":201136,"articleLive":2,"columnArticles":990,"formTitle":"[237]删除链表中的节点","frequency":2.6290515398,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":237211,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7222739467928624,"acs":131105,"articleLive":2,"columnArticles":826,"formTitle":"[238]除自身以外数组的乘积","frequency":2.6793133746,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":181517,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.49607191606116174,"acs":179898,"articleLive":2,"columnArticles":1257,"formTitle":"[239]滑动窗口最大值","frequency":3.413406381,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":362645,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4732278389514011,"acs":157123,"articleLive":2,"columnArticles":704,"formTitle":"[240]搜索二维矩阵 II","frequency":3.0862121747,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":332024,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7367358636329653,"acs":29563,"articleLive":2,"columnArticles":266,"formTitle":"[241]为运算表达式设计优先级","frequency":2.5071863558,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":40127,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6432863184600648,"acs":273333,"articleLive":2,"columnArticles":1576,"formTitle":"[242]有效的字母异位词","frequency":2.7054654926,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":424901,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6563114431773496,"acs":8345,"articleLive":2,"columnArticles":95,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"","submitted":12715,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5470761961015947,"acs":4631,"articleLive":2,"columnArticles":55,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"","submitted":8465,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6112688686295024,"acs":4090,"articleLive":2,"columnArticles":55,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"","submitted":6691,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.47428119229754684,"acs":5394,"articleLive":2,"columnArticles":101,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"","submitted":11373,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5207451312447079,"acs":4920,"articleLive":2,"columnArticles":88,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"","submitted":9448,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4659111679766039,"acs":2549,"articleLive":2,"columnArticles":50,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"","submitted":5471,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6372236017500296,"acs":5389,"articleLive":2,"columnArticles":94,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"","submitted":8457,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6343361772189792,"acs":4238,"articleLive":2,"columnArticles":72,"formTitle":"[250]统计同值子树","frequency":0.2999147674,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"","submitted":6681,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5412814791201785,"acs":3396,"articleLive":2,"columnArticles":65,"formTitle":"[251]展开二维向量","frequency":0.7843696691,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"","submitted":6274,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5609632702620662,"acs":11088,"articleLive":2,"columnArticles":146,"formTitle":"[252]会议室","frequency":0.2999147674,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"","submitted":19766,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.49633444614068345,"acs":29586,"articleLive":2,"columnArticles":316,"formTitle":"[253]会议室 II","frequency":2.6067125617,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"","submitted":59609,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5686646884272997,"acs":4791,"articleLive":2,"columnArticles":69,"formTitle":"[254]因子的组合","frequency":0.8139139155,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"","submitted":8425,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4733608524527215,"acs":4931,"articleLive":2,"columnArticles":54,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"","submitted":10417,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6290398678933711,"acs":10666,"articleLive":2,"columnArticles":164,"formTitle":"[256]粉刷房子","frequency":0.2999147674,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"","submitted":16956,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6797355201319364,"acs":134364,"articleLive":2,"columnArticles":996,"formTitle":"[257]二叉树的所有路径","frequency":3.002312119,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":197671,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6914283627332822,"acs":75728,"articleLive":2,"columnArticles":623,"formTitle":"[258]各位相加","frequency":2.3981459832,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":109524,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5678139376384392,"acs":6665,"articleLive":2,"columnArticles":81,"formTitle":"[259]较小的三数之和","frequency":0.2464260825,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"","submitted":11738,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7253259801405125,"acs":49452,"articleLive":2,"columnArticles":420,"formTitle":"[260]只出现一次的数字 III","frequency":2.4610598086,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":68179,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49665353099393256,"acs":7940,"articleLive":2,"columnArticles":113,"formTitle":"[261]以图判树","frequency":1.2416110468,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"","submitted":15987,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43839717232922165,"acs":36465,"articleLive":2,"columnArticles":354,"formTitle":"[262]行程和用户","frequency":3.0435995768,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":83178,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5154688361968282,"acs":103718,"articleLive":2,"columnArticles":815,"formTitle":"[263]丑数","frequency":2.5915377637,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":201211,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5777650576364489,"acs":94880,"articleLive":2,"columnArticles":590,"formTitle":"[264]丑数 II","frequency":2.9162648989,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":164219,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5789924769069612,"acs":6080,"articleLive":2,"columnArticles":126,"formTitle":"[265]粉刷房子 II","frequency":0.2464260825,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"","submitted":10501,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6689052339835838,"acs":6275,"articleLive":2,"columnArticles":98,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"","submitted":9381,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.4439554394168615,"acs":3228,"articleLive":2,"columnArticles":74,"formTitle":"[267]回文排列 II","frequency":0.2999147674,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"","submitted":7271,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6222467435064095,"acs":144360,"articleLive":2,"columnArticles":1048,"formTitle":"[268]丢失的数字","frequency":1.6191673668,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":231998,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3403975779732663,"acs":5959,"articleLive":2,"columnArticles":99,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"","submitted":17506,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5496229260935144,"acs":9110,"articleLive":2,"columnArticles":132,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.8139139155,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"","submitted":16575,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5501964207769533,"acs":2521,"articleLive":2,"columnArticles":44,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"","submitted":4582,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6431840796019901,"acs":3232,"articleLive":2,"columnArticles":70,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.4567791531,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"","submitted":5025,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3085274170653488,"acs":11737,"articleLive":2,"columnArticles":156,"formTitle":"[273]整数转换英文表示","frequency":1.8243231686,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"","submitted":38042,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4403873617319734,"acs":52115,"articleLive":2,"columnArticles":556,"formTitle":"[274]H 指数","frequency":2.742625654,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":118339,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.46340029122951126,"acs":49645,"articleLive":2,"columnArticles":405,"formTitle":"[275]H 指数 II","frequency":1.5295016046,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":107132,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4843659942363112,"acs":6723,"articleLive":2,"columnArticles":120,"formTitle":"[276]栅栏涂色","frequency":1.2082968401,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"","submitted":13880,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5680688969857569,"acs":6860,"articleLive":2,"columnArticles":81,"formTitle":"[277]搜寻名人","frequency":0.3284392341,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"","submitted":12076,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4548927637113782,"acs":157886,"articleLive":2,"columnArticles":912,"formTitle":"[278]第一个错误的版本","frequency":3.1546274222,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":347084,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6297941498710747,"acs":190269,"articleLive":2,"columnArticles":1136,"formTitle":"[279]完全平方数","frequency":3.4642959957,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":302113,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6864941418823226,"acs":5332,"articleLive":2,"columnArticles":69,"formTitle":"[280]摆动排序","frequency":0.8446288607,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"","submitted":7767,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7554988842843481,"acs":2370,"articleLive":2,"columnArticles":59,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"","submitted":3137,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.3880563252841712,"acs":6862,"articleLive":2,"columnArticles":70,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":17683,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6390267706363806,"acs":449170,"articleLive":2,"columnArticles":3138,"formTitle":"[283]移动零","frequency":3.4994802333,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":702897,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.732988996182349,"acs":9792,"articleLive":2,"columnArticles":95,"formTitle":"[284]顶端迭代器","frequency":0.8139139155,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"","submitted":13359,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6359392241745183,"acs":7492,"articleLive":2,"columnArticles":95,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"","submitted":11781,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5066487513320669,"acs":10935,"articleLive":2,"columnArticles":137,"formTitle":"[286]墙与门","frequency":0.3895269261,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"ac","submitted":21583,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6630732275156994,"acs":170315,"articleLive":2,"columnArticles":1177,"formTitle":"[287]寻找重复数","frequency":2.8858831229,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":256857,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.42445108483824867,"acs":3267,"articleLive":2,"columnArticles":52,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"","submitted":7697,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7530175059181109,"acs":51532,"articleLive":2,"columnArticles":805,"formTitle":"[289]生命游戏","frequency":0.8446288607,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":68434,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.4570624746214978,"acs":78793,"articleLive":2,"columnArticles":1047,"formTitle":"[290]单词规律","frequency":1.2674857115,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":172390,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5357946870778928,"acs":2380,"articleLive":2,"columnArticles":50,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"","submitted":4442,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.6965393824409077,"acs":84073,"articleLive":2,"columnArticles":551,"formTitle":"[292]Nim 游戏","frequency":2.0361303323,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"","submitted":120701,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7105622063949083,"acs":4689,"articleLive":2,"columnArticles":78,"formTitle":"[293]翻转游戏","frequency":0.272605588,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"","submitted":6599,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5865815798551225,"acs":3401,"articleLive":2,"columnArticles":49,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"","submitted":5798,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5214082276611083,"acs":44120,"articleLive":2,"columnArticles":350,"formTitle":"[295]数据流的中位数","frequency":3.0101676189,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":84617,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6183574879227053,"acs":2304,"articleLive":2,"columnArticles":41,"formTitle":"[296]最佳的碰头地点","frequency":1.2762885852,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"","submitted":3726,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.556944766603115,"acs":98445,"articleLive":2,"columnArticles":714,"formTitle":"[297]二叉树的序列化与反序列化","frequency":2.7387839282,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":176759,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5796843177189409,"acs":4554,"articleLive":2,"columnArticles":78,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"","submitted":7856,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5038240751981409,"acs":29051,"articleLive":2,"columnArticles":339,"formTitle":"[299]猜数字游戏","frequency":1.1762496627,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":57661,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5101426940109365,"acs":329694,"articleLive":2,"columnArticles":1871,"formTitle":"[300]最长递增子序列","frequency":3.7260287818,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":646278,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5220670151683949,"acs":30460,"articleLive":2,"columnArticles":217,"formTitle":"[301]删除无效的括号","frequency":2.4610598086,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":58345,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6713973799126638,"acs":1845,"articleLive":2,"columnArticles":32,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"","submitted":2748,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7234799092397393,"acs":125947,"articleLive":2,"columnArticles":774,"formTitle":"[303]区域和检索 - 数组不可变","frequency":2.929784099,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":174085,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.538053928161983,"acs":59604,"articleLive":2,"columnArticles":544,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":2.7387839282,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":110777,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3767084282460137,"acs":3969,"articleLive":2,"columnArticles":60,"formTitle":"[305]岛屿数量 II","frequency":0.3284392341,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"","submitted":10536,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3369055874256656,"acs":16033,"articleLive":2,"columnArticles":238,"formTitle":"[306]累加数","frequency":1.8925974165,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":47589,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5435085193184546,"acs":22648,"articleLive":2,"columnArticles":220,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.8446288607,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":41670,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6043103448275862,"acs":2103,"articleLive":2,"columnArticles":39,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"","submitted":3480,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6038382644757084,"acs":108331,"articleLive":2,"columnArticles":877,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":3.4669781849,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":179404,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.37884016028495104,"acs":20421,"articleLive":2,"columnArticles":203,"formTitle":"[310]最小高度树","frequency":2.0769412187,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":53904,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7633447880870561,"acs":3332,"articleLive":2,"columnArticles":43,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.8766008934,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"","submitted":4365,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6820452391321055,"acs":53250,"articleLive":2,"columnArticles":364,"formTitle":"[312]戳气球","frequency":2.6117200835,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":78074,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6577741489343976,"acs":39475,"articleLive":2,"columnArticles":346,"formTitle":"[313]超级丑数","frequency":1.5713388174,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":60013,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5473240179277616,"acs":4152,"articleLive":2,"columnArticles":84,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"","submitted":7586,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4188085618499097,"acs":48720,"articleLive":2,"columnArticles":468,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":2.8261180821,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":116330,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47697812232119563,"acs":63989,"articleLive":2,"columnArticles":497,"formTitle":"[316]去除重复字母","frequency":2.7353818701,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":134155,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4851570166830226,"acs":3955,"articleLive":2,"columnArticles":61,"formTitle":"[317]离建筑物最近的距离","frequency":0.2999147674,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"","submitted":8152,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6819359783917948,"acs":18683,"articleLive":2,"columnArticles":162,"formTitle":"[318]最大单词长度乘积","frequency":0.2999147674,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":27397,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5154326035655039,"acs":22060,"articleLive":2,"columnArticles":211,"formTitle":"[319]灯泡开关","frequency":0.8139139155,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":42799,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6700143472022956,"acs":2802,"articleLive":2,"columnArticles":44,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"","submitted":4182,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.425947262731672,"acs":25878,"articleLive":2,"columnArticles":222,"formTitle":"[321]拼接最大数","frequency":1.6191673668,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":60754,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4422228502347197,"acs":281665,"articleLive":2,"columnArticles":1726,"formTitle":"[322]零钱兑换","frequency":3.8022625982,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":636930,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6345415500748357,"acs":9751,"articleLive":2,"columnArticles":131,"formTitle":"[323]无向图中连通分量的数目","frequency":1.6511803438,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"","submitted":15367,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3766928291677808,"acs":23949,"articleLive":2,"columnArticles":161,"formTitle":"[324]摆动排序 II","frequency":1.8243231686,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"","submitted":63577,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.53783218503937,"acs":8743,"articleLive":2,"columnArticles":96,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":1.7608063999,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"","submitted":16256,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.48924177350935305,"acs":92612,"articleLive":2,"columnArticles":369,"formTitle":"[326]3的幂","frequency":1.1156189128,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"","submitted":189297,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42470536109880375,"acs":23964,"articleLive":2,"columnArticles":200,"formTitle":"[327]区间和的个数","frequency":1.7546924166,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":56425,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6567922200682507,"acs":122985,"articleLive":2,"columnArticles":1026,"formTitle":"[328]奇偶链表","frequency":2.9041361874,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":187251,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.48214646882527074,"acs":52445,"articleLive":2,"columnArticles":462,"formTitle":"[329]矩阵中的最长递增路径","frequency":2.71044914,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":108774,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5344193529851176,"acs":18601,"articleLive":2,"columnArticles":147,"formTitle":"[330]按要求补齐数组","frequency":1.6511803438,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":34806,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.47982244629548443,"acs":43779,"articleLive":2,"columnArticles":493,"formTitle":"[331]验证二叉树的前序序列化","frequency":2.7827111811,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":91240,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4484707806655682,"acs":37289,"articleLive":2,"columnArticles":313,"formTitle":"[332]重新安排行程","frequency":2.2210057851,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":83147,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4651584676128481,"acs":4359,"articleLive":2,"columnArticles":74,"formTitle":"[333]最大 BST 子树","frequency":0.8766008934,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"","submitted":9371,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4135173004320243,"acs":42498,"articleLive":2,"columnArticles":276,"formTitle":"[334]递增的三元子序列","frequency":0.2212991324,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":102772,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.36938612808929044,"acs":2780,"articleLive":2,"columnArticles":35,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":7526,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4017492280098371,"acs":21727,"articleLive":2,"columnArticles":185,"formTitle":"[336]回文对","frequency":1.6511803438,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":54081,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.609124641592174,"acs":122791,"articleLive":2,"columnArticles":893,"formTitle":"[337]打家劫舍 III","frequency":3.3626082587,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":201586,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.787401738659952,"acs":151352,"articleLive":2,"columnArticles":1321,"formTitle":"[338]比特位计数","frequency":3.3626082587,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":192217,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.809341155234657,"acs":3587,"articleLive":2,"columnArticles":55,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"","submitted":4432,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.493841857057827,"acs":10786,"articleLive":2,"columnArticles":166,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":1.3501774273,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"","submitted":21841,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7270680343188474,"acs":49405,"articleLive":2,"columnArticles":478,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":3.4601196827,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":67951,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5151474333855799,"acs":84138,"articleLive":2,"columnArticles":749,"formTitle":"[342]4的幂","frequency":2.2836044414,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":163328,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6037475741941591,"acs":102043,"articleLive":2,"columnArticles":988,"formTitle":"[343]整数拆分","frequency":2.9490332304,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":169016,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7641604560386127,"acs":341028,"articleLive":2,"columnArticles":1815,"formTitle":"[344]反转字符串","frequency":3.2682876881,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":446278,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.538242414876629,"acs":104489,"articleLive":2,"columnArticles":1006,"formTitle":"[345]反转字符串中的元音字母","frequency":1.4100755689,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":194130,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7058108436664235,"acs":11612,"articleLive":2,"columnArticles":128,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"ac","submitted":16452,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6223575767525857,"acs":189539,"articleLive":2,"columnArticles":1402,"formTitle":"[347]前 K 个高频元素","frequency":3.7647675787,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"","submitted":304550,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6001302083333333,"acs":4609,"articleLive":2,"columnArticles":75,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"","submitted":7680,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7381520070549041,"acs":203400,"articleLive":2,"columnArticles":1433,"formTitle":"[349]两个数组的交集","frequency":3.3311788962,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":275553,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5492003445910829,"acs":231416,"articleLive":2,"columnArticles":1290,"formTitle":"[350]两个数组的交集 II","frequency":2.9620814323,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":421369,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.588796587337225,"acs":5245,"articleLive":2,"columnArticles":99,"formTitle":"[351]安卓系统手势解锁","frequency":0.9447123192,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"","submitted":8908,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.5929203539823009,"acs":4221,"articleLive":2,"columnArticles":80,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"","submitted":7119,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.42502606882168925,"acs":2038,"articleLive":2,"columnArticles":47,"formTitle":"[353]贪吃蛇","frequency":0.3582743826,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"","submitted":4795,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4504744837698041,"acs":66363,"articleLive":2,"columnArticles":516,"formTitle":"[354]俄罗斯套娃信封问题","frequency":3.7059824378,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":147318,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.40681408308827116,"acs":25039,"articleLive":2,"columnArticles":414,"formTitle":"[355]设计推特","frequency":1.7920101796,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":61549,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.3520730850316233,"acs":1503,"articleLive":2,"columnArticles":39,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"","submitted":4269,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5193410987482615,"acs":23898,"articleLive":2,"columnArticles":369,"formTitle":"[357]计算各个位数不同的数字个数","frequency":2.1497598147,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":46016,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35185644587778053,"acs":4255,"articleLive":2,"columnArticles":58,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"","submitted":12093,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7239391513210568,"acs":4521,"articleLive":2,"columnArticles":52,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"","submitted":6245,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6058016640431751,"acs":2694,"articleLive":2,"columnArticles":59,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"","submitted":4447,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5652901785714286,"acs":3039,"articleLive":2,"columnArticles":59,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"","submitted":5376,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6960985626283368,"acs":3051,"articleLive":2,"columnArticles":59,"formTitle":"[362]敲击计数器","frequency":0.3895269261,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"","submitted":4383,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.4907323930748896,"acs":32115,"articleLive":2,"columnArticles":211,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":2.7125611178,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":65443,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.71712158808933,"acs":1734,"articleLive":2,"columnArticles":47,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"","submitted":2418,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.36345069484526926,"acs":32744,"articleLive":2,"columnArticles":474,"formTitle":"[365]水壶问题","frequency":2.067716061,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":90092,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7648165569143932,"acs":4065,"articleLive":2,"columnArticles":117,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"","submitted":5315,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.43909707038465967,"acs":72498,"articleLive":2,"columnArticles":572,"formTitle":"[367]有效的完全平方数","frequency":0.1971550335,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":165107,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4588533762203547,"acs":40514,"articleLive":2,"columnArticles":441,"formTitle":"[368]最大整除子集","frequency":3.4333841626,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":88294,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6161601817665436,"acs":4339,"articleLive":2,"columnArticles":117,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"","submitted":7042,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7175169640613219,"acs":2855,"articleLive":2,"columnArticles":43,"formTitle":"[370]区间加法","frequency":0.2999147674,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"","submitted":3979,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.5792010421189753,"acs":53356,"articleLive":2,"columnArticles":306,"formTitle":"[371]两整数之和","frequency":2.3165346477,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":92120,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5058458511483598,"acs":13369,"articleLive":2,"columnArticles":131,"formTitle":"[372]超级次方","frequency":0.2999147674,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":26429,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4283284799068142,"acs":18386,"articleLive":2,"columnArticles":184,"formTitle":"[373]查找和最小的K对数字","frequency":2.1814749464,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":42925,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5141467499838949,"acs":79811,"articleLive":2,"columnArticles":546,"formTitle":"[374]猜数字大小","frequency":1.6511803438,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":155230,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.46686636711599266,"acs":14027,"articleLive":2,"columnArticles":116,"formTitle":"[375]猜数字大小 II","frequency":1.6191673668,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":30045,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4614842014358136,"acs":70003,"articleLive":2,"columnArticles":765,"formTitle":"[376]摆动序列","frequency":1.5583953284,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"","submitted":151691,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5067801500288517,"acs":59721,"articleLive":2,"columnArticles":517,"formTitle":"[377]组合总和 Ⅳ","frequency":2.8178086596,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":117844,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6389822891004727,"acs":76775,"articleLive":2,"columnArticles":547,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":2.5071863558,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":120152,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6453333333333333,"acs":2904,"articleLive":2,"columnArticles":65,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"","submitted":4500,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.501888552110049,"acs":32289,"articleLive":2,"columnArticles":199,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":1.6191673668,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":64335,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.4433124012132086,"acs":20755,"articleLive":2,"columnArticles":173,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.2999147674,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":46818,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6262222600119037,"acs":14730,"articleLive":2,"columnArticles":117,"formTitle":"[382]链表随机节点","frequency":1.4744064273,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":23522,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.5936688694831248,"acs":60369,"articleLive":2,"columnArticles":660,"formTitle":"[383]赎金信","frequency":0.6937030947,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":101688,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5748378822203842,"acs":47957,"articleLive":2,"columnArticles":187,"formTitle":"[384]打乱数组","frequency":2.6793133746,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":83427,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4145941833928258,"acs":7085,"articleLive":2,"columnArticles":82,"formTitle":"[385]迷你语法分析器","frequency":0.2464260825,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17089,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7457802889429266,"acs":20855,"articleLive":2,"columnArticles":227,"formTitle":"[386]字典序排数","frequency":2.6449220898,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":27964,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.529947325749193,"acs":207857,"articleLive":2,"columnArticles":1128,"formTitle":"[387]字符串中的第一个唯一字符","frequency":2.8414048623,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":392222,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5237058767862213,"acs":5534,"articleLive":2,"columnArticles":101,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":10567,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6925207163096776,"acs":97027,"articleLive":2,"columnArticles":958,"formTitle":"[389]找不同","frequency":1.1156189128,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":140107,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46658818641368327,"acs":6738,"articleLive":2,"columnArticles":92,"formTitle":"[390]消除游戏","frequency":1.8578233982,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":14441,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.35388870810283113,"acs":4350,"articleLive":2,"columnArticles":64,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":12292,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5141718088906493,"acs":138903,"articleLive":2,"columnArticles":1515,"formTitle":"[392]判断子序列","frequency":2.7699550926,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"","submitted":270149,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3911370134154388,"acs":10671,"articleLive":2,"columnArticles":125,"formTitle":"[393]UTF-8 编码验证","frequency":1.6843795154,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":27282,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5510337862116518,"acs":113481,"articleLive":2,"columnArticles":1237,"formTitle":"[394]字符串解码","frequency":4.181755448,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":205942,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5200832334951763,"acs":49488,"articleLive":2,"columnArticles":418,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":3.0895002453,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":95154,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.42249075215782983,"acs":8566,"articleLive":2,"columnArticles":141,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":20275,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37796530462953287,"acs":14467,"articleLive":2,"columnArticles":177,"formTitle":"[397]整数替换","frequency":1.1762496627,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":38276,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6520756169127904,"acs":13556,"articleLive":2,"columnArticles":114,"formTitle":"[398]随机数索引","frequency":1.9718656439,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":20789,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5920340806910479,"acs":40163,"articleLive":2,"columnArticles":510,"formTitle":"[399]除法求值","frequency":1.4416488308,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":67839,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4128,"acs":18060,"articleLive":2,"columnArticles":187,"formTitle":"[400]第 N 位数字","frequency":2.3165346477,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":43750,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6139097963708501,"acs":52609,"articleLive":2,"columnArticles":652,"formTitle":"[401]二进制手表","frequency":2.4290826636,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":85695,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3277997477608431,"acs":76674,"articleLive":2,"columnArticles":563,"formTitle":"[402]移掉 K 位数字","frequency":3.2618858225,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":233905,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45621193791137815,"acs":44498,"articleLive":2,"columnArticles":450,"formTitle":"[403]青蛙过河","frequency":3.280087235,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":97538,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5814607781438567,"acs":94242,"articleLive":2,"columnArticles":1071,"formTitle":"[404]左叶子之和","frequency":2.6471769331,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":162078,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5229629331346769,"acs":25974,"articleLive":2,"columnArticles":267,"formTitle":"[405]数字转换为十六进制数","frequency":2.2143006507,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"","submitted":49667,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7349869877443467,"acs":112686,"articleLive":2,"columnArticles":765,"formTitle":"[406]根据身高重建队列","frequency":2.7323480713,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":153317,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.4829118077641476,"acs":9566,"articleLive":2,"columnArticles":124,"formTitle":"[407]接雨水 II","frequency":2.2143006507,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":19809,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3247528628755995,"acs":3318,"articleLive":2,"columnArticles":76,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"","submitted":10217,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5551396145289104,"acs":88829,"articleLive":2,"columnArticles":1264,"formTitle":"[409]最长回文串","frequency":3.1268593399,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":160012,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5611539101875256,"acs":37076,"articleLive":2,"columnArticles":300,"formTitle":"[410]分割数组的最大值","frequency":3.4634323334,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":66071,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.49510086455331415,"acs":859,"articleLive":2,"columnArticles":21,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"","submitted":1735,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6721781452096807,"acs":70574,"articleLive":2,"columnArticles":356,"formTitle":"[412]Fizz Buzz","frequency":1.1762496627,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"","submitted":104993,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6857751233445858,"acs":66023,"articleLive":2,"columnArticles":868,"formTitle":"[413]等差数列划分","frequency":1.7920101796,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":96275,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.3645322651981885,"acs":58518,"articleLive":2,"columnArticles":808,"formTitle":"[414]第三大的数","frequency":1.7920101796,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":160529,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.535044319159991,"acs":137989,"articleLive":2,"columnArticles":1021,"formTitle":"[415]字符串相加","frequency":4.3372301672,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":257902,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5059002049628247,"acs":159696,"articleLive":2,"columnArticles":921,"formTitle":"[416]分割等和子集","frequency":3.1736352715,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":315667,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.47581263918258887,"acs":25426,"articleLive":2,"columnArticles":294,"formTitle":"[417]太平洋大西洋水流问题","frequency":2.8354903976,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":53437,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3597261235955056,"acs":2049,"articleLive":2,"columnArticles":32,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"","submitted":5696,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7564338235294118,"acs":11522,"articleLive":2,"columnArticles":149,"formTitle":"[419]甲板上的战舰","frequency":0.7559182479,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":15232,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20531757754800592,"acs":2641,"articleLive":2,"columnArticles":49,"formTitle":"[420]强密码检验器","frequency":0.9810799634,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":12863,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6222247874100582,"acs":32342,"articleLive":2,"columnArticles":296,"formTitle":"[421]数组中两个数的最大异或值","frequency":2.8700031811,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":51978,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.42703074804956404,"acs":1861,"articleLive":2,"columnArticles":44,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"","submitted":4358,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5695175750675964,"acs":8004,"articleLive":2,"columnArticles":133,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14054,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5300782881561051,"acs":49495,"articleLive":2,"columnArticles":440,"formTitle":"[424]替换后的最长重复字符","frequency":3.1333861818,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"","submitted":93373,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6110183639398998,"acs":1464,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"","submitted":2396,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6685612040837806,"acs":6352,"articleLive":2,"columnArticles":111,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":1.3796086275,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"","submitted":9501,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6128284389489954,"acs":3965,"articleLive":2,"columnArticles":64,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6470,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6472898664571878,"acs":2472,"articleLive":2,"columnArticles":52,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"","submitted":3819,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6975416476783635,"acs":55103,"articleLive":2,"columnArticles":440,"formTitle":"[429]N 叉树的层序遍历","frequency":1.0322682102,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":78996,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5406451612903226,"acs":20950,"articleLive":2,"columnArticles":300,"formTitle":"[430]扁平化多级双向链表","frequency":1.4416488308,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":38750,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7260018639328985,"acs":779,"articleLive":2,"columnArticles":27,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"","submitted":1073,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.37752195585093756,"acs":6362,"articleLive":2,"columnArticles":84,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.8766008934,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":16852,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5330896703452681,"acs":15023,"articleLive":2,"columnArticles":205,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":28181,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.37403124121591774,"acs":37258,"articleLive":2,"columnArticles":510,"formTitle":"[434]字符串中的单词数","frequency":1.4100755689,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"","submitted":99612,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5102412062059436,"acs":87513,"articleLive":2,"columnArticles":794,"formTitle":"[435]无重叠区间","frequency":3.0184184908,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"","submitted":171513,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.48577989754460343,"acs":8250,"articleLive":2,"columnArticles":138,"formTitle":"[436]寻找右区间","frequency":0.3284392341,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":16983,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5668062474430245,"acs":94210,"articleLive":2,"columnArticles":784,"formTitle":"[437]路径总和 III","frequency":2.5859620593,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"","submitted":166212,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5156619846924676,"acs":85834,"articleLive":2,"columnArticles":734,"formTitle":"[438]找到字符串中所有字母异位词","frequency":2.3809101204,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":166454,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5882229673093042,"acs":2807,"articleLive":2,"columnArticles":66,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"","submitted":4772,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.3793572647881052,"acs":15334,"articleLive":2,"columnArticles":117,"formTitle":"[440]字典序的第K小数字","frequency":3.3626082587,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":40421,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4258493771234428,"acs":45123,"articleLive":2,"columnArticles":450,"formTitle":"[441]排列硬币","frequency":1.1762496627,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":105960,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6960428281588324,"acs":40825,"articleLive":2,"columnArticles":400,"formTitle":"[442]数组中重复的数据","frequency":3.1419368966,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":58653,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.475333171140486,"acs":52752,"articleLive":2,"columnArticles":658,"formTitle":"[443]压缩字符串","frequency":2.0570677506,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"","submitted":110979,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2479169941833045,"acs":3154,"articleLive":2,"columnArticles":50,"formTitle":"[444]序列重建","frequency":0.9099262031,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"","submitted":12722,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5873302088533556,"acs":78825,"articleLive":2,"columnArticles":901,"formTitle":"[445]两数相加 II","frequency":3.3626082587,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":134209,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5514941380424881,"acs":18769,"articleLive":2,"columnArticles":167,"formTitle":"[446]等差数列划分 II - 子序列","frequency":1.300216988,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":34033,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6042584009269989,"acs":20859,"articleLive":2,"columnArticles":162,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"","submitted":34520,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6468705760373258,"acs":129770,"articleLive":2,"columnArticles":1028,"formTitle":"[448]找到所有数组中消失的数字","frequency":2.9088348922,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":200612,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5537842498562943,"acs":14451,"articleLive":2,"columnArticles":132,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.272605588,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":26095,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.48355524204214795,"acs":54840,"articleLive":2,"columnArticles":574,"formTitle":"[450]删除二叉搜索树中的节点","frequency":2.2265276103,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":113410,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7108409616189557,"acs":78120,"articleLive":2,"columnArticles":907,"formTitle":"[451]根据字符出现频率排序","frequency":2.8480628539,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":109898,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5093192594265071,"acs":90231,"articleLive":2,"columnArticles":792,"formTitle":"[452]用最少数量的箭引爆气球","frequency":2.3762632719,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":177160,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5541788402891813,"acs":25986,"articleLive":2,"columnArticles":289,"formTitle":"[453]最小操作次数使数组元素相等","frequency":1.3796086275,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":46891,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.5992845512805088,"acs":74717,"articleLive":2,"columnArticles":464,"formTitle":"[454]四数相加 II","frequency":2.6793133746,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"","submitted":124677,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5775207426536856,"acs":142900,"articleLive":2,"columnArticles":1171,"formTitle":"[455]分发饼干","frequency":2.7646894283,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"","submitted":247437,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.36212035663169506,"acs":55156,"articleLive":2,"columnArticles":441,"formTitle":"[456]132 模式","frequency":3.4866059004,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":152314,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43510163299715865,"acs":27870,"articleLive":2,"columnArticles":329,"formTitle":"[457]环形数组是否存在循环","frequency":1.4541032225,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":64054,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6073214454193792,"acs":6437,"articleLive":2,"columnArticles":59,"formTitle":"[458]可怜的小猪","frequency":0.7843696691,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":10599,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5115290115290115,"acs":75782,"articleLive":2,"columnArticles":615,"formTitle":"[459]重复的子字符串","frequency":2.5071863558,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":148148,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4398819184061783,"acs":31441,"articleLive":2,"columnArticles":386,"formTitle":"[460]LFU 缓存","frequency":3.0300885964,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":71476,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8114832059358116,"acs":162958,"articleLive":2,"columnArticles":1311,"formTitle":"[461]汉明距离","frequency":2.7775276737,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":200815,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6026609947051635,"acs":13317,"articleLive":2,"columnArticles":122,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":1.8243231686,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":22097,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.715062959634322,"acs":73994,"articleLive":2,"columnArticles":882,"formTitle":"[463]岛屿的周长","frequency":1.7920101796,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":103479,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.35832879695155145,"acs":10532,"articleLive":2,"columnArticles":105,"formTitle":"[464]我能赢吗","frequency":1.8578233982,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":29392,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5285864608909154,"acs":1507,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"","submitted":2851,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37362493879549535,"acs":11446,"articleLive":2,"columnArticles":178,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":30635,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44001697882952195,"acs":8293,"articleLive":2,"columnArticles":108,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.8139139155,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":18847,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.24778943485478078,"acs":22839,"articleLive":2,"columnArticles":286,"formTitle":"[468]验证IP地址","frequency":2.4941480215,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":92171,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4383127180463051,"acs":1382,"articleLive":2,"columnArticles":20,"formTitle":"[469]凸多边形","frequency":1.2082968401,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"","submitted":3153,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5557028720986293,"acs":32273,"articleLive":2,"columnArticles":155,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":3.1419368966,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"","submitted":58076,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6193152784874808,"acs":1212,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":0.6450553705,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"","submitted":1957,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.4115552037989711,"acs":6240,"articleLive":2,"columnArticles":78,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":15162,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4196253844003355,"acs":19513,"articleLive":2,"columnArticles":171,"formTitle":"[473]火柴拼正方形","frequency":1.9393348944,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":46501,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6096804326029017,"acs":71143,"articleLive":2,"columnArticles":577,"formTitle":"[474]一和零","frequency":3.1268593399,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":116689,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.3293238135237295,"acs":19603,"articleLive":2,"columnArticles":226,"formTitle":"[475]供暖器","frequency":1.4744064273,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":59525,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7011667941851568,"acs":36657,"articleLive":2,"columnArticles":460,"formTitle":"[476]数字的补数","frequency":0.2464260825,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":52280,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6035909863410336,"acs":38357,"articleLive":2,"columnArticles":327,"formTitle":"[477]汉明距离总和","frequency":2.2836044414,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":63548,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4358336295769641,"acs":6130,"articleLive":2,"columnArticles":48,"formTitle":"[478]在圆内随机生成点","frequency":1.4744064273,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":14065,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.41334085460442815,"acs":2931,"articleLive":2,"columnArticles":23,"formTitle":"[479]最大回文数乘积","frequency":0.4915652692,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","submitted":7091,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4483981318046205,"acs":28706,"articleLive":2,"columnArticles":399,"formTitle":"[480]滑动窗口中位数","frequency":2.1694555709,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":64019,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5343526808168192,"acs":5312,"articleLive":2,"columnArticles":93,"formTitle":"[481]神奇字符串","frequency":0.272605588,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":9941,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.42497168088401877,"acs":18383,"articleLive":2,"columnArticles":216,"formTitle":"[482]密钥格式化","frequency":0.7284892108,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"","submitted":43257,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5896621992319148,"acs":15047,"articleLive":2,"columnArticles":114,"formTitle":"[483]最小好进制","frequency":1.5295016046,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":25518,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6419294990723562,"acs":1384,"articleLive":2,"columnArticles":33,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"","submitted":2156,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6059053310009237,"acs":117419,"articleLive":2,"columnArticles":950,"formTitle":"[485]最大连续 1 的个数","frequency":2.3981459832,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":193791,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5881701723865254,"acs":44628,"articleLive":2,"columnArticles":394,"formTitle":"[486]预测赢家","frequency":2.0055842799,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":75876,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5784441034116398,"acs":4900,"articleLive":2,"columnArticles":97,"formTitle":"[487]最大连续1的个数 II","frequency":1.7920101796,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"","submitted":8471,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3893534330467554,"acs":3306,"articleLive":2,"columnArticles":69,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":8491,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7178757705073494,"acs":1514,"articleLive":2,"columnArticles":23,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"","submitted":2109,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.48283858998144713,"acs":6246,"articleLive":2,"columnArticles":73,"formTitle":"[490]迷宫","frequency":0.3895269261,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"","submitted":12936,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.547765783936553,"acs":43996,"articleLive":2,"columnArticles":375,"formTitle":"[491]递增子序列","frequency":2.4761886902,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":80319,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5496196657757937,"acs":18714,"articleLive":2,"columnArticles":173,"formTitle":"[492]构造矩形","frequency":0.272605588,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":34049,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3440075503801776,"acs":25879,"articleLive":2,"columnArticles":264,"formTitle":"[493]翻转对","frequency":1.928741575,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":75228,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.5006449567266464,"acs":138948,"articleLive":2,"columnArticles":986,"formTitle":"[494]目标和","frequency":3.6055760079,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":277538,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5411465227573566,"acs":26573,"articleLive":2,"columnArticles":406,"formTitle":"[495]提莫攻击","frequency":1.1762496627,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":49105,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6870017280687742,"acs":94618,"articleLive":2,"columnArticles":984,"formTitle":"[496]下一个更大元素 I","frequency":2.6067125617,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":137726,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4034140647796907,"acs":2765,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":6854,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4589350078208238,"acs":40490,"articleLive":2,"columnArticles":420,"formTitle":"[498]对角线遍历","frequency":2.6471769331,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":88226,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.367827868852459,"acs":2513,"articleLive":2,"columnArticles":47,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"","submitted":6832,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.707516498447205,"acs":29161,"articleLive":2,"columnArticles":440,"formTitle":"[500]键盘行","frequency":0.7559182479,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":41216,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5105018464785017,"acs":61930,"articleLive":2,"columnArticles":516,"formTitle":"[501]二叉搜索树中的众数","frequency":2.1912026495,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":121312,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.41696451365841203,"acs":6533,"articleLive":2,"columnArticles":89,"formTitle":"[502]IPO","frequency":1.5084348891,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"","submitted":15668,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6333040964168535,"acs":97475,"articleLive":2,"columnArticles":942,"formTitle":"[503]下一个更大元素 II","frequency":3.1822649419,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":153915,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5050772549501044,"acs":28799,"articleLive":2,"columnArticles":305,"formTitle":"[504]七进制数","frequency":1.1762496627,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":57019,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.48222608059947,"acs":5277,"articleLive":2,"columnArticles":64,"formTitle":"[505]迷宫 II","frequency":0.8766008934,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"","submitted":10943,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5627130197682345,"acs":19812,"articleLive":2,"columnArticles":268,"formTitle":"[506]相对名次","frequency":0.7284892108,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":35208,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.40816982013548236,"acs":27958,"articleLive":2,"columnArticles":221,"formTitle":"[507]完美数","frequency":1.1453830147,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":68496,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6736704825387625,"acs":13947,"articleLive":2,"columnArticles":197,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.8446288607,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":20703,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6777929517208189,"acs":216889,"articleLive":2,"columnArticles":1361,"formTitle":"[509]斐波那契数","frequency":3.1663283497,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":319993,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6128461991750147,"acs":3120,"articleLive":2,"columnArticles":53,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.3895269261,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"","submitted":5091,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7338096431854266,"acs":17563,"articleLive":2,"columnArticles":99,"formTitle":"[511]游戏玩法分析 I","frequency":1.8243231686,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"","submitted":23934,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5374793936063613,"acs":16628,"articleLive":2,"columnArticles":142,"formTitle":"[512]游戏玩法分析 II","frequency":0.272605588,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"","submitted":30937,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7304528694336768,"acs":46356,"articleLive":2,"columnArticles":525,"formTitle":"[513]找树左下角的值","frequency":0.2212991324,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":63462,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5018893670620342,"acs":19126,"articleLive":2,"columnArticles":234,"formTitle":"[514]自由之路","frequency":2.4789653899,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":38108,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6431181485992692,"acs":35376,"articleLive":2,"columnArticles":389,"formTitle":"[515]在每个树行中找最大值","frequency":1.6843795154,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":55007,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6509894922621868,"acs":79672,"articleLive":2,"columnArticles":588,"formTitle":"[516]最长回文子序列","frequency":1.7337695596,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":122386,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.4398927090953426,"acs":3608,"articleLive":2,"columnArticles":45,"formTitle":"[517]超级洗衣机","frequency":0.272605588,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"","submitted":8202,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.65,"acs":97929,"articleLive":2,"columnArticles":641,"formTitle":"[518]零钱兑换 II","frequency":3.3905040704,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":150660,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.39493316754740443,"acs":2541,"articleLive":2,"columnArticles":36,"formTitle":"[519]随机翻转矩阵","frequency":0.9447123192,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6434,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5627034998320898,"acs":38539,"articleLive":2,"columnArticles":617,"formTitle":"[520]检测大写字母","frequency":0.7843696691,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":68489,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7120138788492121,"acs":24625,"articleLive":2,"columnArticles":240,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.8139139155,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":34585,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.35803775265883403,"acs":6430,"articleLive":2,"columnArticles":99,"formTitle":"[522]最长特殊序列 II","frequency":0.8139139155,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":17959,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2742911137518981,"acs":66475,"articleLive":2,"columnArticles":585,"formTitle":"[523]连续的子数组和","frequency":2.8354903976,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":242352,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.47288169021029014,"acs":38363,"articleLive":2,"columnArticles":366,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":1.8243231686,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"","submitted":81126,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5364812178971471,"acs":43345,"articleLive":2,"columnArticles":497,"formTitle":"[525]连续数组","frequency":3.3626082587,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":80795,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7342674983946427,"acs":32017,"articleLive":2,"columnArticles":375,"formTitle":"[526]优美的排列","frequency":1.6403815692,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":43604,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5747677554689841,"acs":1918,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"","submitted":3337,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.46953655613264084,"acs":9402,"articleLive":2,"columnArticles":90,"formTitle":"[528]按权重随机选择","frequency":1.3796086275,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"","submitted":20024,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6464004070211142,"acs":38115,"articleLive":2,"columnArticles":454,"formTitle":"[529]扫雷游戏","frequency":1.7546924166,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":58965,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6205653086378626,"acs":74515,"articleLive":2,"columnArticles":615,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.7559182479,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":120076,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6637383177570093,"acs":3551,"articleLive":2,"columnArticles":73,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"","submitted":5350,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.3720493441317446,"acs":24761,"articleLive":2,"columnArticles":264,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.8139139155,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":66553,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.526100307062436,"acs":1542,"articleLive":2,"columnArticles":33,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"","submitted":2931,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6762052075277133,"acs":13115,"articleLive":2,"columnArticles":131,"formTitle":"[534]游戏玩法分析 III","frequency":0.7843696691,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"","submitted":19395,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8416309484558743,"acs":15316,"articleLive":2,"columnArticles":93,"formTitle":"[535]TinyURL 的加密与解密","frequency":1.4744064273,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18198,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5346017534042157,"acs":2866,"articleLive":2,"columnArticles":45,"formTitle":"[536]从字符串生成二叉树","frequency":0.3895269261,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"","submitted":5361,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7109226680167068,"acs":11234,"articleLive":2,"columnArticles":164,"formTitle":"[537]复数乘法","frequency":0.2999147674,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":15802,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.6945574617179672,"acs":103280,"articleLive":2,"columnArticles":787,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":1.8481258823,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":148699,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5938088829071333,"acs":13236,"articleLive":2,"columnArticles":168,"formTitle":"[539]最小时间差","frequency":1.4100755689,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":22290,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5810704704573709,"acs":35522,"articleLive":2,"columnArticles":370,"formTitle":"[540]有序数组中的单一元素","frequency":2.2483149645,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":61132,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6080825032481594,"acs":67395,"articleLive":2,"columnArticles":768,"formTitle":"[541]反转字符串 II","frequency":1.3348819318,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":110832,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45940769225145667,"acs":62841,"articleLive":2,"columnArticles":594,"formTitle":"[542]01 矩阵","frequency":2.067716061,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":136787,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5480911815743809,"acs":138974,"articleLive":2,"columnArticles":1175,"formTitle":"[543]二叉树的直径","frequency":3.5043880982,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":253560,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7098646034816247,"acs":2202,"articleLive":2,"columnArticles":49,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"","submitted":3102,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.4160852467334771,"acs":3280,"articleLive":2,"columnArticles":74,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"","submitted":7883,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6310410900574835,"acs":14820,"articleLive":2,"columnArticles":118,"formTitle":"[546]移除盒子","frequency":1.2082968401,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":23485,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6179722437329462,"acs":152421,"articleLive":2,"columnArticles":1070,"formTitle":"[547]省份数量","frequency":2.7323480713,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":246647,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.35666435666435664,"acs":1544,"articleLive":2,"columnArticles":39,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"","submitted":4329,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48388696083292015,"acs":1952,"articleLive":2,"columnArticles":47,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"","submitted":4034,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4385457864313964,"acs":11532,"articleLive":2,"columnArticles":166,"formTitle":"[550]游戏玩法分析 IV","frequency":1.4100755689,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"","submitted":26296,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.566872733757356,"acs":57219,"articleLive":2,"columnArticles":734,"formTitle":"[551]学生出勤记录 I","frequency":0.9998987348,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":100938,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5785012713765768,"acs":23206,"articleLive":2,"columnArticles":283,"formTitle":"[552]学生出勤记录 II","frequency":1.5015230562,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":40114,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6025695931477516,"acs":5628,"articleLive":2,"columnArticles":80,"formTitle":"[553]最优除法","frequency":0.272605588,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9340,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5002161596395822,"acs":43968,"articleLive":2,"columnArticles":480,"formTitle":"[554]砖墙","frequency":2.9115656421,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":87898,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3414012738853503,"acs":1072,"articleLive":2,"columnArticles":21,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"","submitted":3140,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32457843880257675,"acs":13705,"articleLive":2,"columnArticles":204,"formTitle":"[556]下一个更大元素 III","frequency":2.4789653899,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":42224,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7449462321833701,"acs":146446,"articleLive":2,"columnArticles":1182,"formTitle":"[557]反转字符串中的单词 III","frequency":2.883269494,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":196586,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5015105740181269,"acs":2822,"articleLive":2,"columnArticles":35,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5627,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7265167501154965,"acs":58186,"articleLive":2,"columnArticles":534,"formTitle":"[559]N 叉树的最大深度","frequency":1.5882625586,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":80089,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4469525522112923,"acs":138444,"articleLive":2,"columnArticles":858,"formTitle":"[560]和为K的子数组","frequency":3.8349335087,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":309751,"title":"和为K的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7733508322322624,"acs":87210,"articleLive":2,"columnArticles":725,"formTitle":"[561]数组拆分 I","frequency":1.1156189128,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"","submitted":112769,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4599536440896214,"acs":3572,"articleLive":2,"columnArticles":51,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"","submitted":7766,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6039928601916883,"acs":31131,"articleLive":2,"columnArticles":311,"formTitle":"[563]二叉树的坡度","frequency":1.3796086275,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":51542,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.1783645369826211,"acs":4249,"articleLive":2,"columnArticles":74,"formTitle":"[564]寻找最近的回文数","frequency":0.8446288607,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":23822,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6101228101860213,"acs":13513,"articleLive":2,"columnArticles":133,"formTitle":"[565]数组嵌套","frequency":0.7843696691,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":22148,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6971007064381699,"acs":62562,"articleLive":2,"columnArticles":578,"formTitle":"[566]重塑矩阵","frequency":1.4416488308,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":89746,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.42970107400014546,"acs":106345,"articleLive":2,"columnArticles":959,"formTitle":"[567]字符串的排列","frequency":2.6233076986,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":247486,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.4930939226519337,"acs":1071,"articleLive":2,"columnArticles":24,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"","submitted":2172,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5636924626912663,"acs":8952,"articleLive":2,"columnArticles":149,"formTitle":"[569]员工薪水中位数","frequency":1.2082968401,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"","submitted":15881,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6643932935493038,"acs":11690,"articleLive":2,"columnArticles":105,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.8139139155,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"","submitted":17595,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4895564421497301,"acs":6258,"articleLive":2,"columnArticles":95,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.8139139155,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"","submitted":12783,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4739333903891327,"acs":78081,"articleLive":2,"columnArticles":686,"formTitle":"[572]另一棵树的子树","frequency":2.4941480215,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":164751,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6601218686526743,"acs":975,"articleLive":2,"columnArticles":29,"formTitle":"[573]松鼠模拟","frequency":0.6937030947,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"","submitted":1477,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6473338528331293,"acs":11630,"articleLive":2,"columnArticles":108,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"","submitted":17966,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6845481148768204,"acs":40235,"articleLive":2,"columnArticles":402,"formTitle":"[575]分糖果","frequency":1.4416488308,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":58776,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4691940423427365,"acs":24666,"articleLive":2,"columnArticles":272,"formTitle":"[576]出界的路径数","frequency":1.3501774273,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":52571,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7070733222866611,"acs":13655,"articleLive":2,"columnArticles":78,"formTitle":"[577]员工奖金","frequency":0.8139139155,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"","submitted":19312,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4990090288482713,"acs":9064,"articleLive":2,"columnArticles":106,"formTitle":"[578]查询回答率最高的问题","frequency":0.272605588,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"","submitted":18164,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.4143565800992121,"acs":7100,"articleLive":2,"columnArticles":122,"formTitle":"[579]查询员工的累计薪水","frequency":0.8139139155,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"","submitted":17135,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5266682059570538,"acs":9124,"articleLive":2,"columnArticles":74,"formTitle":"[580]统计各专业学生人数","frequency":0.7843696691,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"","submitted":17324,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.4034757881122565,"acs":94212,"articleLive":2,"columnArticles":823,"formTitle":"[581]最短无序连续子数组","frequency":1.5228381339,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":233501,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.40209419031075083,"acs":8333,"articleLive":2,"columnArticles":128,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"","submitted":20724,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.580475049987915,"acs":26418,"articleLive":2,"columnArticles":252,"formTitle":"[583]两个字符串的删除操作","frequency":1.8481258823,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":45511,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7726631933803249,"acs":12606,"articleLive":2,"columnArticles":54,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"","submitted":16315,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5937740792109724,"acs":7706,"articleLive":2,"columnArticles":91,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"","submitted":12978,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7496027241770715,"acs":13208,"articleLive":2,"columnArticles":83,"formTitle":"[586]订单最多的客户","frequency":1.1762496627,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"","submitted":17620,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3790987535953979,"acs":1977,"articleLive":2,"columnArticles":36,"formTitle":"[587]安装栅栏","frequency":0.5994270179,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5215,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.43302280758111145,"acs":1348,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":0.3895269261,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"","submitted":3113,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7447076855703963,"acs":85027,"articleLive":2,"columnArticles":547,"formTitle":"[589]N 叉树的前序遍历","frequency":1.8925974165,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":114175,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.759571809081384,"acs":60171,"articleLive":2,"columnArticles":441,"formTitle":"[590]N 叉树的后序遍历","frequency":0.7843696691,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":79217,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3388756927949327,"acs":1712,"articleLive":2,"columnArticles":40,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5052,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5202519140528525,"acs":4213,"articleLive":2,"columnArticles":101,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8098,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44106079334756715,"acs":7850,"articleLive":2,"columnArticles":123,"formTitle":"[593]有效的正方形","frequency":1.1762496627,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":17798,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5156496284620581,"acs":27480,"articleLive":2,"columnArticles":258,"formTitle":"[594]最长和谐子序列","frequency":0.2212991324,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":53292,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7962011119090462,"acs":98674,"articleLive":2,"columnArticles":229,"formTitle":"[595]大的国家","frequency":1.9079139971,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":123931,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.42026028996258197,"acs":77048,"articleLive":2,"columnArticles":269,"formTitle":"[596]超过5名学生的课","frequency":1.1453830147,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":183334,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4408592108335279,"acs":9441,"articleLive":2,"columnArticles":78,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.8139139155,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"","submitted":21415,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5165767416607282,"acs":15223,"articleLive":2,"columnArticles":191,"formTitle":"[598]范围求和 II","frequency":0.272605588,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":29469,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5220527892818291,"acs":27354,"articleLive":2,"columnArticles":254,"formTitle":"[599]两个列表的最小索引总和","frequency":0.8446288607,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":52397,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.34316330145235563,"acs":3875,"articleLive":2,"columnArticles":67,"formTitle":"[600]不含连续1的非负整数","frequency":0.7843696691,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"","submitted":11292,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.49673800885397595,"acs":29847,"articleLive":2,"columnArticles":353,"formTitle":"[601]体育馆的人流量","frequency":2.7125611178,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":60086,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6278284363390746,"acs":7436,"articleLive":2,"columnArticles":81,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.3284392341,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"","submitted":11844,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6727664782329973,"acs":11544,"articleLive":2,"columnArticles":104,"formTitle":"[603]连续空余座位","frequency":1.2416110468,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"","submitted":17159,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37282626361124654,"acs":2294,"articleLive":2,"columnArticles":50,"formTitle":"[604]迭代压缩字符串","frequency":0.3582743826,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"","submitted":6153,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33507448559538744,"acs":104433,"articleLive":2,"columnArticles":1214,"formTitle":"[605]种花问题","frequency":2.6471769331,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":311671,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5672845150029091,"acs":27300,"articleLive":2,"columnArticles":298,"formTitle":"[606]根据二叉树创建字符串","frequency":1.1156189128,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":48124,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6645818441744102,"acs":11157,"articleLive":2,"columnArticles":82,"formTitle":"[607]销售员","frequency":0.272605588,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"","submitted":16788,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6586232697343809,"acs":7042,"articleLive":2,"columnArticles":90,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"","submitted":10692,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4805003107520199,"acs":6185,"articleLive":2,"columnArticles":95,"formTitle":"[609]在系统中查找重复文件","frequency":0.3284392341,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":12872,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6685491180366729,"acs":9589,"articleLive":2,"columnArticles":69,"formTitle":"[610]判断三角形","frequency":0.272605588,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"","submitted":14343,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.531899530088761,"acs":47880,"articleLive":2,"columnArticles":373,"formTitle":"[611]有效三角形的个数","frequency":2.428316004,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":90017,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6696165191740413,"acs":6810,"articleLive":2,"columnArticles":58,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"","submitted":10170,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8171757750322141,"acs":10781,"articleLive":2,"columnArticles":79,"formTitle":"[613]直线上的最近距离","frequency":0.272605588,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"","submitted":13193,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3472616444092876,"acs":7463,"articleLive":2,"columnArticles":60,"formTitle":"[614]二级关注者","frequency":0.8139139155,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"","submitted":21491,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42413703156247284,"acs":4878,"articleLive":2,"columnArticles":82,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.3582743826,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"","submitted":11501,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46087492298213184,"acs":2992,"articleLive":2,"columnArticles":52,"formTitle":"[616]给字符串添加加粗标签","frequency":1.8243231686,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"","submitted":6492,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7881018675721562,"acs":174072,"articleLive":2,"columnArticles":1141,"formTitle":"[617]合并二叉树","frequency":3.0705417325,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":220875,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6201199005702588,"acs":4241,"articleLive":2,"columnArticles":43,"formTitle":"[618]学生地理信息报告","frequency":1.4744064273,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"","submitted":6839,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4659015080742026,"acs":10473,"articleLive":2,"columnArticles":77,"formTitle":"[619]只出现一次的最大数字","frequency":0.272605588,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"","submitted":22479,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7723170117855345,"acs":88991,"articleLive":2,"columnArticles":297,"formTitle":"[620]有趣的电影","frequency":1.9079139971,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":115226,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.568270510995822,"acs":74265,"articleLive":2,"columnArticles":477,"formTitle":"[621]任务调度器","frequency":2.868247994,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":130686,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.435904155481737,"acs":61544,"articleLive":2,"columnArticles":397,"formTitle":"[622]设计循环队列","frequency":2.5284253404,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":141187,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.545360290305858,"acs":10520,"articleLive":2,"columnArticles":178,"formTitle":"[623]在二叉树中增加一行","frequency":0.2464260825,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":19290,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.41561014263074486,"acs":2098,"articleLive":2,"columnArticles":45,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"","submitted":5048,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.33962264150943394,"acs":2412,"articleLive":2,"columnArticles":50,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"","submitted":7102,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6829500850191492,"acs":42976,"articleLive":2,"columnArticles":330,"formTitle":"[626]换座位","frequency":2.1497598147,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":62927,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8066037735849056,"acs":81567,"articleLive":2,"columnArticles":317,"formTitle":"[627]变更性别","frequency":1.3796086275,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":101124,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5251243005974557,"acs":77522,"articleLive":2,"columnArticles":735,"formTitle":"[628]三个数的最大乘积","frequency":1.5882625586,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":147626,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40111076828139464,"acs":3900,"articleLive":2,"columnArticles":54,"formTitle":"[629]K个逆序对数组","frequency":1.2416110468,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":9723,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.36434492144005937,"acs":5890,"articleLive":2,"columnArticles":71,"formTitle":"[630]课程表 III","frequency":0.3284392341,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":16166,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28187361419068735,"acs":1017,"articleLive":2,"columnArticles":32,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"","submitted":3608,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5970617739378054,"acs":18451,"articleLive":2,"columnArticles":232,"formTitle":"[632]最小区间","frequency":0.8446288607,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":30903,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.399683905522873,"acs":91040,"articleLive":2,"columnArticles":736,"formTitle":"[633]平方数之和","frequency":2.929784099,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":227780,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.437,"acs":1311,"articleLive":2,"columnArticles":18,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"","submitted":3000,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5547587031226655,"acs":3713,"articleLive":2,"columnArticles":61,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"","submitted":6693,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5462700661000944,"acs":9256,"articleLive":2,"columnArticles":108,"formTitle":"[636]函数的独占时间","frequency":0.8139139155,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":16944,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6890670751808257,"acs":71069,"articleLive":2,"columnArticles":624,"formTitle":"[637]二叉树的层平均值","frequency":1.0322682102,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":103138,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5938824296425079,"acs":10931,"articleLive":2,"columnArticles":111,"formTitle":"[638]大礼包","frequency":0.8139139155,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":18406,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.31021619975639464,"acs":4075,"articleLive":2,"columnArticles":78,"formTitle":"[639]解码方法 II","frequency":1.2416110468,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"","submitted":13136,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4233239252259991,"acs":10349,"articleLive":2,"columnArticles":198,"formTitle":"[640]求解方程","frequency":1.2082968401,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":24447,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.533478056180363,"acs":20397,"articleLive":2,"columnArticles":229,"formTitle":"[641]设计循环双端队列","frequency":1.3796086275,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":38234,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4906562364189483,"acs":2258,"articleLive":2,"columnArticles":50,"formTitle":"[642]设计搜索自动补全系统","frequency":0.3895269261,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"","submitted":4602,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4521934425745061,"acs":61208,"articleLive":2,"columnArticles":559,"formTitle":"[643]子数组最大平均数 I","frequency":1.7920101796,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":135358,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4,"acs":1084,"articleLive":2,"columnArticles":22,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"","submitted":2710,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.43602552152393953,"acs":66425,"articleLive":2,"columnArticles":681,"formTitle":"[645]错误的集合","frequency":2.0361303323,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":152342,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5741789977446504,"acs":20876,"articleLive":2,"columnArticles":177,"formTitle":"[646]最长数对链","frequency":0.7559182479,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":36358,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6554583009996805,"acs":114873,"articleLive":2,"columnArticles":869,"formTitle":"[647]回文子串","frequency":2.9490332304,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":175256,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5809404058716884,"acs":19867,"articleLive":2,"columnArticles":255,"formTitle":"[648]单词替换","frequency":0.2464260825,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":34198,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4811816192560175,"acs":28587,"articleLive":2,"columnArticles":302,"formTitle":"[649]Dota2 参议院","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":59410,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5343354397161632,"acs":25452,"articleLive":2,"columnArticles":296,"formTitle":"[650]只有两个键的键盘","frequency":1.1762496627,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"","submitted":47633,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.580315088517135,"acs":3573,"articleLive":2,"columnArticles":59,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"","submitted":6157,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5709300995309461,"acs":29943,"articleLive":2,"columnArticles":215,"formTitle":"[652]寻找重复的子树","frequency":2.7125611178,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"","submitted":52446,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5934553609501098,"acs":37577,"articleLive":2,"columnArticles":356,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":63319,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8095618000768253,"acs":54796,"articleLive":2,"columnArticles":558,"formTitle":"[654]最大二叉树","frequency":2.1623172723,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":67686,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.595066736456425,"acs":9095,"articleLive":2,"columnArticles":132,"formTitle":"[655]输出二叉树","frequency":0.8446288607,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15284,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.30751445086705204,"acs":798,"articleLive":2,"columnArticles":24,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"","submitted":2595,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7831490104772992,"acs":80727,"articleLive":2,"columnArticles":607,"formTitle":"[657]机器人能否返回原点","frequency":0.8446288607,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":103080,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45270022715615155,"acs":24712,"articleLive":2,"columnArticles":224,"formTitle":"[658]找到 K 个最接近的元素","frequency":1.6511803438,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":54588,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5422305544163883,"acs":27766,"articleLive":2,"columnArticles":258,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":51207,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.646414342629482,"acs":649,"articleLive":2,"columnArticles":20,"formTitle":"[660]移除 9","frequency":0.6450553705,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"","submitted":1004,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.559782035507119,"acs":15923,"articleLive":2,"columnArticles":203,"formTitle":"[661]图片平滑器","frequency":0.272605588,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":28445,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.40589282368371743,"acs":25995,"articleLive":2,"columnArticles":251,"formTitle":"[662]二叉树最大宽度","frequency":2.8354903976,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":64044,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4649025069637883,"acs":1669,"articleLive":2,"columnArticles":33,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"","submitted":3590,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6557590041092579,"acs":21703,"articleLive":2,"columnArticles":187,"formTitle":"[664]奇怪的打印机","frequency":2.7149804934,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33096,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2698129711858502,"acs":72795,"articleLive":2,"columnArticles":914,"formTitle":"[665]非递减数列","frequency":2.3860480858,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":269798,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6184334696445423,"acs":1966,"articleLive":2,"columnArticles":73,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"","submitted":3179,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6239102357119793,"acs":7729,"articleLive":2,"columnArticles":115,"formTitle":"[667]优美的排列 II","frequency":0.7559182479,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12388,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5073242948418264,"acs":6511,"articleLive":2,"columnArticles":63,"formTitle":"[668]乘法表中第k小的数","frequency":1.6511803438,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":12834,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6668252175119409,"acs":33646,"articleLive":2,"columnArticles":286,"formTitle":"[669]修剪二叉搜索树","frequency":0.8139139155,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":50457,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.44917990106743033,"acs":17253,"articleLive":2,"columnArticles":265,"formTitle":"[670]最大交换","frequency":3.0912931637,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":38410,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48673410242506965,"acs":52064,"articleLive":2,"columnArticles":653,"formTitle":"[671]二叉树中第二小的节点","frequency":1.0429043454,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":106966,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5523488856822191,"acs":3445,"articleLive":2,"columnArticles":37,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.2464260825,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6237,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.38943217890136794,"acs":27358,"articleLive":2,"columnArticles":255,"formTitle":"[673]最长递增子序列的个数","frequency":2.3506536777,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":70251,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4897392290249433,"acs":86390,"articleLive":2,"columnArticles":733,"formTitle":"[674]最长连续递增序列","frequency":1.6457646793,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":176400,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.4004041570438799,"acs":2774,"articleLive":2,"columnArticles":46,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":6928,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5851939970717424,"acs":6395,"articleLive":2,"columnArticles":113,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":10928,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6154486140911678,"acs":14055,"articleLive":2,"columnArticles":229,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":22837,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.35087443505600313,"acs":17856,"articleLive":2,"columnArticles":218,"formTitle":"[678]有效的括号字符串","frequency":3.4949012611,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"","submitted":50890,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.540923251203625,"acs":24830,"articleLive":2,"columnArticles":255,"formTitle":"[679]24 点游戏","frequency":3.2943223509,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":45903,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4015590081163852,"acs":82475,"articleLive":2,"columnArticles":783,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":2.7646894283,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":205387,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5003075661267172,"acs":2440,"articleLive":2,"columnArticles":58,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"","submitted":4877,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6952744093011627,"acs":44492,"articleLive":2,"columnArticles":495,"formTitle":"[682]棒球比赛","frequency":1.4100755689,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":63992,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4275377299979326,"acs":2068,"articleLive":2,"columnArticles":47,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"","submitted":4837,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6663132972896568,"acs":56568,"articleLive":2,"columnArticles":584,"formTitle":"[684]冗余连接","frequency":1.4100755689,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":84897,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.434200262976087,"acs":19483,"articleLive":2,"columnArticles":252,"formTitle":"[685]冗余连接 II","frequency":1.4416488308,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":44871,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3543594532642839,"acs":16696,"articleLive":2,"columnArticles":186,"formTitle":"[686]重复叠加字符串匹配","frequency":0.3284392341,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":47116,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.43911047933406416,"acs":36451,"articleLive":2,"columnArticles":260,"formTitle":"[687]最长同值路径","frequency":2.3860480858,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":83011,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5096525096525096,"acs":7656,"articleLive":2,"columnArticles":102,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.272605588,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15022,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.48506039415130325,"acs":3052,"articleLive":2,"columnArticles":65,"formTitle":"[689]三个无重叠子数组的最大和","frequency":1.7188514244,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6292,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6462742308376311,"acs":54510,"articleLive":2,"columnArticles":555,"formTitle":"[690]员工的重要性","frequency":3.1754268409,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":84345,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.48838568298027757,"acs":3343,"articleLive":2,"columnArticles":44,"formTitle":"[691]贴纸拼词","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":6845,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.580934377531731,"acs":64536,"articleLive":2,"columnArticles":708,"formTitle":"[692]前K个高频单词","frequency":3.0782210822,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":111090,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6090404248611684,"acs":25115,"articleLive":2,"columnArticles":269,"formTitle":"[693]交替位二进制数","frequency":0.2212991324,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":41237,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5285106382978724,"acs":3726,"articleLive":2,"columnArticles":70,"formTitle":"[694]不同岛屿的数量","frequency":0.8446288607,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"","submitted":7050,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6621991483673199,"acs":114924,"articleLive":2,"columnArticles":1147,"formTitle":"[695]岛屿的最大面积","frequency":3.1479411175,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":173549,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6300838443248655,"acs":50350,"articleLive":2,"columnArticles":460,"formTitle":"[696]计数二进制子串","frequency":0.7843696691,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":79910,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6059495500536205,"acs":64979,"articleLive":2,"columnArticles":824,"formTitle":"[697]数组的度","frequency":1.6191673668,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":107235,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44028276703028707,"acs":26719,"articleLive":2,"columnArticles":201,"formTitle":"[698]划分为k个相等的子集","frequency":2.8103907783,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":60686,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47261287934863067,"acs":2554,"articleLive":2,"columnArticles":37,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5404,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7586871004753319,"acs":74060,"articleLive":2,"columnArticles":466,"formTitle":"[700]二叉搜索树中的搜索","frequency":1.2674857115,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":97616,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7240627271783155,"acs":69720,"articleLive":2,"columnArticles":519,"formTitle":"[701]二叉搜索树中的插入操作","frequency":1.4481029645,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":96290,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7380602498163116,"acs":4018,"articleLive":2,"columnArticles":74,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"","submitted":5444,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5118007378771029,"acs":57986,"articleLive":2,"columnArticles":527,"formTitle":"[703]数据流中的第 K 大元素","frequency":1.5295016046,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":113298,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5550723688161652,"acs":203333,"articleLive":2,"columnArticles":996,"formTitle":"[704]二分查找","frequency":3.8873776193,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":366318,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6472737665094821,"acs":63416,"articleLive":2,"columnArticles":417,"formTitle":"[705]设计哈希集合","frequency":2.6449220898,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":97974,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6447696139476962,"acs":53846,"articleLive":2,"columnArticles":373,"formTitle":"[706]设计哈希映射","frequency":2.1497598147,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":83512,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3174069601126441,"acs":57032,"articleLive":2,"columnArticles":402,"formTitle":"[707]设计链表","frequency":2.8354903976,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":179681,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.33646864686468647,"acs":2039,"articleLive":2,"columnArticles":48,"formTitle":"[708]循环有序列表的插入","frequency":0.3895269261,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"","submitted":6060,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7596588607525646,"acs":69388,"articleLive":2,"columnArticles":493,"formTitle":"[709]转换成小写字母","frequency":0.272605588,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":91341,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3503671289772306,"acs":4724,"articleLive":2,"columnArticles":55,"formTitle":"[710]黑名单中的随机数","frequency":1.2082968401,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":13483,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5740897544453852,"acs":678,"articleLive":2,"columnArticles":24,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"","submitted":1181,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6711854629362561,"acs":13962,"articleLive":2,"columnArticles":147,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":1.7920101796,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":20802,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4025070497910792,"acs":19555,"articleLive":2,"columnArticles":177,"formTitle":"[713]乘积小于K的子数组","frequency":2.0326862097,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":48583,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7166201922327979,"acs":92004,"articleLive":2,"columnArticles":629,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":2.0549526459,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":128386,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.4025710419485792,"acs":2380,"articleLive":2,"columnArticles":40,"formTitle":"[715]Range 模块","frequency":0.9810799634,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":5912,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4589873417721519,"acs":3626,"articleLive":2,"columnArticles":67,"formTitle":"[716]最大栈","frequency":0.272605588,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"ac","submitted":7900,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5102003763245634,"acs":30911,"articleLive":2,"columnArticles":370,"formTitle":"[717]1比特与2比特字符","frequency":0.8139139155,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":60586,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5637296269932708,"acs":76820,"articleLive":2,"columnArticles":552,"formTitle":"[718]最长重复子数组","frequency":3.3311788962,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":136271,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3665029383387422,"acs":8357,"articleLive":2,"columnArticles":78,"formTitle":"[719]找出第 k 小的距离对","frequency":0.8446288607,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":22802,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48618343042738565,"acs":18861,"articleLive":2,"columnArticles":246,"formTitle":"[720]词典中最长的单词","frequency":0.1391444643,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":38794,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4695252423938482,"acs":28087,"articleLive":2,"columnArticles":328,"formTitle":"[721]账户合并","frequency":2.1814749464,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":59820,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3216816249409542,"acs":4767,"articleLive":2,"columnArticles":72,"formTitle":"[722]删除注释","frequency":1.6191673668,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":14819,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7254437869822485,"acs":1226,"articleLive":2,"columnArticles":38,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"","submitted":1690,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4559063671724428,"acs":130102,"articleLive":2,"columnArticles":818,"formTitle":"[724]寻找数组的中心下标","frequency":1.2165030243,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":285370,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.5625482811896485,"acs":23303,"articleLive":2,"columnArticles":304,"formTitle":"[725]分隔链表","frequency":1.1762496627,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":41424,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5556652293625642,"acs":21392,"articleLive":2,"columnArticles":388,"formTitle":"[726]原子的数量","frequency":2.5284253404,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":38498,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.41285557127141287,"acs":2627,"articleLive":2,"columnArticles":43,"formTitle":"[727]最小窗口子序列","frequency":1.4744064273,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"","submitted":6363,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.759054613677443,"acs":33176,"articleLive":2,"columnArticles":298,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":43707,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.505471671976728,"acs":7298,"articleLive":2,"columnArticles":82,"formTitle":"[729]我的日程安排表 I","frequency":1.1453830147,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":14438,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.48770385710587627,"acs":3768,"articleLive":2,"columnArticles":47,"formTitle":"[730]统计不同回文子序列","frequency":2.0055842799,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":7726,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5105856475116854,"acs":3714,"articleLive":2,"columnArticles":37,"formTitle":"[731]我的日程安排表 II","frequency":0.272605588,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":7274,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6114499311430258,"acs":3108,"articleLive":2,"columnArticles":49,"formTitle":"[732]我的日程安排表 III","frequency":0.3895269261,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5083,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5807575803624796,"acs":57326,"articleLive":2,"columnArticles":487,"formTitle":"[733]图像渲染","frequency":1.877532353,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":98709,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4784677015523285,"acs":1911,"articleLive":2,"columnArticles":34,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"","submitted":3994,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.40997436726974096,"acs":16474,"articleLive":2,"columnArticles":210,"formTitle":"[735]行星碰撞","frequency":1.4416488308,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":40183,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.45850046282011725,"acs":1486,"articleLive":2,"columnArticles":44,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3241,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4628542251723258,"acs":3626,"articleLive":2,"columnArticles":60,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"","submitted":7834,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5018804900748371,"acs":39366,"articleLive":2,"columnArticles":568,"formTitle":"[738]单调递增的数字","frequency":1.5084348891,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"","submitted":78437,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6775372059198599,"acs":196582,"articleLive":2,"columnArticles":1425,"formTitle":"[739]每日温度","frequency":4.2783101097,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":290142,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6310088112624731,"acs":44329,"articleLive":2,"columnArticles":523,"formTitle":"[740]删除并获得点数","frequency":2.9041361874,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":70251,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3650472334682861,"acs":3787,"articleLive":2,"columnArticles":43,"formTitle":"[741]摘樱桃","frequency":1.3501774273,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10374,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4928813559322034,"acs":1454,"articleLive":2,"columnArticles":42,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"","submitted":2950,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.515422261016251,"acs":52554,"articleLive":2,"columnArticles":490,"formTitle":"[743]网络延迟时间","frequency":1.3238739645,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":101963,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45941369457085407,"acs":39069,"articleLive":2,"columnArticles":346,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":1.4100755689,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":85041,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.3914813199592964,"acs":2693,"articleLive":2,"columnArticles":51,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":6879,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5788103460767503,"acs":119834,"articleLive":2,"columnArticles":1186,"formTitle":"[746]使用最小花费爬楼梯","frequency":2.2350865585,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":207035,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.41451251400821815,"acs":44386,"articleLive":2,"columnArticles":393,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.272605588,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":107080,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.598406653973344,"acs":11943,"articleLive":2,"columnArticles":165,"formTitle":"[748]最短补全词","frequency":0.2464260825,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":19958,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5064516129032258,"acs":1256,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.8446288607,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2480,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7231006556112611,"acs":1875,"articleLive":2,"columnArticles":42,"formTitle":"[750]角矩形的数量","frequency":1.2416110468,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"","submitted":2593,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5083674228337672,"acs":1367,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"","submitted":2689,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5320359934998262,"acs":65807,"articleLive":2,"columnArticles":560,"formTitle":"[752]打开转盘锁","frequency":1.9393348944,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":123689,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5870531400966184,"acs":3038,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.9810799634,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5175,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4274834621157374,"acs":7690,"articleLive":2,"columnArticles":87,"formTitle":"[754]到达终点数字","frequency":0.8446288607,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":17989,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.5014061872237846,"acs":1248,"articleLive":2,"columnArticles":30,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"","submitted":2489,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5740450026164312,"acs":4388,"articleLive":2,"columnArticles":66,"formTitle":"[756]金字塔转换矩阵","frequency":0.2999147674,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":7644,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.41613475177304965,"acs":2347,"articleLive":2,"columnArticles":36,"formTitle":"[757]设置交集大小至少为2","frequency":0.4223167489,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5640,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.45853397538790797,"acs":3428,"articleLive":2,"columnArticles":68,"formTitle":"[758]字符串中的加粗单词","frequency":0.6937030947,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"","submitted":7476,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6577540106951871,"acs":1722,"articleLive":2,"columnArticles":44,"formTitle":"[759]员工空闲时间","frequency":0.3582743826,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"","submitted":2618,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8382642998027613,"acs":3825,"articleLive":2,"columnArticles":87,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"","submitted":4563,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5940333430827728,"acs":2031,"articleLive":2,"columnArticles":33,"formTitle":"[761]特殊的二进制序列","frequency":0.5994270179,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3419,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.6976209677419355,"acs":17301,"articleLive":2,"columnArticles":136,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":24800,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7628427229576816,"acs":76179,"articleLive":2,"columnArticles":925,"formTitle":"[763]划分字母区间","frequency":3.0687781414,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":99862,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4904744116548375,"acs":3939,"articleLive":2,"columnArticles":51,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8031,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6655905363370723,"acs":28245,"articleLive":2,"columnArticles":424,"formTitle":"[765]情侣牵手","frequency":2.7759135205,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":42436,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7082220476564546,"acs":54094,"articleLive":2,"columnArticles":627,"formTitle":"[766]托普利茨矩阵","frequency":0.2999147674,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":76380,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.4773674149593177,"acs":38957,"articleLive":2,"columnArticles":487,"formTitle":"[767]重构字符串","frequency":2.0769412187,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":81608,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.4998937977909941,"acs":4707,"articleLive":2,"columnArticles":75,"formTitle":"[768]最多能完成排序的块 II","frequency":1.2416110468,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":9416,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5903775820326586,"acs":11461,"articleLive":2,"columnArticles":133,"formTitle":"[769]最多能完成排序的块","frequency":0.272605588,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":19413,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5520428015564203,"acs":1135,"articleLive":2,"columnArticles":25,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2056,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8514091630921904,"acs":150656,"articleLive":2,"columnArticles":1095,"formTitle":"[771]宝石与石头","frequency":2.1190846538,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"","submitted":176949,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4887462634077721,"acs":5559,"articleLive":2,"columnArticles":115,"formTitle":"[772]基本计算器 III","frequency":1.3896458492,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"","submitted":11374,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7158773489080752,"acs":22553,"articleLive":2,"columnArticles":323,"formTitle":"[773]滑动谜题","frequency":2.4789653899,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":31504,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5941348973607038,"acs":1013,"articleLive":2,"columnArticles":21,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"","submitted":1705,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.46147324792765637,"acs":4899,"articleLive":2,"columnArticles":74,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":10616,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5708140304434149,"acs":1725,"articleLive":2,"columnArticles":37,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"","submitted":3022,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3239571488419415,"acs":5413,"articleLive":2,"columnArticles":58,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.8446288607,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":16709,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5986104531817464,"acs":22746,"articleLive":2,"columnArticles":342,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.3582743826,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":37998,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.43541436073758333,"acs":18489,"articleLive":2,"columnArticles":227,"formTitle":"[779]第K个语法符号","frequency":1.8243231686,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":42463,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2837975386323679,"acs":3067,"articleLive":2,"columnArticles":48,"formTitle":"[780]到达终点","frequency":0.9810799634,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":10807,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.623629976933862,"acs":41366,"articleLive":2,"columnArticles":636,"formTitle":"[781]森林中的兔子","frequency":4.3496065628,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":66331,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42155067155067155,"acs":1381,"articleLive":2,"columnArticles":28,"formTitle":"[782]变为棋盘","frequency":1.6731761717,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3276,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5957617721275834,"acs":68232,"articleLive":2,"columnArticles":659,"formTitle":"[783]二叉搜索树节点最小距离","frequency":1.6511803438,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":114529,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6838558855885588,"acs":39784,"articleLive":2,"columnArticles":426,"formTitle":"[784]字母大小写全排列","frequency":1.1453830147,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"","submitted":58176,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5109417195461016,"acs":38408,"articleLive":2,"columnArticles":395,"formTitle":"[785]判断二分图","frequency":2.0055842799,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":75171,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.4595297175942337,"acs":3889,"articleLive":2,"columnArticles":50,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":8463,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3531176149790947,"acs":19425,"articleLive":2,"columnArticles":191,"formTitle":"[787]K 站中转内最便宜的航班","frequency":1.8243231686,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"","submitted":55010,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6067204931488492,"acs":18110,"articleLive":2,"columnArticles":181,"formTitle":"[788]旋转数字","frequency":0.8766008934,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":29849,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.447509765625,"acs":3666,"articleLive":2,"columnArticles":59,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8192,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6946165144645252,"acs":10877,"articleLive":2,"columnArticles":192,"formTitle":"[791]自定义字符串排序","frequency":1.6843795154,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":15659,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.45025258071601143,"acs":8200,"articleLive":2,"columnArticles":92,"formTitle":"[792]匹配子序列的单词数","frequency":0.8139139155,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":18212,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3940635451505017,"acs":4713,"articleLive":2,"columnArticles":64,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.2464260825,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":11960,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3408817731621713,"acs":7090,"articleLive":2,"columnArticles":96,"formTitle":"[794]有效的井字游戏","frequency":0.2999147674,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":20799,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5339327767073432,"acs":7482,"articleLive":2,"columnArticles":83,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":14013,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5227830897255538,"acs":21925,"articleLive":2,"columnArticles":259,"formTitle":"[796]旋转字符串","frequency":2.100412067,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":41939,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7402128969824932,"acs":16828,"articleLive":2,"columnArticles":246,"formTitle":"[797]所有可能的路径","frequency":1.1762496627,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":22734,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4573758339510749,"acs":1234,"articleLive":2,"columnArticles":30,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2698,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4069363181548376,"acs":4799,"articleLive":2,"columnArticles":65,"formTitle":"[799]香槟塔","frequency":2.3860480858,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":11793,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7055498458376156,"acs":1373,"articleLive":2,"columnArticles":33,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"","submitted":1946,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4174592597080027,"acs":6891,"articleLive":2,"columnArticles":82,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.3895269261,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":16507,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5774470280288122,"acs":30223,"articleLive":2,"columnArticles":329,"formTitle":"[802]找到最终的安全状态","frequency":1.2192562542,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":52339,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4835464347268428,"acs":12064,"articleLive":2,"columnArticles":122,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":24949,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7693479163782362,"acs":38899,"articleLive":2,"columnArticles":386,"formTitle":"[804]唯一摩尔斯密码词","frequency":1.1453830147,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":50561,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.28857243733082266,"acs":2452,"articleLive":2,"columnArticles":39,"formTitle":"[805]数组的均值分割","frequency":1.2416110468,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":8497,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6583218143654329,"acs":12859,"articleLive":2,"columnArticles":143,"formTitle":"[806]写字符串需要的行数","frequency":0.8139139155,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":19533,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8435102301790282,"acs":15831,"articleLive":2,"columnArticles":203,"formTitle":"[807]保持城市天际线","frequency":0.272605588,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":18768,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4785917092561045,"acs":4214,"articleLive":2,"columnArticles":40,"formTitle":"[808]分汤","frequency":1.2762885852,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":8805,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4178088408822728,"acs":4603,"articleLive":2,"columnArticles":84,"formTitle":"[809]情感丰富的文字","frequency":0.8446288607,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11017,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7366974543816175,"acs":16351,"articleLive":2,"columnArticles":132,"formTitle":"[810]黑板异或游戏","frequency":2.0055842799,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22195,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7026541332596075,"acs":15249,"articleLive":2,"columnArticles":187,"formTitle":"[811]子域名访问计数","frequency":0.7843696691,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":21702,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.629613864396473,"acs":10354,"articleLive":2,"columnArticles":90,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":16445,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5472599296128708,"acs":6531,"articleLive":2,"columnArticles":80,"formTitle":"[813]最大平均值和的分组","frequency":0.3582743826,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":11934,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6999743375890165,"acs":21821,"articleLive":2,"columnArticles":335,"formTitle":"[814]二叉树剪枝","frequency":0.272605588,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":31174,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.43507510985454917,"acs":25545,"articleLive":2,"columnArticles":308,"formTitle":"[815]公交路线","frequency":4.0507926499,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":58714,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.51171875,"acs":3406,"articleLive":2,"columnArticles":59,"formTitle":"[816]模糊坐标","frequency":0.3895269261,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":6656,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5914279269117979,"acs":13109,"articleLive":2,"columnArticles":163,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22165,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.4300889328063241,"acs":3482,"articleLive":2,"columnArticles":42,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8096,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42056491676298235,"acs":20741,"articleLive":2,"columnArticles":237,"formTitle":"[819]最常见的单词","frequency":0.9099262031,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":49317,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5055273891663172,"acs":53046,"articleLive":2,"columnArticles":591,"formTitle":"[820]单词的压缩编码","frequency":1.9663635668,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":104932,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6916881347902046,"acs":23359,"articleLive":2,"columnArticles":314,"formTitle":"[821]字符的最短距离","frequency":1.4416488308,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":33771,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5020355292376018,"acs":2713,"articleLive":2,"columnArticles":35,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5404,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4288656527249683,"acs":2707,"articleLive":2,"columnArticles":51,"formTitle":"[823]带因子的二叉树","frequency":0.5298547857,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6312,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6141171147392632,"acs":16287,"articleLive":2,"columnArticles":232,"formTitle":"[824]山羊拉丁文","frequency":0.272605588,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":26521,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3893944148101663,"acs":6205,"articleLive":2,"columnArticles":84,"formTitle":"[825]适龄的朋友","frequency":0.272605588,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":15935,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3726614206055553,"acs":7151,"articleLive":2,"columnArticles":103,"formTitle":"[826]安排工作以达到最大收益","frequency":0.2999147674,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":19189,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3931229025825592,"acs":8083,"articleLive":2,"columnArticles":170,"formTitle":"[827]最大人工岛","frequency":1.4744064273,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":20561,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4867025615924294,"acs":2983,"articleLive":2,"columnArticles":49,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6129,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3609810479375697,"acs":8095,"articleLive":2,"columnArticles":94,"formTitle":"[829]连续整数求和","frequency":1.4416488308,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":22425,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5431468324452339,"acs":51373,"articleLive":2,"columnArticles":572,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":94584,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.4033192686357243,"acs":7169,"articleLive":2,"columnArticles":68,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":17775,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7954492053496743,"acs":84635,"articleLive":2,"columnArticles":909,"formTitle":"[832]翻转图像","frequency":2.8261180821,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":106399,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.424546406140963,"acs":4867,"articleLive":2,"columnArticles":72,"formTitle":"[833]字符串中的查找与替换","frequency":0.272605588,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":11464,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5291713869558181,"acs":13079,"articleLive":2,"columnArticles":128,"formTitle":"[834]树中距离之和","frequency":0.8766008934,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":24716,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.572380291464261,"acs":4124,"articleLive":2,"columnArticles":46,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7205,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.477182203941374,"acs":36660,"articleLive":2,"columnArticles":645,"formTitle":"[836]矩形重叠","frequency":0.8139139155,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":76826,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39690188616810057,"acs":19191,"articleLive":2,"columnArticles":239,"formTitle":"[837]新21点","frequency":0.8766008934,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":48352,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5007417297136924,"acs":6751,"articleLive":2,"columnArticles":118,"formTitle":"[838]推多米诺","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":13482,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5742580328673044,"acs":18730,"articleLive":2,"columnArticles":265,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":32616,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3586523612127123,"acs":8825,"articleLive":2,"columnArticles":111,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":24606,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6563619134351502,"acs":53334,"articleLive":2,"columnArticles":522,"formTitle":"[841]钥匙和房间","frequency":0.8139139155,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":81257,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48951750602897426,"acs":27809,"articleLive":2,"columnArticles":318,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":2.067716061,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":56809,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3760928765945249,"acs":2624,"articleLive":2,"columnArticles":33,"formTitle":"[843]猜猜这个单词","frequency":0.4567791531,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":6977,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5162899581249492,"acs":82483,"articleLive":2,"columnArticles":918,"formTitle":"[844]比较含退格的字符串","frequency":1.3217179084,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":159761,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4200880352140856,"acs":36743,"articleLive":2,"columnArticles":546,"formTitle":"[845]数组中的最长山脉","frequency":1.6511803438,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":87465,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5111823054648512,"acs":8297,"articleLive":2,"columnArticles":112,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":16231,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6838062807415816,"acs":18073,"articleLive":2,"columnArticles":155,"formTitle":"[847]访问所有节点的最短路径","frequency":1.5647114048,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":26430,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4457248092607209,"acs":8471,"articleLive":2,"columnArticles":91,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":19005,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42556279783096895,"acs":15539,"articleLive":2,"columnArticles":176,"formTitle":"[849]到最近的人的最大距离","frequency":0.3284392341,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":36514,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4407451446690448,"acs":2224,"articleLive":2,"columnArticles":40,"formTitle":"[850]矩形面积 II","frequency":1.4744064273,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5046,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4821904531136419,"acs":3980,"articleLive":2,"columnArticles":68,"formTitle":"[851]喧闹和富有","frequency":1.1762496627,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":8254,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7153517376681614,"acs":81676,"articleLive":2,"columnArticles":702,"formTitle":"[852]山脉数组的峰顶索引","frequency":2.8917165603,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":114176,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3810984109283524,"acs":9569,"articleLive":2,"columnArticles":117,"formTitle":"[853]车队","frequency":1.7546924166,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":25109,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.36102590320381733,"acs":4237,"articleLive":2,"columnArticles":63,"formTitle":"[854]相似度为 K 的字符串","frequency":0.3582743826,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":11736,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.40768500948766606,"acs":4297,"articleLive":2,"columnArticles":51,"formTitle":"[855]考场就座","frequency":0.8139139155,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":10540,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6248396407953817,"acs":15586,"articleLive":2,"columnArticles":212,"formTitle":"[856]括号的分数","frequency":1.5084348891,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":24944,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46690635724791635,"acs":2857,"articleLive":2,"columnArticles":45,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":1.3124370993,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6119,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5568321707016824,"acs":2714,"articleLive":2,"columnArticles":44,"formTitle":"[858]镜面反射","frequency":1.2416110468,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":4874,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.30138251925731335,"acs":27075,"articleLive":2,"columnArticles":350,"formTitle":"[859]亲密字符串","frequency":0.8139139155,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":89836,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.586285298218861,"acs":85352,"articleLive":2,"columnArticles":746,"formTitle":"[860]柠檬水找零","frequency":1.6191673668,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"","submitted":145581,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.809028500104015,"acs":31112,"articleLive":2,"columnArticles":434,"formTitle":"[861]翻转矩阵后的得分","frequency":0.272605588,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"","submitted":38456,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.18724088020999435,"acs":15265,"articleLive":2,"columnArticles":122,"formTitle":"[862]和至少为 K 的最短子数组","frequency":2.3165346477,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":81526,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6033863794673954,"acs":33783,"articleLive":2,"columnArticles":548,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":1.4395080066,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":55989,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45262160454832595,"acs":2866,"articleLive":2,"columnArticles":41,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6332,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6538461538461539,"acs":8534,"articleLive":2,"columnArticles":120,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13052,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22323924194489664,"acs":7268,"articleLive":2,"columnArticles":82,"formTitle":"[866]回文素数","frequency":0.8446288607,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":32557,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6709590933095015,"acs":82585,"articleLive":2,"columnArticles":741,"formTitle":"[867]转置矩阵","frequency":3.0999139068,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":123085,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6236394357342135,"acs":15871,"articleLive":2,"columnArticles":224,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":25449,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5500354861603974,"acs":6200,"articleLive":2,"columnArticles":87,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.272605588,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11272,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4228809346259011,"acs":13610,"articleLive":2,"columnArticles":174,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":32184,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.33815870098039214,"acs":8830,"articleLive":2,"columnArticles":117,"formTitle":"[871]最低加油次数","frequency":1.7920101796,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":26112,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6521105621227227,"acs":59524,"articleLive":2,"columnArticles":711,"formTitle":"[872]叶子相似的树","frequency":2.6471769331,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":91279,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5084551857280755,"acs":14222,"articleLive":2,"columnArticles":101,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":1.6511803438,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":27971,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4128860801874948,"acs":19731,"articleLive":2,"columnArticles":216,"formTitle":"[874]模拟行走机器人","frequency":1.6511803438,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","questionId":"906","status":"","submitted":47788,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.4762931792341144,"acs":40634,"articleLive":2,"columnArticles":315,"formTitle":"[875]爱吃香蕉的珂珂","frequency":2.1497598147,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":85313,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7061358690760459,"acs":133370,"articleLive":2,"columnArticles":1510,"formTitle":"[876]链表的中间结点","frequency":2.0055842799,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":188873,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7566578549413001,"acs":65547,"articleLive":2,"columnArticles":471,"formTitle":"[877]石子游戏","frequency":2.8480628539,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":86627,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.27925832391838906,"acs":4202,"articleLive":2,"columnArticles":59,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15047,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5560588001589194,"acs":20994,"articleLive":2,"columnArticles":179,"formTitle":"[879]盈利计划","frequency":3.4634323334,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":37755,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.25209354796719746,"acs":5810,"articleLive":2,"columnArticles":72,"formTitle":"[880]索引处的解码字符串","frequency":0.3582743826,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23047,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.47885419855116823,"acs":18773,"articleLive":2,"columnArticles":180,"formTitle":"[881]救生艇","frequency":1.6191673668,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"","submitted":39204,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4820886460230723,"acs":1588,"articleLive":2,"columnArticles":28,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3294,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6851511169513798,"acs":10428,"articleLive":2,"columnArticles":102,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15220,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6607029654152285,"acs":18760,"articleLive":2,"columnArticles":240,"formTitle":"[884]两句话中的不常见单词","frequency":0.2464260825,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":28394,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6893724377168086,"acs":4372,"articleLive":2,"columnArticles":65,"formTitle":"[885]螺旋矩阵 III","frequency":1.5084348891,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6342,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.42228474360335494,"acs":7955,"articleLive":2,"columnArticles":105,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":18838,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.29165828313074765,"acs":49285,"articleLive":2,"columnArticles":322,"formTitle":"[887]鸡蛋掉落","frequency":3.2157711586,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":168982,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6394772150079064,"acs":53381,"articleLive":2,"columnArticles":448,"formTitle":"[888]公平的糖果棒交换","frequency":0.2212991324,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":83476,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6795992627947639,"acs":14381,"articleLive":2,"columnArticles":145,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":2.2517850214,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":21161,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7255584812707041,"acs":8542,"articleLive":2,"columnArticles":117,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":11773,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3264005770617937,"acs":2715,"articleLive":2,"columnArticles":37,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8318,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6387432521651326,"acs":32894,"articleLive":2,"columnArticles":674,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":51498,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7236995009911819,"acs":10587,"articleLive":2,"columnArticles":101,"formTitle":"[893]特殊等价字符串组","frequency":0.3284392341,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14629,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7742985202922577,"acs":12611,"articleLive":2,"columnArticles":115,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":16287,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.538883179170949,"acs":6292,"articleLive":2,"columnArticles":74,"formTitle":"[895]最大频率栈","frequency":1.1762496627,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":11676,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5865981976539294,"acs":58258,"articleLive":2,"columnArticles":707,"formTitle":"[896]单调数列","frequency":1.9393348944,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":99315,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7454449529465174,"acs":60756,"articleLive":2,"columnArticles":696,"formTitle":"[897]递增顺序搜索树","frequency":2.8354903976,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":81503,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3339988407290526,"acs":5186,"articleLive":2,"columnArticles":36,"formTitle":"[898]子数组按位或操作","frequency":1.2082968401,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15527,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5350984385607603,"acs":3941,"articleLive":2,"columnArticles":38,"formTitle":"[899]有序队列","frequency":0.3284392341,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7365,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4927289603960396,"acs":3185,"articleLive":2,"columnArticles":39,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6464,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5403478314784388,"acs":17430,"articleLive":2,"columnArticles":218,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":32257,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.3258264462809917,"acs":3154,"articleLive":2,"columnArticles":72,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":9680,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5307335190343547,"acs":2858,"articleLive":2,"columnArticles":41,"formTitle":"[903]DI 序列的有效排列","frequency":0.6450553705,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5385,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.45188698915763137,"acs":17338,"articleLive":2,"columnArticles":241,"formTitle":"[904]水果成篮","frequency":1.6511803438,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":38368,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.701473741958007,"acs":56261,"articleLive":2,"columnArticles":579,"formTitle":"[905]按奇偶排序数组","frequency":1.4416488308,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":80204,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2719621251972646,"acs":2068,"articleLive":2,"columnArticles":34,"formTitle":"[906]超级回文数","frequency":1.9141128764,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7604,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.31515675804671417,"acs":10565,"articleLive":2,"columnArticles":120,"formTitle":"[907]子数组的最小值之和","frequency":1.6843795154,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":33523,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.69788835458917,"acs":20028,"articleLive":2,"columnArticles":179,"formTitle":"[908]最小差值 I","frequency":0.272605588,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":28698,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.4616185572973911,"acs":15960,"articleLive":2,"columnArticles":191,"formTitle":"[909]蛇梯棋","frequency":1.9663635668,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":34574,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3169625049860391,"acs":6357,"articleLive":2,"columnArticles":63,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20056,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.430530456043372,"acs":4050,"articleLive":2,"columnArticles":61,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":9407,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5673695300976329,"acs":201941,"articleLive":2,"columnArticles":985,"formTitle":"[912]排序数组","frequency":3.9865857488,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":355925,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.401910686514108,"acs":1809,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":0.3582743826,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4501,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.38888531342515126,"acs":48340,"articleLive":2,"columnArticles":607,"formTitle":"[914]卡牌分组","frequency":0.7843696691,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":124304,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4677801780915749,"acs":8878,"articleLive":2,"columnArticles":108,"formTitle":"[915]分割数组","frequency":0.8446288607,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":18979,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4385814996795557,"acs":6159,"articleLive":2,"columnArticles":66,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14043,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5693698388519202,"acs":28407,"articleLive":2,"columnArticles":417,"formTitle":"[917]仅仅反转字母","frequency":1.7188514244,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":49892,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.35813025836179824,"acs":15622,"articleLive":2,"columnArticles":189,"formTitle":"[918]环形子数组的最大和","frequency":1.086886808,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":43621,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6248258391386954,"acs":4933,"articleLive":2,"columnArticles":89,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":7895,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.47875816993464054,"acs":1758,"articleLive":2,"columnArticles":18,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3672,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7349805132730348,"acs":19990,"articleLive":2,"columnArticles":289,"formTitle":"[921]使括号有效的最少添加","frequency":0.3284392341,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":27198,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7144792439441344,"acs":88604,"articleLive":2,"columnArticles":814,"formTitle":"[922]按奇偶排序数组 II","frequency":1.1762496627,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":124012,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.338101137515486,"acs":6004,"articleLive":2,"columnArticles":79,"formTitle":"[923]三数之和的多种可能","frequency":0.3284392341,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":17758,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3597401809020822,"acs":5926,"articleLive":2,"columnArticles":89,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":16473,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3883225644564331,"acs":49522,"articleLive":2,"columnArticles":665,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":127528,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5146454049517415,"acs":6132,"articleLive":2,"columnArticles":109,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.8446288607,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":11915,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3375240798945554,"acs":3329,"articleLive":2,"columnArticles":65,"formTitle":"[927]三等分","frequency":1.7546924166,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":9863,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.42026117926394935,"acs":2124,"articleLive":2,"columnArticles":40,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5054,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6422516282435645,"acs":24850,"articleLive":2,"columnArticles":224,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":38692,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5449773995397122,"acs":32915,"articleLive":2,"columnArticles":335,"formTitle":"[930]和相同的二元子数组","frequency":2.5392245814,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":60397,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6583133994000835,"acs":17338,"articleLive":2,"columnArticles":216,"formTitle":"[931]下降路径最小和","frequency":1.1156189128,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":26337,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6265088945362135,"acs":7889,"articleLive":2,"columnArticles":74,"formTitle":"[932]漂亮数组","frequency":0.8446288607,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":12592,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7232585345102627,"acs":34004,"articleLive":2,"columnArticles":290,"formTitle":"[933]最近的请求次数","frequency":1.6511803438,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":47015,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47532148048753214,"acs":21254,"articleLive":2,"columnArticles":242,"formTitle":"[934]最短的桥","frequency":2.0405773534,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":44715,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.47477865323694257,"acs":5845,"articleLive":2,"columnArticles":78,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12311,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37859140605136027,"acs":1489,"articleLive":2,"columnArticles":24,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":3933,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5882261571916745,"acs":11361,"articleLive":2,"columnArticles":119,"formTitle":"[937]重新排列日志文件","frequency":0.8139139155,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":19314,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8180933684627438,"acs":95015,"articleLive":2,"columnArticles":780,"formTitle":"[938]二叉搜索树的范围和","frequency":2.4434846638,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":116142,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.45004849660523766,"acs":5104,"articleLive":2,"columnArticles":59,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":11341,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.4118930197268589,"acs":4343,"articleLive":2,"columnArticles":53,"formTitle":"[940]不同的子序列 II","frequency":0.272605588,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"","submitted":10544,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3926238063942475,"acs":60936,"articleLive":2,"columnArticles":602,"formTitle":"[941]有效的山脉数组","frequency":0.2464260825,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":155202,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7287249975039105,"acs":21896,"articleLive":2,"columnArticles":199,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":30047,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.47415185783521807,"acs":1761,"articleLive":2,"columnArticles":41,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":3714,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6902743142144638,"acs":20760,"articleLive":2,"columnArticles":173,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30075,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4869675336422717,"acs":34993,"articleLive":2,"columnArticles":533,"formTitle":"[945]使数组唯一的最小增量","frequency":1.4416488308,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":71859,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6215252685840921,"acs":25802,"articleLive":2,"columnArticles":285,"formTitle":"[946]验证栈序列","frequency":2.2836044414,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":41514,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6129055567598815,"acs":25446,"articleLive":2,"columnArticles":331,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":41517,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3913690476190476,"acs":6575,"articleLive":2,"columnArticles":93,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":16800,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.36954511834319526,"acs":7994,"articleLive":2,"columnArticles":115,"formTitle":"[949]给定数字能组成的最大时间","frequency":1.6511803438,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":21632,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7746779355050464,"acs":9441,"articleLive":2,"columnArticles":136,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.8139139155,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12187,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6614761362197746,"acs":10450,"articleLive":2,"columnArticles":159,"formTitle":"[951]翻转等价二叉树","frequency":1.4416488308,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":15798,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.34819379002053885,"acs":2882,"articleLive":2,"columnArticles":52,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8277,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5527621147242124,"acs":13038,"articleLive":2,"columnArticles":153,"formTitle":"[953]验证外星语词典","frequency":1.1762496627,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":23587,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.2988369541364933,"acs":6809,"articleLive":2,"columnArticles":100,"formTitle":"[954]二倍数对数组","frequency":1.4416488308,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":22785,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3299839657936932,"acs":3087,"articleLive":2,"columnArticles":47,"formTitle":"[955]删列造序 II","frequency":0.2999147674,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9355,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.43408142551031914,"acs":3849,"articleLive":2,"columnArticles":49,"formTitle":"[956]最高的广告牌","frequency":1.2762885852,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":8867,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.35951446852207797,"acs":13654,"articleLive":2,"columnArticles":131,"formTitle":"[957]N 天后的牢房","frequency":1.2416110468,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":37979,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5361358006702608,"acs":22077,"articleLive":2,"columnArticles":213,"formTitle":"[958]二叉树的完全性检验","frequency":1.6511803438,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":41178,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.743700226984188,"acs":19331,"articleLive":2,"columnArticles":298,"formTitle":"[959]由斜杠划分区域","frequency":1.1762496627,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":25993,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.552143684820394,"acs":1906,"articleLive":2,"columnArticles":29,"formTitle":"[960]删列造序 III","frequency":0.4223167489,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3452,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.676831592589769,"acs":35512,"articleLive":2,"columnArticles":282,"formTitle":"[961]重复 N 次的元素","frequency":0.8139139155,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":52468,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4412439549578171,"acs":12500,"articleLive":2,"columnArticles":118,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":28329,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5025578064252098,"acs":2456,"articleLive":2,"columnArticles":31,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":4887,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4256488549618321,"acs":1394,"articleLive":2,"columnArticles":24,"formTitle":"[964]表示数字的最少运算符","frequency":1.0591226704,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3275,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6839265286741059,"acs":31687,"articleLive":2,"columnArticles":373,"formTitle":"[965]单值二叉树","frequency":0.272605588,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":46331,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.40216949152542375,"acs":2966,"articleLive":2,"columnArticles":45,"formTitle":"[966]元音拼写检查器","frequency":0.5298547857,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7375,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.45773544708315056,"acs":7305,"articleLive":2,"columnArticles":139,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":15959,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4961498702559018,"acs":23518,"articleLive":2,"columnArticles":313,"formTitle":"[968]监控二叉树","frequency":1.7920101796,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":47401,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6522539511494253,"acs":14527,"articleLive":2,"columnArticles":187,"formTitle":"[969]煎饼排序","frequency":0.2999147674,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":22272,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4143716244685333,"acs":10818,"articleLive":2,"columnArticles":121,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26107,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4426861432339217,"acs":6546,"articleLive":2,"columnArticles":99,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.3895269261,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":14787,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4104180491041805,"acs":1237,"articleLive":2,"columnArticles":26,"formTitle":"[972]相等的有理数","frequency":0.7843696691,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3014,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6382945248584015,"acs":64912,"articleLive":2,"columnArticles":622,"formTitle":"[973]最接近原点的 K 个点","frequency":0.8139139155,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":101696,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.46524203871574493,"acs":35618,"articleLive":2,"columnArticles":372,"formTitle":"[974]和可被 K 整除的子数组","frequency":2.6793133746,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":76558,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4419831223628692,"acs":2933,"articleLive":2,"columnArticles":43,"formTitle":"[975]奇偶跳","frequency":0.3582743826,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6636,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.596999147485081,"acs":52521,"articleLive":2,"columnArticles":486,"formTitle":"[976]三角形的最大周长","frequency":1.2082968401,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"","submitted":87975,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7180215406462194,"acs":143600,"articleLive":2,"columnArticles":1128,"formTitle":"[977]有序数组的平方","frequency":2.2836044414,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":199994,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.473564651908601,"acs":42528,"articleLive":2,"columnArticles":590,"formTitle":"[978]最长湍流子数组","frequency":0.8139139155,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":89804,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7122591943957969,"acs":8134,"articleLive":2,"columnArticles":128,"formTitle":"[979]在二叉树中分配硬币","frequency":0.8446288607,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11420,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7331965664309237,"acs":13581,"articleLive":2,"columnArticles":200,"formTitle":"[980]不同路径 III","frequency":1.2762885852,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":18523,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5356579321762074,"acs":20708,"articleLive":2,"columnArticles":304,"formTitle":"[981]基于时间的键值存储","frequency":2.5284253404,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":38659,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5416852429781542,"acs":2430,"articleLive":2,"columnArticles":24,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4486,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6335088001285863,"acs":31531,"articleLive":2,"columnArticles":445,"formTitle":"[983]最低票价","frequency":2.2836044414,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":49772,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4158818186164364,"acs":8699,"articleLive":2,"columnArticles":137,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":20917,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.598997118586985,"acs":16007,"articleLive":2,"columnArticles":177,"formTitle":"[985]查询后的偶数和","frequency":0.272605588,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":26723,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6763372056905014,"acs":21774,"articleLive":2,"columnArticles":213,"formTitle":"[986]区间列表的交集","frequency":2.1342963861,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":32194,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5322197969061403,"acs":22432,"articleLive":2,"columnArticles":405,"formTitle":"[987]二叉树的垂序遍历","frequency":1.4148591226,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":42148,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.495398773006135,"acs":8721,"articleLive":2,"columnArticles":106,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":17604,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4729957295572323,"acs":50839,"articleLive":2,"columnArticles":574,"formTitle":"[989]数组形式的整数加法","frequency":0.7843696691,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":107483,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.49860928808050503,"acs":31909,"articleLive":2,"columnArticles":484,"formTitle":"[990]等式方程的可满足性","frequency":0.272605588,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":63996,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5178166206685066,"acs":8443,"articleLive":2,"columnArticles":106,"formTitle":"[991]坏了的计算器","frequency":0.8766008934,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16305,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.451084196132057,"acs":23091,"articleLive":2,"columnArticles":268,"formTitle":"[992]K 个不同整数的子数组","frequency":0.8446288607,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":51190,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5575846470798996,"acs":49799,"articleLive":2,"columnArticles":785,"formTitle":"[993]二叉树的堂兄弟节点","frequency":2.409279476,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":89312,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5088738402915838,"acs":49145,"articleLive":2,"columnArticles":1332,"formTitle":"[994]腐烂的橘子","frequency":1.7920101796,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":96576,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.540278309715307,"acs":21160,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":1.2082968401,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39165,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49651358499639336,"acs":4130,"articleLive":2,"columnArticles":84,"formTitle":"[996]正方形数组的数目","frequency":1.1011280057,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8318,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5122812357327652,"acs":33662,"articleLive":2,"columnArticles":362,"formTitle":"[997]找到小镇的法官","frequency":0.7284892108,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":65710,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6141608968018464,"acs":7451,"articleLive":2,"columnArticles":107,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12132,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6913418420144878,"acs":30063,"articleLive":2,"columnArticles":564,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.272605588,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":43485,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4065443129678821,"acs":3367,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":1.7546924166,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8282,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29132947976878615,"acs":2016,"articleLive":2,"columnArticles":50,"formTitle":"[1001]网格照明","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":6920,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7376618502533309,"acs":55034,"articleLive":2,"columnArticles":583,"formTitle":"[1002]查找常用字符","frequency":1.9393348944,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":74606,"title":"查找常用字符","titleSlug":"find-common-characters"},{"acceptance":0.5759330446206997,"acs":11836,"articleLive":2,"columnArticles":178,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":20551,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5985309806365121,"acs":63397,"articleLive":2,"columnArticles":679,"formTitle":"[1004]最大连续1的个数 III","frequency":2.5071863558,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"","submitted":105921,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5374970923470574,"acs":23107,"articleLive":2,"columnArticles":381,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":1.086886808,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":42990,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6276348275320746,"acs":43979,"articleLive":2,"columnArticles":594,"formTitle":"[1006]笨阶乘","frequency":2.4789653899,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70071,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46389795763419633,"acs":6110,"articleLive":2,"columnArticles":81,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13171,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7267533402312295,"acs":16155,"articleLive":2,"columnArticles":211,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":1.9718656439,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":22229,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5923442302319084,"acs":14840,"articleLive":2,"columnArticles":204,"formTitle":"[1009]十进制整数的反码","frequency":0.272605588,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":25053,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.4495992409298609,"acs":18006,"articleLive":2,"columnArticles":240,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40049,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6272176523501425,"acs":57874,"articleLive":2,"columnArticles":558,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":3.2739238873,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":92271,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3294726189137524,"acs":2930,"articleLive":2,"columnArticles":63,"formTitle":"[1012]至少有 1 位重复的数字","frequency":1.1011280057,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":8893,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39831948804217754,"acs":45935,"articleLive":2,"columnArticles":906,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":1.7188514244,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":115322,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5451257265605256,"acs":34513,"articleLive":2,"columnArticles":419,"formTitle":"[1014]最佳观光组合","frequency":0.7284892108,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":63312,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.3538415139862776,"acs":4693,"articleLive":2,"columnArticles":40,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.8766008934,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13263,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5832562442183163,"acs":5044,"articleLive":2,"columnArticles":78,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8648,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5616393442622951,"acs":3426,"articleLive":2,"columnArticles":52,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6100,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5167407266592211,"acs":43492,"articleLive":2,"columnArticles":369,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":84166,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5972166876130337,"acs":19483,"articleLive":2,"columnArticles":255,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.272605588,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":32623,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5365490730981461,"acs":8654,"articleLive":2,"columnArticles":130,"formTitle":"[1020]飞地的数量","frequency":1.1762496627,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":16129,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7834438188222894,"acs":56491,"articleLive":2,"columnArticles":639,"formTitle":"[1021]删除最外层的括号","frequency":1.4416488308,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":72106,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7024664261002195,"acs":18883,"articleLive":2,"columnArticles":249,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.272605588,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":26881,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5642905291540277,"acs":6697,"articleLive":2,"columnArticles":144,"formTitle":"[1023]驼峰式匹配","frequency":0.272605588,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":11868,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5606789397190117,"acs":32405,"articleLive":2,"columnArticles":370,"formTitle":"[1024]视频拼接","frequency":1.1453830147,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":57796,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7095952312277666,"acs":73805,"articleLive":2,"columnArticles":635,"formTitle":"[1025]除数博弈","frequency":2.067716061,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":104010,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6676893041416818,"acs":9576,"articleLive":2,"columnArticles":163,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14342,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4333321774109651,"acs":12496,"articleLive":2,"columnArticles":113,"formTitle":"[1027]最长等差数列","frequency":1.4744064273,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":28837,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7318928453312755,"acs":19917,"articleLive":2,"columnArticles":417,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.8446288607,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27213,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6524731355898097,"acs":16212,"articleLive":2,"columnArticles":174,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"","submitted":24847,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7121279431363838,"acs":40075,"articleLive":2,"columnArticles":440,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.3284392341,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":56275,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5667441575920714,"acs":4632,"articleLive":2,"columnArticles":69,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.2999147674,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8173,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39453317964762064,"acs":2396,"articleLive":2,"columnArticles":38,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6073,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.3891338924233661,"acs":10765,"articleLive":2,"columnArticles":161,"formTitle":"[1033]移动石子直到连续","frequency":0.272605588,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":27664,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.43231531159719355,"acs":4190,"articleLive":2,"columnArticles":90,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":9692,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6272227245328511,"acs":33298,"articleLive":2,"columnArticles":367,"formTitle":"[1035]不相交的线","frequency":2.9115656421,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":53088,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.2997881355932203,"acs":3113,"articleLive":2,"columnArticles":52,"formTitle":"[1036]逃离大迷宫","frequency":0.3284392341,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10384,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.4387862042682927,"acs":9211,"articleLive":2,"columnArticles":104,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":20992,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7935896168923148,"acs":24091,"articleLive":2,"columnArticles":307,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.2464260825,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":30357,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5523772709702358,"acs":4287,"articleLive":2,"columnArticles":58,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":7761,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5240532241555783,"acs":2560,"articleLive":2,"columnArticles":28,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":4885,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.4804611468782752,"acs":6418,"articleLive":2,"columnArticles":109,"formTitle":"[1041]困于环中的机器人","frequency":1.1762496627,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":13358,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5262877356204875,"acs":10861,"articleLive":2,"columnArticles":145,"formTitle":"[1042]不邻接植花","frequency":0.7843696691,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":20637,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.690173953925717,"acs":7340,"articleLive":2,"columnArticles":97,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":10635,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.2094346331634467,"acs":5301,"articleLive":2,"columnArticles":69,"formTitle":"[1044]最长重复子串","frequency":2.5392245814,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":25311,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6444225560206845,"acs":7851,"articleLive":2,"columnArticles":97,"formTitle":"[1045]买下所有产品的客户","frequency":0.272605588,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"","submitted":12183,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6595411994650756,"acs":64114,"articleLive":2,"columnArticles":894,"formTitle":"[1046]最后一块石头的重量","frequency":1.4744064273,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":97210,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.725907712005587,"acs":99784,"articleLive":2,"columnArticles":944,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":3.6836530073,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":137461,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.44998973095091394,"acs":8764,"articleLive":2,"columnArticles":123,"formTitle":"[1048]最长字符串链","frequency":1.4416488308,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":19476,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6416005236887325,"acs":39205,"articleLive":2,"columnArticles":382,"formTitle":"[1049]最后一块石头的重量 II","frequency":2.8354903976,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":61105,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7568056762235738,"acs":10453,"articleLive":2,"columnArticles":49,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.272605588,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"","submitted":13812,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7518195771649255,"acs":30369,"articleLive":2,"columnArticles":356,"formTitle":"[1051]高度检查器","frequency":0.272605588,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":40394,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5808810747721572,"acs":46783,"articleLive":2,"columnArticles":734,"formTitle":"[1052]爱生气的书店老板","frequency":3.1680480406,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":80538,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.45890085524231866,"acs":5795,"articleLive":2,"columnArticles":92,"formTitle":"[1053]交换一次的先前排列","frequency":0.8139139155,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":12628,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37529934998289427,"acs":7679,"articleLive":2,"columnArticles":104,"formTitle":"[1054]距离相等的条形码","frequency":0.8139139155,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":20461,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5864891108336802,"acs":4228,"articleLive":2,"columnArticles":73,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"","submitted":7209,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4058845718596756,"acs":3228,"articleLive":2,"columnArticles":59,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"","submitted":7953,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4605492935386569,"acs":2901,"articleLive":2,"columnArticles":36,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"","submitted":6299,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3378342599947048,"acs":1276,"articleLive":2,"columnArticles":28,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"","submitted":3777,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.35879310344827586,"acs":2081,"articleLive":2,"columnArticles":35,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"","submitted":5800,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5289115646258503,"acs":4043,"articleLive":2,"columnArticles":59,"formTitle":"[1060]有序数组中的缺失元素","frequency":1.4416488308,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"","submitted":7644,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.5988584474885845,"acs":2623,"articleLive":2,"columnArticles":57,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"","submitted":4380,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5351848696541148,"acs":3141,"articleLive":2,"columnArticles":38,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"","submitted":5869,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.697946033024567,"acs":1733,"articleLive":2,"columnArticles":37,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"","submitted":2483,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6509513150531617,"acs":4653,"articleLive":2,"columnArticles":66,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"","submitted":7148,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5372585096596136,"acs":2336,"articleLive":2,"columnArticles":64,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"","submitted":4348,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.471923828125,"acs":1933,"articleLive":2,"columnArticles":38,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"","submitted":4096,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4192,"acs":786,"articleLive":2,"columnArticles":25,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"","submitted":1875,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8643686246922265,"acs":12287,"articleLive":2,"columnArticles":58,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"","submitted":14215,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.820324238829577,"acs":10373,"articleLive":2,"columnArticles":51,"formTitle":"[1069]产品销售分析 II","frequency":0.272605588,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"","submitted":12645,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.4833679137942574,"acs":7222,"articleLive":2,"columnArticles":64,"formTitle":"[1070]产品销售分析 III","frequency":0.272605588,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"","submitted":14941,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5864714686301158,"acs":34091,"articleLive":2,"columnArticles":659,"formTitle":"[1071]字符串的最大公因子","frequency":0.272605588,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":58129,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5779232587743226,"acs":3178,"articleLive":2,"columnArticles":51,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.5298547857,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5499,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.337080270932411,"acs":2339,"articleLive":2,"columnArticles":51,"formTitle":"[1073]负二进制数相加","frequency":0.5298547857,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":6939,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6699719846652905,"acs":18175,"articleLive":2,"columnArticles":184,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":2.2483149645,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27128,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6953600505888863,"acs":8797,"articleLive":2,"columnArticles":68,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"","submitted":12651,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4979456384323641,"acs":9453,"articleLive":2,"columnArticles":81,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"","submitted":18984,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7214536444352674,"acs":6988,"articleLive":2,"columnArticles":83,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"","submitted":9686,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6218542683261143,"acs":11342,"articleLive":2,"columnArticles":171,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":18239,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.734976782299918,"acs":10763,"articleLive":2,"columnArticles":178,"formTitle":"[1079]活字印刷","frequency":0.2464260825,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":14644,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.48980330638349223,"acs":4059,"articleLive":2,"columnArticles":80,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8287,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5717071147064924,"acs":13781,"articleLive":2,"columnArticles":133,"formTitle":"[1081]不同字符的最小子序列","frequency":2.0055842799,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":24105,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7595099016953982,"acs":10662,"articleLive":2,"columnArticles":89,"formTitle":"[1082]销售分析 I ","frequency":0.3284392341,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"","submitted":14038,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.527986906710311,"acs":9678,"articleLive":2,"columnArticles":93,"formTitle":"[1083]销售分析 II","frequency":0.8446288607,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"","submitted":18330,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5392658384394851,"acs":9593,"articleLive":2,"columnArticles":93,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"","submitted":17789,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7731073943661971,"acs":3513,"articleLive":2,"columnArticles":70,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"","submitted":4544,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6898148148148148,"acs":4917,"articleLive":2,"columnArticles":76,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"","submitted":7128,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5304428044280443,"acs":1725,"articleLive":2,"columnArticles":50,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"","submitted":3252,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.44434550311665183,"acs":998,"articleLive":2,"columnArticles":33,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"","submitted":2246,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5853658536585366,"acs":18528,"articleLive":2,"columnArticles":274,"formTitle":"[1089]复写零","frequency":0.2212991324,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":31652,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5411174785100287,"acs":3777,"articleLive":2,"columnArticles":75,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":6980,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3772758806752486,"acs":24472,"articleLive":2,"columnArticles":256,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":1.9079139971,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":64865,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4880095923261391,"acs":2442,"articleLive":2,"columnArticles":46,"formTitle":"[1092]最短公共超序列","frequency":0.9447123192,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5004,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.38742193491837407,"acs":3536,"articleLive":2,"columnArticles":53,"formTitle":"[1093]大样本统计","frequency":0.4915652692,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9127,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6185051906697387,"acs":23891,"articleLive":2,"columnArticles":355,"formTitle":"[1094]拼车","frequency":0.7559182479,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":38627,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.37301384660709025,"acs":18992,"articleLive":2,"columnArticles":377,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":50915,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5590083798882681,"acs":1601,"articleLive":2,"columnArticles":45,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":2864,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5208937085164065,"acs":5572,"articleLive":2,"columnArticles":98,"formTitle":"[1097]游戏玩法分析 V","frequency":1.5807010859,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"","submitted":10697,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.47485955056179774,"acs":6762,"articleLive":2,"columnArticles":95,"formTitle":"[1098]小众书籍","frequency":0.8139139155,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"","submitted":14240,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5794463405384908,"acs":4584,"articleLive":2,"columnArticles":84,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"","submitted":7911,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6976200905241641,"acs":4778,"articleLive":2,"columnArticles":95,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"","submitted":6849,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6689011949868843,"acs":2295,"articleLive":2,"columnArticles":50,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"","submitted":3431,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.3655913978494624,"acs":4828,"articleLive":2,"columnArticles":62,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"","submitted":13206,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6364300188028259,"acs":34863,"articleLive":2,"columnArticles":1091,"formTitle":"[1103]分糖果 II","frequency":0.8139139155,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":54779,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7612998921251348,"acs":28229,"articleLive":2,"columnArticles":659,"formTitle":"[1104]二叉树寻路","frequency":1.0062702122,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37080,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5555678793256433,"acs":5009,"articleLive":2,"columnArticles":64,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9016,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5730606488011284,"acs":4063,"articleLive":2,"columnArticles":119,"formTitle":"[1106]解析布尔表达式","frequency":0.8766008934,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7090,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41118331979420525,"acs":6074,"articleLive":2,"columnArticles":82,"formTitle":"[1107]每日新用户统计","frequency":0.272605588,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"","submitted":14772,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.839070370935735,"acs":65961,"articleLive":2,"columnArticles":670,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":78612,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5073552535029177,"acs":29040,"articleLive":2,"columnArticles":270,"formTitle":"[1109]航班预订统计","frequency":1.9393348944,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"","submitted":57238,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6265031265031265,"acs":10420,"articleLive":2,"columnArticles":194,"formTitle":"[1110]删点成林","frequency":0.8766008934,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":16632,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7725316332804764,"acs":23872,"articleLive":2,"columnArticles":396,"formTitle":"[1111]有效括号的嵌套深度","frequency":1.2082968401,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":30901,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6417009602194788,"acs":7017,"articleLive":2,"columnArticles":79,"formTitle":"[1112]每位学生的最高成绩","frequency":0.8139139155,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"","submitted":10935,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.543205634770658,"acs":6324,"articleLive":2,"columnArticles":45,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"","submitted":11642,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6524871904355252,"acs":73350,"articleLive":2,"columnArticles":549,"formTitle":"[1114]按序打印","frequency":3.9273968774,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":112416,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5609621461987497,"acs":40649,"articleLive":2,"columnArticles":463,"formTitle":"[1115]交替打印FooBar","frequency":2.8103907783,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":72463,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.514284321372855,"acs":21098,"articleLive":2,"columnArticles":349,"formTitle":"[1116]打印零与奇偶数","frequency":2.6067125617,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":41024,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5207304248063992,"acs":16340,"articleLive":2,"columnArticles":240,"formTitle":"[1117]H2O 生成","frequency":2.3762632719,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":31379,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6406653283624892,"acs":2234,"articleLive":2,"columnArticles":34,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"","submitted":3487,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8660950566317349,"acs":8182,"articleLive":2,"columnArticles":141,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"","submitted":9447,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6023717328170377,"acs":2489,"articleLive":2,"columnArticles":45,"formTitle":"[1120]子树的最大平均值","frequency":0.3284392341,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"","submitted":4132,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5715059588299025,"acs":1055,"articleLive":2,"columnArticles":17,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"","submitted":1846,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7070137010795468,"acs":63265,"articleLive":2,"columnArticles":853,"formTitle":"[1122]数组的相对排序","frequency":2.3443580135,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":89482,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7044456641053787,"acs":7701,"articleLive":2,"columnArticles":99,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":10932,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.31478781567300185,"acs":12091,"articleLive":2,"columnArticles":125,"formTitle":"[1124]表现良好的最长时间段","frequency":0.3284392341,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":38410,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.490295358649789,"acs":2905,"articleLive":2,"columnArticles":49,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":5925,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6958775923115832,"acs":5503,"articleLive":2,"columnArticles":83,"formTitle":"[1126]查询活跃业务","frequency":0.272605588,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"","submitted":7908,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.41801863997238525,"acs":3633,"articleLive":2,"columnArticles":67,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"","submitted":8691,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5448694126915702,"acs":36655,"articleLive":2,"columnArticles":474,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.7843696691,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":67273,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3784058431248015,"acs":5958,"articleLive":2,"columnArticles":106,"formTitle":"[1129]颜色交替的最短路径","frequency":0.3284392341,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":15745,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6265301580235922,"acs":5630,"articleLive":2,"columnArticles":98,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":8986,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.452552506515407,"acs":2952,"articleLive":2,"columnArticles":43,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6523,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.39351851851851855,"acs":4250,"articleLive":2,"columnArticles":46,"formTitle":"[1132]报告的记录 II","frequency":0.8139139155,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"","submitted":10800,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6433164905833716,"acs":2801,"articleLive":2,"columnArticles":57,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"","submitted":4354,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7738998482549317,"acs":3060,"articleLive":2,"columnArticles":50,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"","submitted":3954,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5344170924291686,"acs":5753,"articleLive":2,"columnArticles":67,"formTitle":"[1135]最低成本联通所有城市","frequency":1.1453830147,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"","submitted":10765,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5663496376811594,"acs":2501,"articleLive":2,"columnArticles":47,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"","submitted":4416,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6053565844416239,"acs":65818,"articleLive":2,"columnArticles":785,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.614321544,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":108726,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43138108716162277,"acs":5944,"articleLive":2,"columnArticles":134,"formTitle":"[1138]字母板上的路径","frequency":0.3284392341,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":13779,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.47631648584281555,"acs":9000,"articleLive":2,"columnArticles":144,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.8766008934,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":18895,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6539977762053978,"acs":6470,"articleLive":2,"columnArticles":93,"formTitle":"[1140]石子游戏 II","frequency":0.3284392341,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":9893,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5125822686798297,"acs":9268,"articleLive":2,"columnArticles":63,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.272605588,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"","submitted":18081,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.37134061338289964,"acs":6393,"articleLive":2,"columnArticles":48,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"","submitted":17216,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6320954469957272,"acs":149562,"articleLive":2,"columnArticles":1035,"formTitle":"[1143]最长公共子序列","frequency":3.9408321146,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":236613,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44157554999341325,"acs":10056,"articleLive":2,"columnArticles":142,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":1.1762496627,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":22773,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.46847635726795095,"acs":6420,"articleLive":2,"columnArticles":103,"formTitle":"[1145]二叉树着色游戏","frequency":1.6511803438,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":13704,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2862448117672759,"acs":3931,"articleLive":2,"columnArticles":59,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":13733,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5545691106689117,"acs":3623,"articleLive":2,"columnArticles":72,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":6533,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7182413656212783,"acs":7237,"articleLive":2,"columnArticles":32,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"","submitted":10076,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.4437301946582164,"acs":4901,"articleLive":2,"columnArticles":43,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"","submitted":11045,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6073034473361494,"acs":4457,"articleLive":2,"columnArticles":79,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.8766008934,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"","submitted":7339,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.4831076806276098,"acs":3818,"articleLive":2,"columnArticles":54,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.7559182479,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"","submitted":7903,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3825219231932265,"acs":1265,"articleLive":2,"columnArticles":29,"formTitle":"[1152]用户网站访问行为分析","frequency":0.7284892108,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"","submitted":3307,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.37108759288448545,"acs":1648,"articleLive":2,"columnArticles":23,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"","submitted":4441,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.565352479321493,"acs":13465,"articleLive":2,"columnArticles":214,"formTitle":"[1154]一年中的第几天","frequency":0.2464260825,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":23817,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.47961464764743456,"acs":9011,"articleLive":2,"columnArticles":120,"formTitle":"[1155]掷骰子的N种方法","frequency":0.2999147674,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":18788,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.43423703975087014,"acs":4741,"articleLive":2,"columnArticles":74,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.2999147674,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":10918,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.3122236958443855,"acs":2825,"articleLive":2,"columnArticles":43,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.4915652692,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9048,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5516976156466322,"acs":5021,"articleLive":2,"columnArticles":57,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"","submitted":9101,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.49588328759208433,"acs":3433,"articleLive":2,"columnArticles":73,"formTitle":"[1159]市场分析 II","frequency":0.9099262031,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"","submitted":6923,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.687734712676256,"acs":58236,"articleLive":2,"columnArticles":896,"formTitle":"[1160]拼写单词","frequency":0.8139139155,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":84678,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.634283220053626,"acs":10172,"articleLive":2,"columnArticles":163,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16037,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.46880372130650216,"acs":37088,"articleLive":2,"columnArticles":485,"formTitle":"[1162]地图分析","frequency":1.5438305501,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":79112,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2671345029239766,"acs":5710,"articleLive":2,"columnArticles":94,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.3582743826,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":21375,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6176122931442081,"acs":5225,"articleLive":2,"columnArticles":75,"formTitle":"[1164]指定日期的产品价格","frequency":0.8446288607,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"","submitted":8460,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8381038579024777,"acs":7408,"articleLive":2,"columnArticles":110,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"","submitted":8839,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4817474566128067,"acs":2415,"articleLive":2,"columnArticles":44,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"","submitted":5013,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.4199142634450507,"acs":2155,"articleLive":2,"columnArticles":33,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"","submitted":5132,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5689981096408318,"acs":1505,"articleLive":2,"columnArticles":23,"formTitle":"[1168]水资源分配优化","frequency":0.5298547857,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"","submitted":2645,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.32261745299399713,"acs":6503,"articleLive":2,"columnArticles":76,"formTitle":"[1169]查询无效交易","frequency":0.9099262031,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20157,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6171344707393139,"acs":13456,"articleLive":2,"columnArticles":209,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.3284392341,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":21804,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47163241361038566,"acs":12461,"articleLive":2,"columnArticles":148,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.2999147674,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":26421,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2703804347826087,"acs":2388,"articleLive":2,"columnArticles":50,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":8832,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7583240562696083,"acs":7493,"articleLive":2,"columnArticles":72,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"","submitted":9881,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6188501934770592,"acs":4478,"articleLive":2,"columnArticles":56,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"","submitted":7236,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.4874442951121171,"acs":6891,"articleLive":2,"columnArticles":106,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14137,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4444444444444444,"acs":4140,"articleLive":2,"columnArticles":56,"formTitle":"[1176]健身计划评估","frequency":0.3582743826,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"","submitted":9315,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26345206937852106,"acs":5939,"articleLive":2,"columnArticles":89,"formTitle":"[1177]构建回文串检测","frequency":0.3284392341,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":22543,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4621297478654949,"acs":18457,"articleLive":2,"columnArticles":181,"formTitle":"[1178]猜字谜","frequency":2.1694555709,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":39939,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6337753337176815,"acs":28582,"articleLive":2,"columnArticles":173,"formTitle":"[1179]重新格式化部门表","frequency":2.6160811894,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":45098,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.772785622593068,"acs":3010,"articleLive":2,"columnArticles":64,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.3895269261,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"","submitted":3895,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3689839572192513,"acs":1449,"articleLive":2,"columnArticles":27,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"","submitted":3927,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.3840889649272883,"acs":1796,"articleLive":2,"columnArticles":36,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"","submitted":4676,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5990430622009569,"acs":626,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"","submitted":1045,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5849031034015449,"acs":12948,"articleLive":2,"columnArticles":250,"formTitle":"[1184]公交站间的距离","frequency":0.8139139155,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22137,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6101028263190426,"acs":10858,"articleLive":2,"columnArticles":192,"formTitle":"[1185]一周中的第几天","frequency":0.7843696691,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":17797,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39063363927900036,"acs":7065,"articleLive":2,"columnArticles":104,"formTitle":"[1186]删除一次得到子数组最大和","frequency":1.3124370993,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":18086,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.43687872763419483,"acs":1758,"articleLive":2,"columnArticles":31,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4024,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6916987106989368,"acs":3058,"articleLive":2,"columnArticles":63,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"","submitted":4421,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.644704,"acs":20147,"articleLive":2,"columnArticles":308,"formTitle":"[1189]“气球” 的最大数量","frequency":0.2464260825,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":31250,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6511188875587071,"acs":42423,"articleLive":2,"columnArticles":594,"formTitle":"[1190]反转每对括号间的子串","frequency":4.5626142907,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":65154,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2678876228260368,"acs":5807,"articleLive":2,"columnArticles":91,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":21677,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.499298200842159,"acs":3913,"articleLive":2,"columnArticles":43,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":7837,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6108591885441528,"acs":5119,"articleLive":2,"columnArticles":66,"formTitle":"[1193]每月交易 I","frequency":0.2464260825,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"","submitted":8380,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5128935295048251,"acs":3242,"articleLive":2,"columnArticles":57,"formTitle":"[1194]锦标赛优胜者","frequency":0.272605588,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"","submitted":6321,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6357090374724468,"acs":12978,"articleLive":2,"columnArticles":254,"formTitle":"[1195]交替打印字符串","frequency":1.3796086275,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":20415,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6914273824386183,"acs":3323,"articleLive":2,"columnArticles":53,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"","submitted":4806,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.36551270454732343,"acs":4445,"articleLive":2,"columnArticles":58,"formTitle":"[1197]进击的骑士","frequency":0.9447123192,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"","submitted":12161,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7482842147759386,"acs":3707,"articleLive":2,"columnArticles":55,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"","submitted":4954,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.4317904993909866,"acs":709,"articleLive":2,"columnArticles":16,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"","submitted":1642,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6859035759897829,"acs":17186,"articleLive":2,"columnArticles":240,"formTitle":"[1200]最小绝对差","frequency":0.8139139155,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":25056,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24688778990450205,"acs":5791,"articleLive":2,"columnArticles":82,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":23456,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5024128788601293,"acs":26340,"articleLive":2,"columnArticles":291,"formTitle":"[1202]交换字符串中的元素","frequency":0.2999147674,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":52427,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6249934831343517,"acs":11988,"articleLive":2,"columnArticles":141,"formTitle":"[1203]项目管理","frequency":0.4567791531,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19181,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7268531468531468,"acs":5197,"articleLive":2,"columnArticles":76,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.8139139155,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"","submitted":7150,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4679864799613713,"acs":4846,"articleLive":2,"columnArticles":76,"formTitle":"[1205]每月交易II","frequency":1.1762496627,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"","submitted":10355,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6183364652358817,"acs":6252,"articleLive":2,"columnArticles":84,"formTitle":"[1206]设计跳表","frequency":0.8446288607,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":10111,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7301783944499505,"acs":58940,"articleLive":2,"columnArticles":817,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":80720,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.49645031540541135,"acs":45174,"articleLive":2,"columnArticles":595,"formTitle":"[1208]尽可能使字符串相等","frequency":1.4744064273,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":90994,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.533342620971487,"acs":11485,"articleLive":2,"columnArticles":155,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":1.7188514244,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":21534,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.44803370786516855,"acs":2552,"articleLive":2,"columnArticles":51,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5696,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6588120740019474,"acs":6766,"articleLive":2,"columnArticles":58,"formTitle":"[1211]查询结果的质量和占比","frequency":0.8139139155,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"","submitted":10270,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5153246182577172,"acs":4691,"articleLive":2,"columnArticles":92,"formTitle":"[1212]查询球队积分","frequency":0.272605588,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"","submitted":9103,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7725538293813028,"acs":5669,"articleLive":2,"columnArticles":118,"formTitle":"[1213]三个有序数组的交集","frequency":0.9099262031,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"","submitted":7338,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6317341722375147,"acs":3213,"articleLive":2,"columnArticles":66,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.4567791531,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"","submitted":5086,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.40840190558683415,"acs":1886,"articleLive":2,"columnArticles":39,"formTitle":"[1215]步进数","frequency":1.2416110468,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"","submitted":4618,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5322518346852066,"acs":1378,"articleLive":2,"columnArticles":36,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"","submitted":2589,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6943205471305383,"acs":21015,"articleLive":2,"columnArticles":343,"formTitle":"[1217]玩筹码","frequency":1.6843795154,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"","submitted":30267,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.4214889123548046,"acs":7983,"articleLive":2,"columnArticles":106,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":18940,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.631460797196671,"acs":11533,"articleLive":2,"columnArticles":165,"formTitle":"[1219]黄金矿工","frequency":1.6843795154,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":18264,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5264643613267467,"acs":3730,"articleLive":2,"columnArticles":68,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7085,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.804134777855084,"acs":40452,"articleLive":2,"columnArticles":649,"formTitle":"[1221]分割平衡字符串","frequency":0.7843696691,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"","submitted":50305,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6713244228432563,"acs":5525,"articleLive":2,"columnArticles":121,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8230,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.47351477904594674,"acs":3236,"articleLive":2,"columnArticles":55,"formTitle":"[1223]掷骰子模拟","frequency":0.5298547857,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":6834,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.32442118844527273,"acs":4526,"articleLive":2,"columnArticles":66,"formTitle":"[1224]最大相等频率","frequency":1.2416110468,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":13951,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5466787989080982,"acs":3004,"articleLive":2,"columnArticles":71,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.9447123192,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"","submitted":5495,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.6007213608957795,"acs":11159,"articleLive":2,"columnArticles":129,"formTitle":"[1226]哲学家进餐","frequency":2.4941480215,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":18576,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6618635926993276,"acs":9646,"articleLive":2,"columnArticles":150,"formTitle":"[1227]飞机座位分配概率","frequency":0.2464260825,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":14574,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5395213923132705,"acs":2976,"articleLive":2,"columnArticles":48,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"","submitted":5516,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.41149382943451834,"acs":2234,"articleLive":2,"columnArticles":40,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"","submitted":5429,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.48665335028145995,"acs":2680,"articleLive":2,"columnArticles":53,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"","submitted":5507,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5548112058465287,"acs":2733,"articleLive":2,"columnArticles":40,"formTitle":"[1231]分享巧克力","frequency":1.0191652974,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"","submitted":4926,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4690513789408381,"acs":33267,"articleLive":2,"columnArticles":409,"formTitle":"[1232]缀点成线","frequency":0.7843696691,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":70924,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48228520814880427,"acs":7623,"articleLive":2,"columnArticles":109,"formTitle":"[1233]删除子文件夹","frequency":0.2999147674,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":15806,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3415177228139857,"acs":5675,"articleLive":2,"columnArticles":83,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.8446288607,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":16617,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4501015022330491,"acs":5543,"articleLive":2,"columnArticles":99,"formTitle":"[1235]规划兼职工作","frequency":1.8925974165,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":12315,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5592369477911646,"acs":1114,"articleLive":2,"columnArticles":31,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"","submitted":1992,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7116656003412242,"acs":10011,"articleLive":2,"columnArticles":126,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14067,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.654965563208176,"acs":2948,"articleLive":2,"columnArticles":69,"formTitle":"[1238]循环码排列","frequency":0.3895269261,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4501,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49071537729592574,"acs":34037,"articleLive":2,"columnArticles":381,"formTitle":"[1239]串联字符串的最大长度","frequency":2.0055842799,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":69362,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.49473044183218484,"acs":2441,"articleLive":2,"columnArticles":38,"formTitle":"[1240]铺瓷砖","frequency":1.659365705,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":4934,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5969562588187866,"acs":5923,"articleLive":2,"columnArticles":63,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"","submitted":9922,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4604632587859425,"acs":1153,"articleLive":2,"columnArticles":19,"formTitle":"[1242]多线程网页爬虫","frequency":1.0591226704,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"","submitted":2504,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5390222984562607,"acs":2514,"articleLive":2,"columnArticles":50,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"","submitted":4664,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6230352303523036,"acs":2299,"articleLive":2,"columnArticles":37,"formTitle":"[1244]力扣排行榜","frequency":0.4567791531,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"","submitted":3690,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5048338368580061,"acs":3342,"articleLive":2,"columnArticles":60,"formTitle":"[1245]树的直径","frequency":0.3582743826,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"","submitted":6620,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4788661522978866,"acs":2855,"articleLive":2,"columnArticles":38,"formTitle":"[1246]删除回文子数组","frequency":0.7284892108,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"","submitted":5962,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6151979372061277,"acs":8112,"articleLive":2,"columnArticles":150,"formTitle":"[1247]交换字符使得字符串相同","frequency":1.5438305501,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"","submitted":13186,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5583616157583017,"acs":33562,"articleLive":2,"columnArticles":460,"formTitle":"[1248]统计「优美子数组」","frequency":0.7843696691,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":60108,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5714955849889625,"acs":20711,"articleLive":2,"columnArticles":303,"formTitle":"[1249]移除无效的括号","frequency":1.7920101796,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":36240,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5602240896358543,"acs":2600,"articleLive":2,"columnArticles":36,"formTitle":"[1250]检查「好数组」","frequency":0.8766008934,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4641,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7718003893841582,"acs":7532,"articleLive":2,"columnArticles":93,"formTitle":"[1251]平均售价","frequency":0.272605588,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"","submitted":9759,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7497767382521795,"acs":17631,"articleLive":2,"columnArticles":301,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":23515,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3934679978329851,"acs":5084,"articleLive":2,"columnArticles":75,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":1.0191652974,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":12921,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.59894913458142,"acs":13565,"articleLive":2,"columnArticles":208,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.2212991324,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":22648,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6765844218674407,"acs":2797,"articleLive":2,"columnArticles":60,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4134,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6617712505562973,"acs":1487,"articleLive":2,"columnArticles":34,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"","submitted":2247,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5636363636363636,"acs":1767,"articleLive":2,"columnArticles":37,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"","submitted":3135,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5638703527168732,"acs":1183,"articleLive":2,"columnArticles":42,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"","submitted":2098,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4759651307596513,"acs":1911,"articleLive":2,"columnArticles":44,"formTitle":"[1259]不相交的握手","frequency":0.7843696691,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"","submitted":4015,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6033838383838384,"acs":11947,"articleLive":2,"columnArticles":242,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":19800,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7298462141247919,"acs":7451,"articleLive":2,"columnArticles":96,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10209,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5262440354464895,"acs":12352,"articleLive":2,"columnArticles":186,"formTitle":"[1262]可被三整除的最大和","frequency":2.067716061,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":23472,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4178121420389462,"acs":2918,"articleLive":2,"columnArticles":56,"formTitle":"[1263]推箱子","frequency":0.5298547857,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":6984,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5733775341068469,"acs":4497,"articleLive":2,"columnArticles":80,"formTitle":"[1264]页面推荐","frequency":0.2999147674,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"","submitted":7843,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9201012292118583,"acs":2545,"articleLive":2,"columnArticles":61,"formTitle":"[1265]逆序打印不可变链表","frequency":0.3284392341,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"","submitted":2766,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8236019276028241,"acs":29396,"articleLive":2,"columnArticles":448,"formTitle":"[1266]访问所有点的最小时间","frequency":1.1156189128,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":35692,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6089015151515151,"acs":9002,"articleLive":2,"columnArticles":143,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":14784,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5801842598376015,"acs":7431,"articleLive":2,"columnArticles":135,"formTitle":"[1268]搜索推荐系统","frequency":0.2999147674,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"","submitted":12808,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4917984432609586,"acs":30012,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":2.2836044414,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61025,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8041827818364131,"acs":5614,"articleLive":2,"columnArticles":76,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.7559182479,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"","submitted":6981,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5044548154433602,"acs":2378,"articleLive":2,"columnArticles":38,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"","submitted":4714,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5178691840863116,"acs":1536,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"","submitted":2966,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.539124192390524,"acs":1502,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"","submitted":2786,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.5952685421994884,"acs":931,"articleLive":2,"columnArticles":23,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"","submitted":1564,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5398794024941757,"acs":7879,"articleLive":2,"columnArticles":164,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.7843696691,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":14594,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5009899421873762,"acs":6326,"articleLive":2,"columnArticles":94,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":12627,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7237386934673367,"acs":18003,"articleLive":2,"columnArticles":225,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":1.1762496627,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":24875,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5953848863836534,"acs":3380,"articleLive":2,"columnArticles":58,"formTitle":"[1278]分割回文串 III","frequency":2.8461439831,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":5677,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6205170975813178,"acs":1488,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":1.0591226704,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"","submitted":2398,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5061991953362345,"acs":6165,"articleLive":2,"columnArticles":65,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.7843696691,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"","submitted":12179,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8313648049480235,"acs":44626,"articleLive":2,"columnArticles":604,"formTitle":"[1281]整数的各位积和之差","frequency":1.1762496627,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":53678,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8113401355885776,"acs":11848,"articleLive":2,"columnArticles":222,"formTitle":"[1282]用户分组","frequency":0.272605588,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":14603,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.4158090514569126,"acs":6707,"articleLive":2,"columnArticles":95,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.8139139155,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16130,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6588328492210193,"acs":2495,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":1.1453830147,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3787,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8120993589743589,"acs":4054,"articleLive":2,"columnArticles":55,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"","submitted":4992,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6445317983995508,"acs":4591,"articleLive":2,"columnArticles":86,"formTitle":"[1286]字母组合迭代器","frequency":0.8139139155,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7123,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6057704062920249,"acs":14865,"articleLive":2,"columnArticles":213,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.8139139155,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":24539,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5630959308832088,"acs":12579,"articleLive":2,"columnArticles":160,"formTitle":"[1288]删除被覆盖区间","frequency":1.4100755689,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":22339,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6310743081281325,"acs":5792,"articleLive":2,"columnArticles":83,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":9178,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8089866662517698,"acs":51996,"articleLive":2,"columnArticles":680,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":64273,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5175445361301766,"acs":6711,"articleLive":2,"columnArticles":147,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":12967,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.46848339269444217,"acs":5656,"articleLive":2,"columnArticles":89,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.2999147674,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12073,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.35581525090289806,"acs":12118,"articleLive":2,"columnArticles":122,"formTitle":"[1293]网格中的最短路径","frequency":2.6793133746,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":34057,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6611116756427192,"acs":6506,"articleLive":2,"columnArticles":71,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"","submitted":9841,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.809372312983663,"acs":47065,"articleLive":2,"columnArticles":625,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.272605588,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":58150,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.45128547985169876,"acs":7425,"articleLive":2,"columnArticles":119,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":16453,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.4600014746000147,"acs":6239,"articleLive":2,"columnArticles":87,"formTitle":"[1297]子串的最大出现次数","frequency":1.2762885852,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":13563,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5945883441258094,"acs":2571,"articleLive":2,"columnArticles":87,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4324,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7855199556248184,"acs":29739,"articleLive":2,"columnArticles":424,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":37859,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4674594722518045,"acs":23703,"articleLive":2,"columnArticles":361,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.2999147674,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":50706,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.35701185964054283,"acs":2920,"articleLive":2,"columnArticles":68,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8179,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8163069961712496,"acs":18762,"articleLive":2,"columnArticles":283,"formTitle":"[1302]层数最深叶子节点的和","frequency":1.2082968401,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":22984,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8212555610479486,"acs":8307,"articleLive":2,"columnArticles":79,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"","submitted":10115,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7258591035136368,"acs":20679,"articleLive":2,"columnArticles":370,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.2464260825,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":28489,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7472169005333196,"acs":14431,"articleLive":2,"columnArticles":214,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.2464260825,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":19313,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5769326021581461,"acs":16307,"articleLive":2,"columnArticles":258,"formTitle":"[1306]跳跃游戏 III","frequency":0.8446288607,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":28265,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3320290665176076,"acs":1782,"articleLive":2,"columnArticles":52,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5367,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7518602885345482,"acs":4951,"articleLive":2,"columnArticles":55,"formTitle":"[1308]不同性别每日分数总计","frequency":0.272605588,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"","submitted":6585,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7552744585511576,"acs":16181,"articleLive":2,"columnArticles":277,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":21424,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.712266532054518,"acs":36686,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":2.5723739706,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":51506,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.37578317493840196,"acs":5338,"articleLive":2,"columnArticles":82,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.3582743826,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14205,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6657981349424026,"acs":9710,"articleLive":2,"columnArticles":140,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":1.6511803438,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":14584,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8309080817587297,"acs":34432,"articleLive":2,"columnArticles":536,"formTitle":"[1313]解压缩编码列表","frequency":0.272605588,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":41439,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7334351589206488,"acs":10084,"articleLive":2,"columnArticles":173,"formTitle":"[1314]矩阵区域和","frequency":1.6511803438,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":13749,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8096474712718301,"acs":12471,"articleLive":2,"columnArticles":255,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15403,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.43575787563912255,"acs":2642,"articleLive":2,"columnArticles":55,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6063,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6140778214977203,"acs":9832,"articleLive":2,"columnArticles":184,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16011,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6486753874903814,"acs":5901,"articleLive":2,"columnArticles":101,"formTitle":"[1318]或运算的最小翻转次数","frequency":3.1680480406,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9097,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6178018032888357,"acs":29943,"articleLive":2,"columnArticles":507,"formTitle":"[1319]连通网络的操作次数","frequency":0.2999147674,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":48467,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.587149187592319,"acs":2385,"articleLive":2,"columnArticles":55,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4062,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6178517397881997,"acs":4084,"articleLive":2,"columnArticles":73,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"","submitted":6610,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.591993287786168,"acs":4939,"articleLive":2,"columnArticles":63,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"","submitted":8343,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7553427386958897,"acs":23504,"articleLive":2,"columnArticles":465,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":1.1762496627,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":31117,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5922420965058236,"acs":5695,"articleLive":2,"columnArticles":112,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":9616,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7276967052805777,"acs":9674,"articleLive":2,"columnArticles":173,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.272605588,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":13294,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47566526610644255,"acs":5434,"articleLive":2,"columnArticles":91,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.3895269261,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":11424,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6939853698184774,"acs":5123,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"","submitted":7382,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.45636172450052576,"acs":5642,"articleLive":2,"columnArticles":113,"formTitle":"[1328]破坏回文串","frequency":0.8446288607,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12363,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7744464944649446,"acs":6716,"articleLive":2,"columnArticles":152,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.3582743826,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":8672,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.37566666666666665,"acs":1127,"articleLive":2,"columnArticles":28,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.7284892108,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3000,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5344018208544739,"acs":11270,"articleLive":2,"columnArticles":191,"formTitle":"[1331]数组序号转换","frequency":0.2464260825,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":21089,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6825324180015255,"acs":8948,"articleLive":2,"columnArticles":130,"formTitle":"[1332]删除回文子序列","frequency":0.272605588,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13110,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5416498993963783,"acs":5384,"articleLive":2,"columnArticles":114,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":9940,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.48602571268865286,"acs":5217,"articleLive":2,"columnArticles":88,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":2.3860480858,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":10734,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5814860790920376,"acs":3279,"articleLive":2,"columnArticles":55,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":5639,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.42194627470856566,"acs":1665,"articleLive":2,"columnArticles":46,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"","submitted":3946,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7071431259643973,"acs":37579,"articleLive":2,"columnArticles":604,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.6771299609,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":53142,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6400205534757396,"acs":8719,"articleLive":2,"columnArticles":123,"formTitle":"[1338]数组大小减半","frequency":0.2464260825,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":13623,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.3971186185432458,"acs":7911,"articleLive":2,"columnArticles":127,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.3582743826,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":19921,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5709830508474576,"acs":4211,"articleLive":2,"columnArticles":94,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7375,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.4831893892658853,"acs":3133,"articleLive":2,"columnArticles":45,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"","submitted":6484,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8202815443123669,"acs":41197,"articleLive":2,"columnArticles":627,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":50223,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5414778668525618,"acs":12428,"articleLive":2,"columnArticles":210,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":22952,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5927461139896373,"acs":5720,"articleLive":2,"columnArticles":116,"formTitle":"[1344]时钟指针的夹角","frequency":0.2999147674,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":9650,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.36750945650009953,"acs":5538,"articleLive":2,"columnArticles":107,"formTitle":"[1345]跳跃游戏 IV","frequency":0.3284392341,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15069,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.4360371914075024,"acs":14960,"articleLive":2,"columnArticles":256,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":34309,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7378526645768025,"acs":7532,"articleLive":2,"columnArticles":110,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10208,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.302801289802499,"acs":3005,"articleLive":2,"columnArticles":47,"formTitle":"[1348]推文计数","frequency":0.4223167489,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":9924,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5003379520108144,"acs":2961,"articleLive":2,"columnArticles":93,"formTitle":"[1349]参加考试的最大学生数","frequency":0.3582743826,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":5918,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8476149823924874,"acs":7943,"articleLive":2,"columnArticles":82,"formTitle":"[1350]院系无效的学生","frequency":0.272605588,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"","submitted":9371,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7543044975477408,"acs":28914,"articleLive":2,"columnArticles":534,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.2464260825,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":38332,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44104038137969714,"acs":6291,"articleLive":2,"columnArticles":70,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.3284392341,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":14264,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.2826310923259807,"acs":10699,"articleLive":2,"columnArticles":146,"formTitle":"[1353]最多可以参加的会议数目","frequency":2.4941480215,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":37855,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.28476278307203606,"acs":2779,"articleLive":2,"columnArticles":69,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":9759,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6620715350223547,"acs":3554,"articleLive":2,"columnArticles":53,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"","submitted":5368,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7318368801217893,"acs":45188,"articleLive":2,"columnArticles":498,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.7843696691,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":61746,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5267981116356567,"acs":3794,"articleLive":2,"columnArticles":40,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7202,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.48458395245170877,"acs":5218,"articleLive":2,"columnArticles":107,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.272605588,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":10768,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5439605587510271,"acs":2648,"articleLive":2,"columnArticles":64,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":4868,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5029424518367094,"acs":8119,"articleLive":2,"columnArticles":133,"formTitle":"[1360]日期之间隔几天","frequency":1.6511803438,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":16143,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.40143124893508264,"acs":7068,"articleLive":2,"columnArticles":188,"formTitle":"[1361]验证二叉树","frequency":0.2212991324,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":17607,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5233203205259914,"acs":5094,"articleLive":2,"columnArticles":67,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":9734,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.35990338164251207,"acs":4619,"articleLive":2,"columnArticles":96,"formTitle":"[1363]形成三的最大倍数","frequency":1.7188514244,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":12834,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.67578125,"acs":3114,"articleLive":2,"columnArticles":60,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.272605588,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"","submitted":4608,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250140711556122,"acs":83550,"articleLive":2,"columnArticles":1073,"formTitle":"[1365]有多少小于当前数字的数字","frequency":1.1762496627,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":101271,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5361156959836516,"acs":6821,"articleLive":2,"columnArticles":138,"formTitle":"[1366]通过投票对团队排名","frequency":0.8446288607,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":12723,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41648411050101,"acs":14639,"articleLive":2,"columnArticles":216,"formTitle":"[1367]二叉树中的列表","frequency":0.7843696691,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":35149,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5170488835244418,"acs":3427,"articleLive":2,"columnArticles":83,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6628,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6067554240631163,"acs":2461,"articleLive":2,"columnArticles":39,"formTitle":"[1369]获取最近第二次的活动","frequency":0.3284392341,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"","submitted":4056,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7905111428476536,"acs":47603,"articleLive":2,"columnArticles":570,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60218,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5799071432566986,"acs":20734,"articleLive":2,"columnArticles":261,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":1.9718656439,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":35754,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5144817576037475,"acs":7798,"articleLive":2,"columnArticles":158,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.3284392341,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":15157,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.3958359306819599,"acs":6350,"articleLive":2,"columnArticles":149,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":1.1762496627,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":16042,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7387689419337535,"acs":16527,"articleLive":2,"columnArticles":221,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22371,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5708327635717216,"acs":8349,"articleLive":2,"columnArticles":167,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":14626,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5038950101761527,"acs":7180,"articleLive":2,"columnArticles":149,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.272605588,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14249,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.3250484183344093,"acs":4028,"articleLive":2,"columnArticles":128,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12392,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.862591563526143,"acs":6830,"articleLive":2,"columnArticles":58,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"","submitted":7918,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8362047440699126,"acs":10047,"articleLive":2,"columnArticles":155,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12015,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7275719051483185,"acs":16139,"articleLive":2,"columnArticles":243,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22182,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.732171052631579,"acs":11129,"articleLive":2,"columnArticles":140,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":15200,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6897983392645315,"acs":10467,"articleLive":2,"columnArticles":165,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.3284392341,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":15174,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.3227236392704019,"acs":4441,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":0.4567791531,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":13761,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5413803406035256,"acs":1812,"articleLive":2,"columnArticles":43,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"","submitted":3347,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7033532082490017,"acs":12858,"articleLive":2,"columnArticles":191,"formTitle":"[1385]两个数组间的距离值","frequency":0.272605588,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":18281,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.30984746290339316,"acs":5972,"articleLive":2,"columnArticles":123,"formTitle":"[1386]安排电影院座位","frequency":0.9447123192,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":19274,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6946912401791615,"acs":9461,"articleLive":2,"columnArticles":167,"formTitle":"[1387]将整数按权重排序","frequency":0.9099262031,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":13619,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.535240180648693,"acs":3911,"articleLive":2,"columnArticles":51,"formTitle":"[1388]3n 块披萨","frequency":2.7520198048,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7307,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8306201667017723,"acs":27604,"articleLive":2,"columnArticles":471,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.8139139155,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33233,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3501488776912506,"acs":6115,"articleLive":2,"columnArticles":113,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17464,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.3991669774959592,"acs":6421,"articleLive":2,"columnArticles":199,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.9447123192,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16086,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.3974837165284195,"acs":7140,"articleLive":2,"columnArticles":128,"formTitle":"[1392]最长快乐前缀","frequency":0.272605588,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":17963,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8567555354722096,"acs":3792,"articleLive":2,"columnArticles":56,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"","submitted":4426,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.664128012963338,"acs":16394,"articleLive":2,"columnArticles":262,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":24685,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.754633183463099,"acs":13763,"articleLive":2,"columnArticles":207,"formTitle":"[1395]统计作战单位数","frequency":0.272605588,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":18238,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.415419090302279,"acs":8713,"articleLive":2,"columnArticles":130,"formTitle":"[1396]设计地铁系统","frequency":0.9447123192,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":20974,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3652762119503946,"acs":972,"articleLive":2,"columnArticles":35,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2661,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7725638599810786,"acs":4083,"articleLive":2,"columnArticles":60,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"","submitted":5285,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6666169784601624,"acs":8944,"articleLive":2,"columnArticles":147,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":13417,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6035342093339374,"acs":5328,"articleLive":2,"columnArticles":87,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.272605588,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"","submitted":8828,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.4148818723780084,"acs":3758,"articleLive":2,"columnArticles":87,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.3284392341,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9058,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7507937800211675,"acs":9222,"articleLive":2,"columnArticles":167,"formTitle":"[1402]做菜顺序","frequency":0.2999147674,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12283,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6913132534166079,"acs":20588,"articleLive":2,"columnArticles":350,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.7559182479,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":29781,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4912440459512468,"acs":7013,"articleLive":2,"columnArticles":149,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.3582743826,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14276,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5057634164777022,"acs":5353,"articleLive":2,"columnArticles":134,"formTitle":"[1405]最长快乐字符串","frequency":0.8446288607,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":10584,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5683040078201369,"acs":4651,"articleLive":2,"columnArticles":78,"formTitle":"[1406]石子游戏 III","frequency":0.272605588,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8184,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6672285095111967,"acs":5542,"articleLive":2,"columnArticles":64,"formTitle":"[1407]排名靠前的旅行者","frequency":0.7843696691,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"","submitted":8306,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6135391124573297,"acs":12761,"articleLive":2,"columnArticles":196,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":20799,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8049779780805081,"acs":7859,"articleLive":2,"columnArticles":128,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":9763,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.47702994953797756,"acs":7279,"articleLive":2,"columnArticles":116,"formTitle":"[1410]HTML 实体解析器","frequency":0.3895269261,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15259,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5490024117518089,"acs":7512,"articleLive":2,"columnArticles":139,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":3.9031683481,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":13683,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5541276410368111,"acs":2544,"articleLive":2,"columnArticles":61,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"","submitted":4591,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6912557262193478,"acs":10261,"articleLive":2,"columnArticles":208,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.8446288607,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":14844,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6019277923395621,"acs":7119,"articleLive":2,"columnArticles":143,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":11827,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.683978967700397,"acs":6374,"articleLive":2,"columnArticles":170,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.2464260825,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9319,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.4076923076923077,"acs":2703,"articleLive":2,"columnArticles":47,"formTitle":"[1416]恢复数组","frequency":1.2941717514,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6630,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5187294724150834,"acs":12477,"articleLive":2,"columnArticles":180,"formTitle":"[1417]重新格式化字符串","frequency":0.2212991324,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24053,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7334019851826425,"acs":25639,"articleLive":2,"columnArticles":412,"formTitle":"[1418]点菜展示表","frequency":2.3860480858,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":34959,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4176086956521739,"acs":7684,"articleLive":2,"columnArticles":148,"formTitle":"[1419]数青蛙","frequency":1.2416110468,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18400,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5921052631578947,"acs":2340,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":1.1921204925,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":3952,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7494890510948905,"acs":2567,"articleLive":2,"columnArticles":32,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"","submitted":3425,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5404610365299246,"acs":10105,"articleLive":2,"columnArticles":186,"formTitle":"[1422]分割字符串的最大得分","frequency":1.4100755689,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":18697,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5546028362980572,"acs":33828,"articleLive":2,"columnArticles":499,"formTitle":"[1423]可获得的最大点数","frequency":0.7843696691,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":60995,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.3959488937363665,"acs":6353,"articleLive":2,"columnArticles":133,"formTitle":"[1424]对角线遍历 II","frequency":0.8446288607,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16045,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43367273770256703,"acs":3024,"articleLive":2,"columnArticles":66,"formTitle":"[1425]带限制的子序列和","frequency":0.2999147674,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":6973,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7011128775834659,"acs":1323,"articleLive":2,"columnArticles":44,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"","submitted":1887,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6592890677397719,"acs":983,"articleLive":2,"columnArticles":42,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"","submitted":1491,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5919243986254296,"acs":689,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"","submitted":1164,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5080291970802919,"acs":1044,"articleLive":2,"columnArticles":35,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"","submitted":2055,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.57548032936871,"acs":629,"articleLive":2,"columnArticles":25,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"","submitted":1093,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8461110140623636,"acs":77497,"articleLive":2,"columnArticles":1020,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.272605588,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":91592,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39210053859964095,"acs":4368,"articleLive":2,"columnArticles":96,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11140,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6409429556321583,"acs":5764,"articleLive":2,"columnArticles":97,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":8993,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.44621979734996103,"acs":2290,"articleLive":2,"columnArticles":44,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5132,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.623523701666397,"acs":3854,"articleLive":2,"columnArticles":45,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"","submitted":6181,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.7829466053880357,"acs":20954,"articleLive":2,"columnArticles":363,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"","submitted":26763,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5894118345302392,"acs":9931,"articleLive":2,"columnArticles":167,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.272605588,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":16849,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4818280118943922,"acs":32083,"articleLive":2,"columnArticles":457,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":1.5438305501,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":66586,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5603420969274627,"acs":3538,"articleLive":2,"columnArticles":55,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6314,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.69459232277949,"acs":2479,"articleLive":2,"columnArticles":33,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"","submitted":3569,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6466716529543755,"acs":17292,"articleLive":2,"columnArticles":356,"formTitle":"[1441]用栈操作构建数组","frequency":0.3284392341,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":26740,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.791620575221239,"acs":34350,"articleLive":2,"columnArticles":372,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":2.6067125617,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43392,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4105461393596987,"acs":5450,"articleLive":2,"columnArticles":137,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13275,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5236809306190279,"acs":2521,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":4814,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8567422294928722,"acs":3666,"articleLive":2,"columnArticles":46,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"","submitted":4279,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5730507910866157,"acs":12061,"articleLive":2,"columnArticles":205,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":21047,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6168760831889082,"acs":5695,"articleLive":2,"columnArticles":68,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9232,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7129739570964934,"acs":9007,"articleLive":2,"columnArticles":141,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.2212991324,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":12633,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6275215859371975,"acs":16207,"articleLive":2,"columnArticles":206,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":1.7546924166,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":25827,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8021574165447307,"acs":23573,"articleLive":2,"columnArticles":336,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.7843696691,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":29387,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5206434316353887,"acs":9710,"articleLive":2,"columnArticles":149,"formTitle":"[1451]重新排列句子中的单词","frequency":0.3582743826,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":18650,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.49724375538329024,"acs":5773,"articleLive":2,"columnArticles":88,"formTitle":"[1452]收藏清单","frequency":0.4567791531,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11610,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36261980830670926,"acs":1589,"articleLive":2,"columnArticles":30,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4382,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.4027235666579929,"acs":4643,"articleLive":2,"columnArticles":75,"formTitle":"[1454]活跃用户","frequency":0.3582743826,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"","submitted":11529,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6340591663917299,"acs":11531,"articleLive":2,"columnArticles":193,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":18186,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5175951835834818,"acs":12208,"articleLive":2,"columnArticles":190,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":23586,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6368944814540669,"acs":7744,"articleLive":2,"columnArticles":134,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12159,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4401286690792119,"acs":5473,"articleLive":2,"columnArticles":85,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12435,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5956361575517144,"acs":2102,"articleLive":2,"columnArticles":45,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"","submitted":3529,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7436259908113293,"acs":14729,"articleLive":2,"columnArticles":305,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":19807,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.49923869234214063,"acs":5574,"articleLive":2,"columnArticles":79,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11165,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.42541106128550077,"acs":5692,"articleLive":2,"columnArticles":118,"formTitle":"[1462]课程表 IV","frequency":0.272605588,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":13380,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5880746472462449,"acs":2584,"articleLive":2,"columnArticles":62,"formTitle":"[1463]摘樱桃 II","frequency":0.5298547857,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4394,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7675389502344577,"acs":25371,"articleLive":2,"columnArticles":358,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.272605588,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":33055,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.30742191423119414,"acs":6122,"articleLive":2,"columnArticles":77,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":19914,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4833240468041073,"acs":6072,"articleLive":2,"columnArticles":120,"formTitle":"[1466]重新规划路线","frequency":0.8446288607,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":12563,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6111325860069579,"acs":1581,"articleLive":2,"columnArticles":45,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2587,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7145454545454546,"acs":2751,"articleLive":2,"columnArticles":47,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"","submitted":3850,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.8029480217222653,"acs":2070,"articleLive":2,"columnArticles":77,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"","submitted":2578,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8434310148049318,"acs":52469,"articleLive":2,"columnArticles":718,"formTitle":"[1470]重新排列数组","frequency":2.0055842799,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":62209,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5409046436366373,"acs":7187,"articleLive":2,"columnArticles":101,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13287,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.615993802186451,"acs":7156,"articleLive":2,"columnArticles":121,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":11617,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6754409171075838,"acs":15319,"articleLive":2,"columnArticles":163,"formTitle":"[1473]粉刷房子 III","frequency":2.2439953034,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":22680,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7216411906677394,"acs":1794,"articleLive":2,"columnArticles":59,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"","submitted":2486,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7240356083086054,"acs":13664,"articleLive":2,"columnArticles":218,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":18872,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8657060921871721,"acs":12377,"articleLive":2,"columnArticles":111,"formTitle":"[1476]子矩形查询","frequency":0.8446288607,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14297,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.2901276860791031,"acs":4658,"articleLive":2,"columnArticles":94,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.9447123192,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":16055,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5696955825131609,"acs":2489,"articleLive":2,"columnArticles":55,"formTitle":"[1478]安排邮筒","frequency":1.3896458492,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4369,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.577185570360741,"acs":1776,"articleLive":2,"columnArticles":36,"formTitle":"[1479]周内每天的销售情况","frequency":0.4223167489,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"","submitted":3077,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8543849046467902,"acs":101788,"articleLive":2,"columnArticles":1070,"formTitle":"[1480]一维数组的动态和","frequency":2.9795217069,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"","submitted":119136,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5134726497111075,"acs":9509,"articleLive":2,"columnArticles":137,"formTitle":"[1481]不同整数的最少数目","frequency":0.8139139155,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":18519,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5869117901578815,"acs":30520,"articleLive":2,"columnArticles":397,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":2.4610598086,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":52001,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.30050577345166524,"acs":3149,"articleLive":2,"columnArticles":67,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":10479,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8030467899891186,"acs":738,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"","submitted":919,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6624737945492662,"acs":3476,"articleLive":2,"columnArticles":43,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"","submitted":5247,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8585288863875499,"acs":70171,"articleLive":2,"columnArticles":672,"formTitle":"[1486]数组异或操作","frequency":2.3165346477,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":81734,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.30735141851314973,"acs":7421,"articleLive":2,"columnArticles":99,"formTitle":"[1487]保证文件名唯一","frequency":1.2082968401,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24145,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23448817821511547,"acs":6863,"articleLive":2,"columnArticles":107,"formTitle":"[1488]避免洪水泛滥","frequency":2.8583616061,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":29268,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6933227925079056,"acs":11401,"articleLive":2,"columnArticles":124,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16444,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8560126582278481,"acs":1082,"articleLive":2,"columnArticles":27,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"","submitted":1264,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6709713254183156,"acs":19328,"articleLive":2,"columnArticles":291,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":28806,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6665585468699319,"acs":6165,"articleLive":2,"columnArticles":74,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":9249,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5661388355726168,"acs":7079,"articleLive":2,"columnArticles":136,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":1.1156189128,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":12504,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3602550478214665,"acs":2034,"articleLive":2,"columnArticles":33,"formTitle":"[1494]并行课程 II","frequency":1.3124370993,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":5646,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5431841831425598,"acs":3654,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"","submitted":6727,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.538493420370946,"acs":10394,"articleLive":2,"columnArticles":157,"formTitle":"[1496]判断路径是否相交","frequency":0.2212991324,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":19302,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3922437955460429,"acs":7697,"articleLive":2,"columnArticles":105,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":19623,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3317996932719877,"acs":4976,"articleLive":2,"columnArticles":62,"formTitle":"[1498]满足条件的子序列数目","frequency":0.8139139155,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":14997,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.37803780378037805,"acs":2520,"articleLive":2,"columnArticles":56,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":6666,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.29381175247009883,"acs":565,"articleLive":2,"columnArticles":25,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"","submitted":1923,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.59325240422513,"acs":3763,"articleLive":2,"columnArticles":55,"formTitle":"[1501]可以放心投资的国家","frequency":1.1453830147,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"","submitted":6343,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7180663064115671,"acs":24583,"articleLive":2,"columnArticles":295,"formTitle":"[1502]判断能否形成等差数列","frequency":1.4100755689,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":34235,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5116091882855551,"acs":8263,"articleLive":2,"columnArticles":79,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.8766008934,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16151,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5929783302536537,"acs":7060,"articleLive":2,"columnArticles":126,"formTitle":"[1504]统计全 1 子矩形","frequency":1.6191673668,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":11906,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3574419920769666,"acs":3158,"articleLive":2,"columnArticles":71,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":1.7014506026,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":8835,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8388704318936877,"acs":505,"articleLive":2,"columnArticles":15,"formTitle":"[1506]找到 N 叉树的根节点","frequency":1.5438305501,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"","submitted":602,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5900932775812159,"acs":9173,"articleLive":2,"columnArticles":125,"formTitle":"[1507]转变日期格式","frequency":1.4416488308,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":15545,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5515678126180582,"acs":5840,"articleLive":2,"columnArticles":48,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.3284392341,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":10588,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5445313411929497,"acs":4665,"articleLive":2,"columnArticles":71,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":8567,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5771125893077113,"acs":4685,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.7843696691,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8118,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6839153247693143,"acs":3780,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":0.272605588,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"","submitted":5527,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8484808200765129,"acs":57443,"articleLive":2,"columnArticles":731,"formTitle":"[1512]好数对的数目","frequency":0.2999147674,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":67701,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37783941298318297,"acs":10762,"articleLive":2,"columnArticles":146,"formTitle":"[1513]仅含 1 的子串数","frequency":0.2999147674,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":28483,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.314970007057163,"acs":7141,"articleLive":2,"columnArticles":128,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":22672,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34049623393885686,"acs":3074,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.6450553705,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9028,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5369318181818182,"acs":189,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"","submitted":352,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7284921369102683,"acs":3150,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"","submitted":4324,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6751855839519465,"acs":23830,"articleLive":2,"columnArticles":386,"formTitle":"[1518]换酒问题","frequency":1.1453830147,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":35294,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.294973544973545,"acs":5352,"articleLive":2,"columnArticles":121,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18144,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.3293559322033898,"acs":2429,"articleLive":2,"columnArticles":70,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7375,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3957979298625058,"acs":2562,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.7843696691,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6473,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7107728337236534,"acs":607,"articleLive":2,"columnArticles":22,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"","submitted":854,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5776314184656666,"acs":9472,"articleLive":2,"columnArticles":163,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":16398,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4224907063197026,"acs":4546,"articleLive":2,"columnArticles":96,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.8446288607,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":10760,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6594664931685101,"acs":5068,"articleLive":2,"columnArticles":107,"formTitle":"[1525]字符串的好分割数目","frequency":0.2999147674,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":7685,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6116025509154495,"acs":2973,"articleLive":2,"columnArticles":46,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":4861,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5097978706989662,"acs":3304,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"","submitted":6481,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7840350358687767,"acs":29181,"articleLive":2,"columnArticles":347,"formTitle":"[1528]重新排列字符串","frequency":0.2464260825,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":37219,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6886792452830188,"acs":8687,"articleLive":2,"columnArticles":130,"formTitle":"[1529]灯泡开关 IV","frequency":0.272605588,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12614,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.565528781793842,"acs":8449,"articleLive":2,"columnArticles":143,"formTitle":"[1530]好叶子节点对的数量","frequency":0.9447123192,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":14940,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.32206178029610677,"acs":1762,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":1.0591226704,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5471,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6203492786636294,"acs":2451,"articleLive":2,"columnArticles":45,"formTitle":"[1532]最近的三笔订单","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"","submitted":3951,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6093023255813953,"acs":262,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"","submitted":430,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7883547667631566,"acs":16613,"articleLive":2,"columnArticles":156,"formTitle":"[1534]统计好三元组","frequency":0.2464260825,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21073,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.45237846678498106,"acs":13000,"articleLive":2,"columnArticles":176,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.3582743826,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":28737,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4378769601930036,"acs":3993,"articleLive":2,"columnArticles":75,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9119,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.36496103015926806,"acs":4308,"articleLive":2,"columnArticles":86,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":11804,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.5956284153005464,"acs":109,"articleLive":2,"columnArticles":6,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"","submitted":183,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5379072791817511,"acs":15304,"articleLive":2,"columnArticles":227,"formTitle":"[1539]第 k 个缺失的正整数","frequency":2.742625654,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":28451,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3153219837157661,"acs":4686,"articleLive":2,"columnArticles":83,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":14861,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4567891044160132,"acs":5534,"articleLive":2,"columnArticles":89,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12115,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.37849117174959873,"acs":2358,"articleLive":2,"columnArticles":46,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6230,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5491636066911465,"acs":2692,"articleLive":2,"columnArticles":42,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"","submitted":4902,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5429215984999414,"acs":18531,"articleLive":2,"columnArticles":303,"formTitle":"[1544]整理字符串","frequency":1.1453830147,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":34132,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5521247324977071,"acs":7224,"articleLive":2,"columnArticles":99,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.3582743826,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13084,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4082855003743449,"acs":4908,"articleLive":2,"columnArticles":73,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12021,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5314646881011267,"acs":3868,"articleLive":2,"columnArticles":68,"formTitle":"[1547]切棍子的最小成本","frequency":1.3124370993,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7278,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7096069868995634,"acs":325,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"","submitted":458,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.665377751338489,"acs":2237,"articleLive":2,"columnArticles":43,"formTitle":"[1549]每件商品的最新订单","frequency":0.2999147674,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"","submitted":3362,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6599743425272611,"acs":20578,"articleLive":2,"columnArticles":279,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.272605588,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":31180,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8173033368564094,"acs":10826,"articleLive":2,"columnArticles":146,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.272605588,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13246,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5057578768925002,"acs":8652,"articleLive":2,"columnArticles":120,"formTitle":"[1552]两球之间的磁力","frequency":0.2999147674,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17107,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.293300169765881,"acs":7429,"articleLive":2,"columnArticles":119,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":2.8021670477,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":25329,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.6992481203007519,"acs":465,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"","submitted":665,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4360948567908839,"acs":2832,"articleLive":2,"columnArticles":53,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"","submitted":6494,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5794602698650675,"acs":10049,"articleLive":2,"columnArticles":153,"formTitle":"[1556]千位分隔数","frequency":2.1814749464,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":17342,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7607800650054172,"acs":7022,"articleLive":2,"columnArticles":93,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":9230,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6206896551724138,"acs":4320,"articleLive":2,"columnArticles":67,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.4915652692,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":6960,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.36499048045693805,"acs":3259,"articleLive":2,"columnArticles":59,"formTitle":"[1559]二维网格图中探测环","frequency":0.5646409018,"frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","questionId":"1663","status":"","submitted":8929,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5734577643587456,"acs":8357,"articleLive":2,"columnArticles":88,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.3284392341,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":14573,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7789824854045038,"acs":11208,"articleLive":2,"columnArticles":150,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.8139139155,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":14388,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3091044221479004,"acs":4159,"articleLive":2,"columnArticles":82,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.5298547857,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13455,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3763004062221342,"acs":3798,"articleLive":2,"columnArticles":65,"formTitle":"[1563]石子游戏 V","frequency":2.1147835719,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10093,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5854870775347912,"acs":589,"articleLive":2,"columnArticles":22,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"","submitted":1006,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7253155159613957,"acs":2931,"articleLive":2,"columnArticles":39,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.272605588,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"","submitted":4041,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4455131964809384,"acs":7596,"articleLive":2,"columnArticles":114,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.272605588,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17050,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.3885849291221089,"acs":9375,"articleLive":2,"columnArticles":167,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.1739305804,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":24126,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45361014146610323,"acs":2469,"articleLive":2,"columnArticles":45,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5443,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47213658999288594,"acs":1991,"articleLive":2,"columnArticles":44,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4217,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8988015978695073,"acs":1350,"articleLive":2,"columnArticles":33,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"","submitted":1502,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.757823784304285,"acs":3148,"articleLive":2,"columnArticles":42,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"","submitted":4154,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8048652661920775,"acs":18429,"articleLive":2,"columnArticles":312,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.1739305804,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":22897,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2955814434410974,"acs":4288,"articleLive":2,"columnArticles":59,"formTitle":"[1573]分割字符串的方案数","frequency":0.2999147674,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":14507,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.32585895117540686,"acs":4505,"articleLive":2,"columnArticles":76,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":1.6843795154,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":13825,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.6012362178416305,"acs":3599,"articleLive":2,"columnArticles":60,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":5986,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.4763811927360509,"acs":17366,"articleLive":2,"columnArticles":244,"formTitle":"[1576]替换所有的问号","frequency":0.272605588,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":36454,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3233019174520637,"acs":4974,"articleLive":2,"columnArticles":78,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.4223167489,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15385,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5791657446337686,"acs":10469,"articleLive":2,"columnArticles":197,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18076,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6197007965805323,"acs":15948,"articleLive":2,"columnArticles":293,"formTitle":"[1579]保证图可完全遍历","frequency":1.2416110468,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":25735,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6282722513089005,"acs":240,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"","submitted":382,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8143438453713123,"acs":3202,"articleLive":2,"columnArticles":44,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"","submitted":3932,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6711101398601399,"acs":9213,"articleLive":2,"columnArticles":106,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.272605588,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":13728,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6849738200173278,"acs":18184,"articleLive":2,"columnArticles":240,"formTitle":"[1583]统计不开心的朋友","frequency":1.2727565104,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":26547,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6669084266795605,"acs":24827,"articleLive":2,"columnArticles":318,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":37227,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4296022201665125,"acs":2322,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5405,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6261343012704175,"acs":345,"articleLive":2,"columnArticles":21,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"","submitted":551,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.826007326007326,"acs":3157,"articleLive":2,"columnArticles":40,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"","submitted":3822,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8018112971854627,"acs":20540,"articleLive":2,"columnArticles":384,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.8139139155,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"","submitted":25617,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2947298860069387,"acs":3568,"articleLive":2,"columnArticles":51,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":12106,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2636792817893352,"acs":3407,"articleLive":2,"columnArticles":54,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.4223167489,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":12921,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.575973669775096,"acs":1050,"articleLive":2,"columnArticles":30,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1823,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.44516245923420705,"acs":7371,"articleLive":2,"columnArticles":118,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":16558,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5265171094799959,"acs":5093,"articleLive":2,"columnArticles":87,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.272605588,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":9673,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3125582841156357,"acs":4022,"articleLive":2,"columnArticles":98,"formTitle":"[1594]矩阵的最大非负积","frequency":0.3284392341,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":12868,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.461226558540294,"acs":1820,"articleLive":2,"columnArticles":37,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":3946,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7626297577854672,"acs":2204,"articleLive":2,"columnArticles":37,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"","submitted":2890,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6548223350253807,"acs":258,"articleLive":2,"columnArticles":18,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"","submitted":394,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6707533985516453,"acs":10559,"articleLive":2,"columnArticles":145,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.272605588,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":15742,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4189745300856412,"acs":3767,"articleLive":2,"columnArticles":67,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":8991,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6836148857957127,"acs":16551,"articleLive":2,"columnArticles":203,"formTitle":"[1600]皇位继承顺序","frequency":0.8446288607,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24211,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4804295942720764,"acs":2013,"articleLive":2,"columnArticles":39,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4190,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7802746566791511,"acs":625,"articleLive":2,"columnArticles":27,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"","submitted":801,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8448866391852571,"acs":55749,"articleLive":2,"columnArticles":446,"formTitle":"[1603]设计停车系统","frequency":2.9620814323,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":65984,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4138011423242802,"acs":3550,"articleLive":2,"columnArticles":59,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":8579,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7349425287356322,"acs":3197,"articleLive":2,"columnArticles":64,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"","submitted":4350,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.34025974025974026,"acs":1572,"articleLive":2,"columnArticles":32,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4620,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5513307984790875,"acs":2610,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"","submitted":4734,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6392396376612682,"acs":9315,"articleLive":2,"columnArticles":150,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":14572,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5114302902692134,"acs":6801,"articleLive":2,"columnArticles":115,"formTitle":"[1609]奇偶树","frequency":0.272605588,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":13298,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.26975476839237056,"acs":2277,"articleLive":2,"columnArticles":37,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8441,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6077844311377245,"acs":2030,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3340,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7357142857142858,"acs":412,"articleLive":2,"columnArticles":19,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"","submitted":560,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7281879194630873,"acs":1519,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"","submitted":2086,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8201391019740206,"acs":16037,"articleLive":2,"columnArticles":270,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.2464260825,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":19554,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49465604352895454,"acs":5091,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10292,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.2749745446317457,"acs":4861,"articleLive":2,"columnArticles":90,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.3582743826,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":17678,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6179071481208548,"acs":1677,"articleLive":2,"columnArticles":31,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2714,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5894308943089431,"acs":290,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"","submitted":492,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6783374083129584,"acs":6936,"articleLive":2,"columnArticles":124,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10225,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3669869270751299,"acs":2330,"articleLive":2,"columnArticles":39,"formTitle":"[1620]网络信号最好的坐标","frequency":0.5298547857,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6349,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.43452380952380953,"acs":1679,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":3864,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.1453244828252884,"acs":2255,"articleLive":2,"columnArticles":50,"formTitle":"[1622]奇妙序列","frequency":0.9447123192,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":15517,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.783213310156444,"acs":3154,"articleLive":2,"columnArticles":42,"formTitle":"[1623]三人国家代表队","frequency":0.2999147674,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"","submitted":4027,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6273219588889536,"acs":10773,"articleLive":2,"columnArticles":183,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.8139139155,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":17173,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5393129770992366,"acs":2826,"articleLive":2,"columnArticles":63,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5240,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.38246806757313556,"acs":3713,"articleLive":2,"columnArticles":82,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.3284392341,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":9708,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.378915079108815,"acs":2347,"articleLive":2,"columnArticles":36,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6194,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8412322274881516,"acs":355,"articleLive":2,"columnArticles":17,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"","submitted":422,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5222007077518862,"acs":7821,"articleLive":2,"columnArticles":86,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":14977,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7694687433326222,"acs":7213,"articleLive":2,"columnArticles":110,"formTitle":"[1630]等差子数组","frequency":0.2999147674,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9374,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4921574610924626,"acs":24192,"articleLive":2,"columnArticles":296,"formTitle":"[1631]最小体力消耗路径","frequency":1.2082968401,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"","submitted":49155,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31651785714285713,"acs":1418,"articleLive":2,"columnArticles":26,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4480,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6597633136094675,"acs":2453,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":0.3284392341,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"","submitted":3718,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5203804347826086,"acs":383,"articleLive":2,"columnArticles":23,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"","submitted":736,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5453091684434968,"acs":1023,"articleLive":2,"columnArticles":27,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.3284392341,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"","submitted":1876,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7068379610443432,"acs":8528,"articleLive":2,"columnArticles":168,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.272605588,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12065,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8059231253938248,"acs":5116,"articleLive":2,"columnArticles":65,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6348,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7099761841757078,"acs":2683,"articleLive":2,"columnArticles":46,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3779,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4018629407850965,"acs":1208,"articleLive":2,"columnArticles":27,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3006,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6637495973370557,"acs":12363,"articleLive":2,"columnArticles":210,"formTitle":"[1640]能否连接形成数组","frequency":0.272605588,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":18626,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7692961800104657,"acs":11761,"articleLive":2,"columnArticles":263,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":1.8243231686,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15288,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4542687453600594,"acs":6119,"articleLive":2,"columnArticles":101,"formTitle":"[1642]可以到达的最远建筑","frequency":0.8139139155,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":13470,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.44944757139879093,"acs":2156,"articleLive":2,"columnArticles":47,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":4797,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5361726954492415,"acs":919,"articleLive":2,"columnArticles":19,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.8766008934,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"","submitted":1714,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4212990052662376,"acs":720,"articleLive":2,"columnArticles":23,"formTitle":"[1645]Hopper Company Queries II","frequency":0.3582743826,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"","submitted":1709,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5061209115449808,"acs":8062,"articleLive":2,"columnArticles":97,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"","submitted":15929,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5114004005546141,"acs":6639,"articleLive":2,"columnArticles":97,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":1.1762496627,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":12982,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.27847780126849897,"acs":3293,"articleLive":2,"columnArticles":85,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.3582743826,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":11825,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.47447795823665895,"acs":2454,"articleLive":2,"columnArticles":61,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5172,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7946708463949843,"acs":1014,"articleLive":2,"columnArticles":25,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.2999147674,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"","submitted":1276,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.7024185068349106,"acs":668,"articleLive":2,"columnArticles":22,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"","submitted":951,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6593595312657844,"acs":6527,"articleLive":2,"columnArticles":167,"formTitle":"[1652]拆炸弹","frequency":1.1762496627,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":9899,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5005964807634954,"acs":3357,"articleLive":2,"columnArticles":80,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.2999147674,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":6706,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.27374881147895236,"acs":3167,"articleLive":2,"columnArticles":46,"formTitle":"[1654]到家的最少跳跃次数","frequency":1.1762496627,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":11569,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3817068018588931,"acs":1807,"articleLive":2,"columnArticles":30,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":4734,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7804117280099813,"acs":7506,"articleLive":2,"columnArticles":88,"formTitle":"[1656]设计有序流","frequency":0.272605588,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":9618,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46494076349276,"acs":5298,"articleLive":2,"columnArticles":74,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.2999147674,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11395,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.2953274400144326,"acs":8185,"articleLive":2,"columnArticles":145,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":27715,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.40582462804685027,"acs":1282,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":1.2941717514,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3159,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.741869918699187,"acs":365,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"","submitted":492,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7310158623017212,"acs":2166,"articleLive":2,"columnArticles":52,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.8446288607,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"","submitted":2963,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.813567694397563,"acs":19764,"articleLive":2,"columnArticles":269,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.7843696691,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":24293,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5717283183089835,"acs":7357,"articleLive":2,"columnArticles":127,"formTitle":"[1663]具有给定数值的最小字符串","frequency":1.2082968401,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":12868,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5445091514143094,"acs":5236,"articleLive":2,"columnArticles":104,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9616,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6672436750998668,"acs":5011,"articleLive":2,"columnArticles":77,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.3284392341,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7510,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.680379746835443,"acs":215,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"","submitted":316,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6061365059486538,"acs":1936,"articleLive":2,"columnArticles":31,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"","submitted":3194,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4416583558911526,"acs":6200,"articleLive":2,"columnArticles":122,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":14038,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7687487500833278,"acs":11532,"articleLive":2,"columnArticles":211,"formTitle":"[1669]合并两个链表","frequency":1.1453830147,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":15001,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5284725918041512,"acs":3972,"articleLive":2,"columnArticles":75,"formTitle":"[1670]设计前中后队列","frequency":0.2999147674,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":7516,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46537059538274606,"acs":1915,"articleLive":2,"columnArticles":35,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.5994270179,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4115,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8502745080319016,"acs":37634,"articleLive":2,"columnArticles":433,"formTitle":"[1672]最富有客户的资产总量","frequency":0.272605588,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":44261,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.3502241278503216,"acs":7188,"articleLive":2,"columnArticles":162,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.2999147674,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":20524,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3588850174216028,"acs":2369,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.9447123192,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6601,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4361343044945816,"acs":2455,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":5629,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7653061224489796,"acs":675,"articleLive":2,"columnArticles":19,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.4915652692,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"","submitted":882,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.4055992596020361,"acs":1753,"articleLive":2,"columnArticles":30,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"","submitted":4322,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.829738096408039,"acs":16886,"articleLive":2,"columnArticles":270,"formTitle":"[1678]设计 Goal 解析器","frequency":0.272605588,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":20351,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4941044776119403,"acs":6621,"articleLive":2,"columnArticles":106,"formTitle":"[1679]K 和数对的最大数目","frequency":0.2999147674,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":13400,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4608973222202518,"acs":5198,"articleLive":2,"columnArticles":70,"formTitle":"[1680]连接连续二进制数字","frequency":0.272605588,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11278,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3802294197031039,"acs":2254,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.5646409018,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":5928,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5335892514395394,"acs":278,"articleLive":2,"columnArticles":13,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"","submitted":521,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.894901737396753,"acs":3142,"articleLive":2,"columnArticles":35,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"","submitted":3511,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8274785323965652,"acs":15900,"articleLive":2,"columnArticles":335,"formTitle":"[1684]统计一致字符串的数目","frequency":1.1453830147,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":19215,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5936199722607489,"acs":3424,"articleLive":2,"columnArticles":79,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":5768,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4679462571976967,"acs":2438,"articleLive":2,"columnArticles":47,"formTitle":"[1686]石子游戏 VI","frequency":0.3284392341,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5210,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.3994614003590664,"acs":890,"articleLive":2,"columnArticles":19,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2228,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8038051942585344,"acs":19096,"articleLive":2,"columnArticles":250,"formTitle":"[1688]比赛中的配对次数","frequency":0.7843696691,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":23757,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8690105787181083,"acs":13965,"articleLive":2,"columnArticles":181,"formTitle":"[1689]十-二进制数的最少数目","frequency":1.1453830147,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":16070,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5094692250186893,"acs":4089,"articleLive":2,"columnArticles":103,"formTitle":"[1690]石子游戏 VII","frequency":0.3284392341,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8026,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.48469068943970006,"acs":2327,"articleLive":2,"columnArticles":62,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":4801,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6538461538461539,"acs":153,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"","submitted":234,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8057234985892785,"acs":1999,"articleLive":2,"columnArticles":32,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"","submitted":2481,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6364990362712458,"acs":7265,"articleLive":2,"columnArticles":132,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":11414,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4531661742393995,"acs":5675,"articleLive":2,"columnArticles":125,"formTitle":"[1695]删除子数组的最大得分","frequency":0.272605588,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":12523,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.39988945695730277,"acs":5788,"articleLive":2,"columnArticles":107,"formTitle":"[1696]跳跃游戏 VI","frequency":1.1453830147,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":14474,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5242960378769,"acs":2104,"articleLive":2,"columnArticles":42,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4013,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5438144329896907,"acs":422,"articleLive":2,"columnArticles":16,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"","submitted":776,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8005208333333333,"acs":1537,"articleLive":2,"columnArticles":39,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"","submitted":1920,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7194956757319996,"acs":6905,"articleLive":2,"columnArticles":165,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.272605588,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":9597,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6105069432825833,"acs":3649,"articleLive":2,"columnArticles":75,"formTitle":"[1701]平均等待时间","frequency":0.8446288607,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":5977,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.47571801566579636,"acs":2733,"articleLive":2,"columnArticles":65,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.8766008934,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":5745,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3887832699619772,"acs":1227,"articleLive":2,"columnArticles":22,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3156,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7813593539703904,"acs":11611,"articleLive":2,"columnArticles":175,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":14860,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3464258651174539,"acs":5486,"articleLive":2,"columnArticles":114,"formTitle":"[1705]吃苹果的最大数目","frequency":0.8446288607,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":15836,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5848411454623166,"acs":4105,"articleLive":2,"columnArticles":106,"formTitle":"[1706]球会落何处","frequency":0.9099262031,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7019,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5033776500179662,"acs":14009,"articleLive":2,"columnArticles":147,"formTitle":"[1707]与数组中元素的最大异或值","frequency":2.0055842799,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":27830,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6647173489278753,"acs":682,"articleLive":2,"columnArticles":23,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"","submitted":1026,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7209960384833051,"acs":1274,"articleLive":2,"columnArticles":34,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"","submitted":1767,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6923674499902894,"acs":10695,"articleLive":2,"columnArticles":175,"formTitle":"[1710]卡车上的最大单元数","frequency":1.1762496627,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"","submitted":15447,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.35923384032711353,"acs":29783,"articleLive":2,"columnArticles":357,"formTitle":"[1711]大餐计数","frequency":2.4789653899,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":82907,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.2655885980539948,"acs":5814,"articleLive":2,"columnArticles":101,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":21891,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4972564714995804,"acs":15406,"articleLive":2,"columnArticles":171,"formTitle":"[1713]得到子序列的最少操作次数","frequency":1.1555457038,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":30982,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6342857142857142,"acs":222,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"","submitted":350,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.736815415821501,"acs":1453,"articleLive":2,"columnArticles":33,"formTitle":"[1715]苹果和橘子的个数","frequency":0.8446288607,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"","submitted":1972,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.674949689386648,"acs":7714,"articleLive":2,"columnArticles":182,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":11429,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43122521394280944,"acs":2066,"articleLive":2,"columnArticles":48,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":4791,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.48622408816583573,"acs":1853,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":3811,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3614013521819299,"acs":588,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1627,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8693164537712895,"acs":45733,"articleLive":2,"columnArticles":481,"formTitle":"[1720]解码异或后的数组","frequency":2.742625654,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":52608,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6493048756608576,"acs":9948,"articleLive":2,"columnArticles":157,"formTitle":"[1721]交换链表中的节点","frequency":0.2999147674,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":15321,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5132949257699978,"acs":4633,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9026,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5078808319280494,"acs":22588,"articleLive":2,"columnArticles":175,"formTitle":"[1723]完成所有工作的最短时间","frequency":3.5989168636,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":44475,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5536332179930796,"acs":320,"articleLive":2,"columnArticles":10,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"","submitted":578,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7868451242829828,"acs":10288,"articleLive":2,"columnArticles":137,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.272605588,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13075,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.47488625211883306,"acs":5323,"articleLive":2,"columnArticles":106,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11209,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.572590413566361,"acs":3309,"articleLive":2,"columnArticles":82,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5779,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3480905711388983,"acs":1030,"articleLive":2,"columnArticles":24,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":2959,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6244541484716157,"acs":1859,"articleLive":2,"columnArticles":21,"formTitle":"[1729]求关注者的数量","frequency":0.2999147674,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"","submitted":2977,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5355969331872946,"acs":489,"articleLive":2,"columnArticles":21,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"","submitted":913,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.47734773477347736,"acs":1591,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"","submitted":3333,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7930097920091488,"acs":11095,"articleLive":2,"columnArticles":192,"formTitle":"[1732]找到最高海拔","frequency":1.5084348891,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":13991,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4576502732240437,"acs":2010,"articleLive":2,"columnArticles":55,"formTitle":"[1733]需要教语言的最少人数","frequency":0.5646409018,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4392,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7232801062804449,"acs":27766,"articleLive":2,"columnArticles":367,"formTitle":"[1734]解码异或后的排列","frequency":2.6793133746,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38389,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4844844844844845,"acs":968,"articleLive":2,"columnArticles":24,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":1998,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.44919043208890874,"acs":28131,"articleLive":2,"columnArticles":349,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":0.97285488,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":62626,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3078558143654238,"acs":3476,"articleLive":2,"columnArticles":100,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.9810799634,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11291,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6540177007682787,"acs":28007,"articleLive":2,"columnArticles":385,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":2.1147835719,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":42823,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4703845452888646,"acs":2581,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5487,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7002762430939227,"acs":507,"articleLive":2,"columnArticles":16,"formTitle":"[1740]找到二叉树中的距离","frequency":0.6450553705,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"","submitted":724,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8424068767908309,"acs":1764,"articleLive":2,"columnArticles":30,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"","submitted":2094,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7056033725627964,"acs":8034,"articleLive":2,"columnArticles":124,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.272605588,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11386,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6974609683015297,"acs":22113,"articleLive":2,"columnArticles":323,"formTitle":"[1743]从相邻元素对还原数组","frequency":0.8011134676,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":31705,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36309693099257956,"acs":28087,"articleLive":2,"columnArticles":363,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":2.6793133746,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":77354,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.48450491307634164,"acs":3205,"articleLive":2,"columnArticles":70,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":6615,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.6091428571428571,"acs":533,"articleLive":2,"columnArticles":25,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"","submitted":875,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7026184538653366,"acs":1127,"articleLive":2,"columnArticles":32,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"","submitted":1604,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7496705227705374,"acs":10239,"articleLive":2,"columnArticles":213,"formTitle":"[1748]唯一元素的和","frequency":1.1762496627,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":13658,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5302507836990595,"acs":3383,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":1.1762496627,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6380,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.45898234683281414,"acs":3094,"articleLive":2,"columnArticles":78,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":6741,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.46792009400705054,"acs":1991,"articleLive":2,"columnArticles":32,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":1.1011280057,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4255,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6867136009586579,"acs":9169,"articleLive":2,"columnArticles":108,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":13352,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6274727717270504,"acs":5646,"articleLive":2,"columnArticles":122,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":8998,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.42,"acs":4011,"articleLive":2,"columnArticles":89,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.3284392341,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":9550,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.39651058753355206,"acs":2659,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.3284392341,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":6706,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8115015974440895,"acs":254,"articleLive":2,"columnArticles":11,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"","submitted":313,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9235777930089102,"acs":2695,"articleLive":2,"columnArticles":30,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"","submitted":2918,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6350009368559115,"acs":6778,"articleLive":2,"columnArticles":108,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":10674,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.4274772154353306,"acs":4409,"articleLive":2,"columnArticles":92,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.2999147674,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10314,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5359781121751026,"acs":3918,"articleLive":2,"columnArticles":75,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7310,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4278821299327934,"acs":2483,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":1.0191652974,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":5803,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6688963210702341,"acs":400,"articleLive":2,"columnArticles":17,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"","submitted":598,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6104963112005366,"acs":3641,"articleLive":2,"columnArticles":75,"formTitle":"[1763]最长的美好子字符串","frequency":0.3284392341,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":5964,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.47643979057591623,"acs":2184,"articleLive":2,"columnArticles":51,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4584,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5650082918739635,"acs":3407,"articleLive":2,"columnArticles":80,"formTitle":"[1765]地图中的最高点","frequency":0.3284392341,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6030,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.375139353400223,"acs":1346,"articleLive":2,"columnArticles":25,"formTitle":"[1766]互质树","frequency":0.6937030947,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3588,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.806157354618016,"acs":707,"articleLive":2,"columnArticles":19,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"","submitted":877,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7691806129102369,"acs":10617,"articleLive":2,"columnArticles":195,"formTitle":"[1768]交替合并字符串","frequency":1.1156189128,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":13803,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8549739606320064,"acs":9686,"articleLive":2,"columnArticles":163,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.272605588,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11329,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.36849365458892774,"acs":4007,"articleLive":2,"columnArticles":99,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.4567791531,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":10874,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36348871203508204,"acs":2238,"articleLive":2,"columnArticles":46,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6157,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5387673956262425,"acs":271,"articleLive":2,"columnArticles":10,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"","submitted":503,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8408296943231441,"acs":15404,"articleLive":2,"columnArticles":194,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":1.4100755689,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":18320,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5551382066840027,"acs":5764,"articleLive":2,"columnArticles":87,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.8446288607,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10383,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4720776968435657,"acs":4083,"articleLive":2,"columnArticles":87,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.8766008934,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":8649,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.46325167037861914,"acs":1664,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":1.3896458492,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3592,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7777965528894897,"acs":4603,"articleLive":2,"columnArticles":57,"formTitle":"[1777]每家商店的产品价格","frequency":3.3626082587,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"","submitted":5918,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5571955719557196,"acs":151,"articleLive":2,"columnArticles":8,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"","submitted":271,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6470588235294118,"acs":5126,"articleLive":2,"columnArticles":65,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.2999147674,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":7922,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6612594201047388,"acs":5177,"articleLive":2,"columnArticles":106,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":7829,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5161670375703626,"acs":3943,"articleLive":2,"columnArticles":56,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.272605588,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7639,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2851415685291907,"acs":1138,"articleLive":2,"columnArticles":32,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":3991,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7923930269413629,"acs":1000,"articleLive":2,"columnArticles":25,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"","submitted":1262,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42033308476261494,"acs":8455,"articleLive":2,"columnArticles":98,"formTitle":"[1784]检查二进制字符串字段","frequency":0.272605588,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":20115,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.3471130083127387,"acs":6180,"articleLive":2,"columnArticles":61,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":17804,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3391331857007276,"acs":3216,"articleLive":2,"columnArticles":83,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9483,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541105460235846,"acs":11704,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":2.7296257959,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":17893,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6796536796536796,"acs":157,"articleLive":2,"columnArticles":12,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"","submitted":231,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.717948717948718,"acs":1260,"articleLive":2,"columnArticles":27,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"","submitted":1755,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6519826068951238,"acs":12595,"articleLive":2,"columnArticles":135,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.272605588,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":19318,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8096509971509972,"acs":9094,"articleLive":2,"columnArticles":121,"formTitle":"[1791]找出星型图的中心节点","frequency":0.2212991324,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":11232,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5136853968765094,"acs":6381,"articleLive":2,"columnArticles":103,"formTitle":"[1792]最大平均通过率","frequency":1.7188514244,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12422,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41100252552981226,"acs":3743,"articleLive":2,"columnArticles":89,"formTitle":"[1793]好子数组的最大分数","frequency":0.9447123192,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9107,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.6822916666666666,"acs":131,"articleLive":2,"columnArticles":8,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"","submitted":192,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7905959540732641,"acs":1446,"articleLive":2,"columnArticles":25,"formTitle":"[1795]每个产品在不同商店的价格","frequency":1.2416110468,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"","submitted":1829,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.486268437780132,"acs":5967,"articleLive":2,"columnArticles":113,"formTitle":"[1796]字符串中第二大的数字","frequency":0.272605588,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":12271,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5727617381160688,"acs":3928,"articleLive":2,"columnArticles":60,"formTitle":"[1797]设计一个验证系统","frequency":0.8446288607,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":6858,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5178155774395703,"acs":2892,"articleLive":2,"columnArticles":46,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5585,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5103596094308168,"acs":2143,"articleLive":2,"columnArticles":33,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.4223167489,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4199,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6835301983507912,"acs":9201,"articleLive":2,"columnArticles":148,"formTitle":"[1800]最大升序子数组和","frequency":0.8139139155,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":13461,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.3762573543366863,"acs":3965,"articleLive":2,"columnArticles":107,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10538,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2619093663379101,"acs":4063,"articleLive":2,"columnArticles":106,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":15513,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.4106280193236715,"acs":2040,"articleLive":2,"columnArticles":51,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":1.0591226704,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":4968,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5748792270531401,"acs":357,"articleLive":2,"columnArticles":25,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.5994270179,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"","submitted":621,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4958806298059319,"acs":10834,"articleLive":2,"columnArticles":143,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.2212991324,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":21848,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6632774329856067,"acs":5023,"articleLive":2,"columnArticles":80,"formTitle":"[1806]还原排列的最少操作步数","frequency":1.2416110468,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7573,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5838919033939781,"acs":5488,"articleLive":2,"columnArticles":83,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9399,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2655064703257474,"acs":2380,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.7284892108,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":8964,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6389713155291791,"acs":1292,"articleLive":2,"columnArticles":28,"formTitle":"[1809]没有广告的剧集","frequency":0.7843696691,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"","submitted":2022,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6567164179104478,"acs":132,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":1.4744064273,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"","submitted":201,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.671858774662513,"acs":647,"articleLive":2,"columnArticles":22,"formTitle":"[1811]寻找面试候选人","frequency":0.272605588,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"","submitted":963,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7946077911049783,"acs":7486,"articleLive":2,"columnArticles":173,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":9421,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5229692728932157,"acs":5157,"articleLive":2,"columnArticles":68,"formTitle":"[1813]句子相似性 III","frequency":1.2082968401,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":9861,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3410717938228677,"acs":3335,"articleLive":2,"columnArticles":76,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.3284392341,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":9778,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.3006384213580963,"acs":1554,"articleLive":2,"columnArticles":36,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5169,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7540920021720581,"acs":9721,"articleLive":2,"columnArticles":141,"formTitle":"[1816]截断句子","frequency":0.272605588,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":12891,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6950863536852347,"acs":5715,"articleLive":2,"columnArticles":93,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.3284392341,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8222,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37410454485030203,"acs":25328,"articleLive":2,"columnArticles":337,"formTitle":"[1818]绝对差值和","frequency":2.2483149645,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":67703,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3643334964920868,"acs":2233,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6129,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.46496815286624205,"acs":73,"articleLive":2,"columnArticles":7,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"","submitted":157,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9000920810313076,"acs":1955,"articleLive":2,"columnArticles":18,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":1.2082968401,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"","submitted":2172,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8131970654340359,"acs":19176,"articleLive":2,"columnArticles":186,"formTitle":"[1822]数组元素积的符号","frequency":0.7843696691,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":23581,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7051445369916708,"acs":7196,"articleLive":2,"columnArticles":89,"formTitle":"[1823]找出游戏的获胜者","frequency":0.7843696691,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":10205,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6622370852767755,"acs":7525,"articleLive":2,"columnArticles":151,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11363,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2869710467706013,"acs":2577,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.5994270179,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":8980,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.43953488372093025,"acs":189,"articleLive":2,"columnArticles":15,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"","submitted":430,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7959277685645845,"acs":8639,"articleLive":2,"columnArticles":132,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":10854,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8708719851576995,"acs":7041,"articleLive":2,"columnArticles":91,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.7843696691,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8085,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6762397431323582,"acs":3791,"articleLive":2,"columnArticles":80,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5606,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.48148148148148145,"acs":819,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1701,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7386243386243386,"acs":698,"articleLive":2,"columnArticles":20,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"","submitted":945,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8214428058987644,"acs":12366,"articleLive":2,"columnArticles":202,"formTitle":"[1832]判断句子是否为全字母句","frequency":1.1762496627,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":15054,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6852149297880122,"acs":43087,"articleLive":2,"columnArticles":385,"formTitle":"[1833]雪糕的最大数量","frequency":1.4416488308,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":62881,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3506217584202962,"acs":5611,"articleLive":2,"columnArticles":122,"formTitle":"[1834]单线程 CPU","frequency":1.4744064273,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":16003,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5072903132669265,"acs":3514,"articleLive":2,"columnArticles":59,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.6450553705,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":6927,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7091346153846154,"acs":295,"articleLive":2,"columnArticles":20,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.4223167489,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"","submitted":416,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7936736958934517,"acs":7151,"articleLive":2,"columnArticles":82,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9010,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.4308783165599268,"acs":28257,"articleLive":2,"columnArticles":299,"formTitle":"[1838]最高频元素的频数","frequency":2.8103907783,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":65580,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5805375347544022,"acs":6264,"articleLive":2,"columnArticles":123,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":10790,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.39036649214659686,"acs":1864,"articleLive":2,"columnArticles":44,"formTitle":"[1840]最高建筑高度","frequency":0.4567791531,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":4775,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5128205128205128,"acs":660,"articleLive":2,"columnArticles":25,"formTitle":"[1841]联赛信息统计","frequency":1.2082968401,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"","submitted":1287,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.7086614173228346,"acs":90,"articleLive":2,"columnArticles":9,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"","submitted":127,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5235042735042735,"acs":490,"articleLive":2,"columnArticles":20,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.3284392341,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"","submitted":936,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8025794917635041,"acs":6285,"articleLive":2,"columnArticles":105,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":7831,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5826839826839827,"acs":5384,"articleLive":2,"columnArticles":53,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":9240,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6335046870275174,"acs":27235,"articleLive":2,"columnArticles":374,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":1.9718656439,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":42991,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.35912666559640394,"acs":2237,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.4915652692,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6229,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.685274302213667,"acs":7120,"articleLive":2,"columnArticles":92,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":10390,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.32921485088253194,"acs":5409,"articleLive":2,"columnArticles":106,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.3895269261,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":16430,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6061175207942044,"acs":2259,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.4567791531,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3727,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.3968421052631579,"acs":1885,"articleLive":2,"columnArticles":45,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4750,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7009803921568627,"acs":143,"articleLive":2,"columnArticles":10,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"","submitted":204,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6475063398140322,"acs":766,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.3284392341,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"","submitted":1183,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.794564749749032,"acs":11081,"articleLive":2,"columnArticles":111,"formTitle":"[1854]人口最多的年份","frequency":1.1762496627,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":13946,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.691737504250255,"acs":10172,"articleLive":2,"columnArticles":97,"formTitle":"[1855]下标对中的最大距离","frequency":1.2082968401,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":14705,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.3557372859698441,"acs":4176,"articleLive":2,"columnArticles":80,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.9099262031,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":11739,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4476550344521005,"acs":2014,"articleLive":2,"columnArticles":30,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4499,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.7084548104956269,"acs":243,"articleLive":2,"columnArticles":14,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.6937030947,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"","submitted":343,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7731740699265895,"acs":6214,"articleLive":2,"columnArticles":130,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":8037,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7716405605935697,"acs":3744,"articleLive":2,"columnArticles":60,"formTitle":"[1860]增长的内存泄露","frequency":0.272605588,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":4852,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6183613030602172,"acs":3132,"articleLive":2,"columnArticles":66,"formTitle":"[1861]旋转盒子","frequency":0.2999147674,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5065,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3099620216184633,"acs":2122,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":6846,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9238335038161932,"acs":11741,"articleLive":2,"columnArticles":132,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":1.9079139971,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":12709,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3861992209237618,"acs":4164,"articleLive":2,"columnArticles":102,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.3895269261,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":10782,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5171257241589593,"acs":5088,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":9839,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5943977591036415,"acs":2122,"articleLive":2,"columnArticles":48,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":1.0191652974,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3570,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7749469214437368,"acs":365,"articleLive":2,"columnArticles":13,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"","submitted":471,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5549132947976878,"acs":96,"articleLive":2,"columnArticles":9,"formTitle":"[1868]两个行程编码数组的积","frequency":0.9099262031,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"","submitted":173,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.8024968624083493,"acs":12149,"articleLive":2,"columnArticles":131,"formTitle":"[1869]哪种连续子字符串更长","frequency":1.1156189128,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":15139,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.46110370229250014,"acs":7261,"articleLive":2,"columnArticles":70,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.3284392341,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":15747,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27552808332522144,"acs":5661,"articleLive":2,"columnArticles":123,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":20546,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6237558062375581,"acs":1880,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3014,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.7974549310710498,"acs":1504,"articleLive":2,"columnArticles":27,"formTitle":"[1873]计算特殊奖金","frequency":1.7188514244,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"","submitted":1886,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8863636363636364,"acs":195,"articleLive":2,"columnArticles":13,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"","submitted":220,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7403846153846154,"acs":308,"articleLive":2,"columnArticles":17,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"","submitted":416,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7317954419121734,"acs":5266,"articleLive":2,"columnArticles":84,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":7196,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8195709426094591,"acs":29875,"articleLive":2,"columnArticles":394,"formTitle":"[1877]数组中最大数对和的最小值","frequency":2.6067125617,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":36452,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.42699207342511475,"acs":2047,"articleLive":2,"columnArticles":54,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":4794,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.4048825426070935,"acs":1758,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.4223167489,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4342,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7724122512854907,"acs":6910,"articleLive":2,"columnArticles":88,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.2464260825,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":8946,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3513380800392831,"acs":5724,"articleLive":2,"columnArticles":62,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":16292,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2766549968173138,"acs":3477,"articleLive":2,"columnArticles":109,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":12568,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.37023914968999116,"acs":1672,"articleLive":2,"columnArticles":25,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4516,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.7011494252873564,"acs":1342,"articleLive":2,"columnArticles":31,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":1.5084348891,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":1914,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5365853658536586,"acs":176,"articleLive":2,"columnArticles":8,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"","submitted":328,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.572268717484732,"acs":5060,"articleLive":2,"columnArticles":75,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.2999147674,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":8842,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6407908704883227,"acs":4829,"articleLive":2,"columnArticles":59,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7536,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.31393568147013784,"acs":2665,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.4223167489,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8489,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2744084851781344,"acs":2018,"articleLive":2,"columnArticles":40,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.9810799634,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7354,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.6959247648902821,"acs":666,"articleLive":2,"columnArticles":16,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"","submitted":957,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.5035211267605634,"acs":143,"articleLive":2,"columnArticles":8,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"","submitted":284,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3530042918454936,"acs":329,"articleLive":2,"columnArticles":11,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.3582743826,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"","submitted":932,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5915738498789346,"acs":30540,"articleLive":2,"columnArticles":402,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":1.9536515312,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":51625,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.4295988934993084,"acs":3106,"articleLive":2,"columnArticles":46,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":7230,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5311706629055007,"acs":1883,"articleLive":2,"columnArticles":38,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3545,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5009310986964618,"acs":807,"articleLive":2,"columnArticles":30,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1611,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5275946165658025,"acs":5841,"articleLive":2,"columnArticles":72,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.2464260825,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11071,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.30681284259984337,"acs":3918,"articleLive":2,"columnArticles":61,"formTitle":"[1898]可移除字符的最大数目","frequency":0.3895269261,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":12770,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6267354930580278,"acs":3521,"articleLive":2,"columnArticles":41,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5618,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.4239457831325301,"acs":1126,"articleLive":2,"columnArticles":33,"formTitle":"[1900]最佳运动员的比拼回合","frequency":1.1453830147,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2656,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6573957016434893,"acs":520,"articleLive":2,"columnArticles":22,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":791,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4296875,"acs":55,"articleLive":2,"columnArticles":3,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"","submitted":128,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6446087971973531,"acs":6624,"articleLive":2,"columnArticles":94,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":10276,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2747921487957487,"acs":3206,"articleLive":2,"columnArticles":67,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":11667,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5735657425199012,"acs":4179,"articleLive":2,"columnArticles":85,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":7286,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4215878679750223,"acs":2363,"articleLive":2,"columnArticles":53,"formTitle":"[1906]查询差绝对值的最小值","frequency":1.0591226704,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5605,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.6296296296296297,"acs":323,"articleLive":2,"columnArticles":14,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"","submitted":513,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.648,"acs":81,"articleLive":2,"columnArticles":6,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"","submitted":125,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.3290873911641406,"acs":4082,"articleLive":2,"columnArticles":65,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.2464260825,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":12404,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6780975709328434,"acs":3322,"articleLive":2,"columnArticles":54,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":4899,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5639773393240868,"acs":2887,"articleLive":2,"columnArticles":63,"formTitle":"[1911]最大子序列交替和","frequency":0.2464260825,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5119,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.3042755344418052,"acs":1281,"articleLive":2,"columnArticles":36,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":4210,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8467810636485336,"acs":6958,"articleLive":2,"columnArticles":72,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.2464260825,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":8217,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.43903818953323903,"acs":3104,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.8446288607,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7070,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.38873764149591633,"acs":2713,"articleLive":2,"columnArticles":55,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":6979,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5548189699133096,"acs":1088,"articleLive":2,"columnArticles":17,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.9810799634,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":1961,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.2889983579638752,"acs":176,"articleLive":2,"columnArticles":8,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"","submitted":609,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.4642857142857143,"acs":78,"articleLive":2,"columnArticles":2,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"","submitted":168,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.42203389830508475,"acs":249,"articleLive":2,"columnArticles":9,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"","submitted":590,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.940752128666036,"acs":7955,"articleLive":2,"columnArticles":68,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":8456,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.3420966581649336,"acs":5231,"articleLive":2,"columnArticles":86,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.8766008934,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":15291,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3625687772029235,"acs":4415,"articleLive":2,"columnArticles":78,"formTitle":"[1922]统计好数字的数目","frequency":0.2999147674,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12177,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23557046979865773,"acs":1404,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":1.2416110468,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":5960,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.5223880597014925,"acs":35,"articleLive":2,"columnArticles":2,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"","submitted":67,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6985084632143456,"acs":4168,"articleLive":2,"columnArticles":53,"formTitle":"[1925]统计平方和三元组的数目","frequency":1.4416488308,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":5967,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3469678692839127,"acs":3164,"articleLive":2,"columnArticles":57,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":9119,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4098975256185953,"acs":1640,"articleLive":2,"columnArticles":36,"formTitle":"[1927]求和游戏","frequency":0.272605588,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4001,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.34965950759559977,"acs":1335,"articleLive":2,"columnArticles":29,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":1.3124370993,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":3818,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9427801724137931,"acs":8749,"articleLive":2,"columnArticles":73,"formTitle":"[1929]数组串联","frequency":0.1739305804,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":9280,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4750593824228028,"acs":5200,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.7559182479,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":10946,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5513230590287874,"acs":1896,"articleLive":2,"columnArticles":61,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.2999147674,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3439,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.32407709898725906,"acs":992,"articleLive":2,"columnArticles":35,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.4915652692,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3061,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5712,"acs":357,"articleLive":2,"columnArticles":21,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"","submitted":625,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7345132743362832,"acs":166,"articleLive":2,"columnArticles":8,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"","submitted":226,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7449881708380027,"acs":5983,"articleLive":2,"columnArticles":85,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":8031,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.4490244108455106,"acs":5316,"articleLive":2,"columnArticles":59,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":11839,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.2382369500522802,"acs":2962,"articleLive":2,"columnArticles":62,"formTitle":"[1937]扣分后的最大得分","frequency":0.8139139155,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":12433,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3331216259129883,"acs":1049,"articleLive":2,"columnArticles":39,"formTitle":"[1938]查询最大基因差","frequency":0.8446288607,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3149,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6604774535809018,"acs":249,"articleLive":2,"columnArticles":9,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"","submitted":377,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.8264984227129337,"acs":262,"articleLive":2,"columnArticles":21,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"","submitted":317,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.777555910543131,"acs":3894,"articleLive":2,"columnArticles":68,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":5008,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.388162951575711,"acs":2525,"articleLive":2,"columnArticles":62,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":6505,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.401194743130227,"acs":1679,"articleLive":2,"columnArticles":47,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4185,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5757783099555251,"acs":1683,"articleLive":2,"columnArticles":47,"formTitle":"[1944]队列中可以看到的人数","frequency":0.1391444643,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":2923,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6619655249608238,"acs":5914,"articleLive":2,"columnArticles":65,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.0347861161,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":8934,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.3024576929976679,"acs":5058,"articleLive":2,"columnArticles":75,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.3284392341,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":16723,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5360023041474654,"acs":3722,"articleLive":2,"columnArticles":80,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":6944,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5178885630498534,"acs":883,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.2464260825,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1705,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5497630331753555,"acs":116,"articleLive":2,"columnArticles":9,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"","submitted":211,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5549738219895288,"acs":106,"articleLive":2,"columnArticles":5,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"","submitted":191,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.7177914110429447,"acs":117,"articleLive":2,"columnArticles":10,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"","submitted":163,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5414703529202596,"acs":6091,"articleLive":2,"columnArticles":67,"formTitle":"[1952]三除数","frequency":0.0695722322,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":11249,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.31833657587548636,"acs":3927,"articleLive":2,"columnArticles":81,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":12336,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.48142570281124497,"acs":3836,"articleLive":2,"columnArticles":65,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":7968,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49354640442532266,"acs":2409,"articleLive":2,"columnArticles":38,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":4881,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4312267657992565,"acs":116,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":1.1453830147,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"","submitted":269,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6068825224614341,"acs":3580,"articleLive":2,"columnArticles":44,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":5899,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.4174809989142237,"acs":2307,"articleLive":2,"columnArticles":41,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5526,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.4076104482425024,"acs":1264,"articleLive":2,"columnArticles":30,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3101,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.27560718057022177,"acs":522,"articleLive":2,"columnArticles":16,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":1894,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5334733525859806,"acs":6096,"articleLive":2,"columnArticles":52,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.1043583483,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":11427,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4233211956981963,"acs":4999,"articleLive":2,"columnArticles":68,"formTitle":"[1962]移除石子使总数最小","frequency":0.5104480055,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":11809,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6118594209629974,"acs":3952,"articleLive":2,"columnArticles":52,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.2212991324,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":6459,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3802256138022561,"acs":2865,"articleLive":2,"columnArticles":43,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":7535,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7363636363636363,"acs":162,"articleLive":2,"columnArticles":6,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"","submitted":220,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.6785714285714286,"acs":19,"articleLive":2,"columnArticles":4,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"","submitted":28,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7698775630623986,"acs":5219,"articleLive":2,"columnArticles":46,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":6779,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3458714839561165,"acs":4193,"articleLive":2,"columnArticles":64,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":12123,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.27043644793871585,"acs":2683,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":1.4100755689,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":9921,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.47527749747729564,"acs":1884,"articleLive":2,"columnArticles":45,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":1.4744064273,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":3964,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5358851674641149,"acs":112,"articleLive":2,"columnArticles":10,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":209,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.43243243243243246,"acs":32,"articleLive":2,"columnArticles":5,"formTitle":"[1972]First and Last Call On the Same Day","frequency":1.7920101796,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"","submitted":74,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.41333333333333333,"acs":31,"articleLive":2,"columnArticles":7,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"","submitted":75,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7424065420560748,"acs":2542,"articleLive":2,"columnArticles":29,"formTitle":"[5834]使用特殊打字机键入单词的最少时间","frequency":0.0,"frontendQuestionId":"5834","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":3424,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3601291943298044,"acs":2007,"articleLive":2,"columnArticles":32,"formTitle":"[5835]最大方阵和","frequency":0.0,"frontendQuestionId":"5835","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":5573,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.22909556313993173,"acs":1074,"articleLive":2,"columnArticles":17,"formTitle":"[5836]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"5836","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":4688,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.1712846347607053,"acs":340,"articleLive":2,"columnArticles":9,"formTitle":"[5837]划分数字的方案数","frequency":0.0,"frontendQuestionId":"5837","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":1985,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.8563730569948187,"acs":4132,"articleLive":2,"columnArticles":31,"formTitle":"[5850]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"5850","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":4825,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5264227642276422,"acs":3885,"articleLive":2,"columnArticles":62,"formTitle":"[5851]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"5851","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":7380,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.2363689377004568,"acs":2432,"articleLive":2,"columnArticles":50,"formTitle":"[5852]最小化目标值与所选元素的差","frequency":0.0,"frontendQuestionId":"5852","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":10289,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.3608652900688299,"acs":367,"articleLive":2,"columnArticles":9,"formTitle":"[5853]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"5853","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1017,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.8443248853538937,"acs":79722,"articleLive":2,"columnArticles":614,"formTitle":"[LCP 01]猜数字","frequency":2.100412067,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":94421,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6880152187698161,"acs":13020,"articleLive":2,"columnArticles":226,"formTitle":"[LCP 02]分式化简","frequency":1.4416488308,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":18924,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21742757161458334,"acs":10687,"articleLive":2,"columnArticles":177,"formTitle":"[LCP 03]机器人大冒险","frequency":1.4744064273,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":49152,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.372972972972973,"acs":2415,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 04]覆盖","frequency":1.9663635668,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6475,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19517388218594747,"acs":1925,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":9863,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8388818094934692,"acs":42132,"articleLive":2,"columnArticles":638,"formTitle":"[LCP 06]拿硬币","frequency":1.6511803438,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":50224,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7712457302769661,"acs":37481,"articleLive":2,"columnArticles":453,"formTitle":"[LCP 07]传递信息","frequency":3.2892616113,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":48598,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.28089228059876725,"acs":4785,"articleLive":2,"columnArticles":98,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17035,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.26443294369590437,"acs":5927,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 09]最小跳跃次数","frequency":2.9262609837,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":22414,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.579302987197724,"acs":1629,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 10]二叉树任务调度","frequency":1.2416110468,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":2812,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6829013377926422,"acs":6534,"articleLive":2,"columnArticles":64,"formTitle":"[LCP 11]期望个数统计","frequency":0.3582743826,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":9568,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4055267702936097,"acs":5870,"articleLive":2,"columnArticles":95,"formTitle":"[LCP 12]小张刷题计划","frequency":1.8243231686,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":14475,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6157772621809745,"acs":9289,"articleLive":2,"columnArticles":83,"formTitle":"[LCP 13]寻宝","frequency":0.6450553705,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15085,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.19907707253886012,"acs":2459,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":1.9663635668,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12352,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5698769007965243,"acs":787,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.8446288607,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1381,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.2900552486187845,"acs":525,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1810,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7973452259718369,"acs":22706,"articleLive":2,"columnArticles":238,"formTitle":"[LCP 17]速算机器人","frequency":1.6191673668,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":28477,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.28258561643835617,"acs":16503,"articleLive":2,"columnArticles":206,"formTitle":"[LCP 18]早餐组合","frequency":1.6511803438,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":58400,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.515792276964048,"acs":19368,"articleLive":2,"columnArticles":201,"formTitle":"[LCP 19]秋叶收藏集","frequency":1.5882625586,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":37550,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.29563904096658483,"acs":1566,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 20]快速公交","frequency":1.1453830147,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5297,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.315129811996419,"acs":704,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 21]追逐游戏","frequency":1.2941717514,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2234,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3314993122420908,"acs":8676,"articleLive":2,"columnArticles":182,"formTitle":"[LCP 22]黑白方格画","frequency":2.4941480215,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26172,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3315128345166576,"acs":2428,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":1.0191652974,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7324,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.26579804560260584,"acs":816,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3070,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.31852986217457885,"acs":1040,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3265,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3263371699390657,"acs":482,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1477,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32450150232177,"acs":1188,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 27]黑盒光线反射","frequency":1.7014506026,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3661,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.2629680187207488,"acs":8091,"articleLive":2,"columnArticles":142,"formTitle":"[LCP 28]采购方案","frequency":1.4744064273,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":30768,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.16652491920394624,"acs":3916,"articleLive":2,"columnArticles":104,"formTitle":"[LCP 29]乐团站位","frequency":2.3506536777,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":23516,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3277990008815751,"acs":4462,"articleLive":2,"columnArticles":75,"formTitle":"[LCP 30]魔塔游戏","frequency":0.3284392341,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"notac","submitted":13612,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.21481973749792324,"acs":1293,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6019,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.3487058823529412,"acs":741,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 32]批量处理任务","frequency":1.1453830147,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2125,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.19509986684420771,"acs":3663,"articleLive":2,"columnArticles":73,"formTitle":"[LCP 33]蓄水","frequency":1.1762496627,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":18775,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4545028142589118,"acs":1938,"articleLive":2,"columnArticles":56,"formTitle":"[LCP 34]二叉树染色","frequency":1.4416488308,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4264,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.35876042908224076,"acs":903,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 35]电动车游城市","frequency":1.1011280057,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2517,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.22370426829268292,"acs":587,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 36]最多牌组数","frequency":1.9587153459,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":2624,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.17306622148024486,"acs":622,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 37]最小矩形面积","frequency":1.7920101796,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":3594,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5156017830609212,"acs":347,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 38]守卫城堡","frequency":1.4100755689,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":673,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5365017148456639,"acs":3285,"articleLive":2,"columnArticles":81,"formTitle":"[LCS 01]下载插件","frequency":1.2082968401,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":6123,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.7047447137699845,"acs":2733,"articleLive":2,"columnArticles":51,"formTitle":"[LCS 02]完成一半题目","frequency":0.8139139155,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":3878,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.41607435757244393,"acs":1522,"articleLive":2,"columnArticles":50,"formTitle":"[LCS 03]主题空间","frequency":0.272605588,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":3658,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6785993517624647,"acs":369743,"articleLive":2,"columnArticles":2652,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":4.6449739197,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":544862,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4030693336027208,"acs":239399,"articleLive":2,"columnArticles":1959,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":3.8089313643,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":593940,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7618847796214483,"acs":257818,"articleLive":2,"columnArticles":1824,"formTitle":"[剑指 Offer 05]替换空格","frequency":3.2252453432,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":338395,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.752393766302374,"acs":273453,"articleLive":2,"columnArticles":1953,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":3.6962476323,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":363444,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6953525812180834,"acs":175790,"articleLive":2,"columnArticles":1376,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":4.092552371,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":252807,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7178502642865494,"acs":233320,"articleLive":2,"columnArticles":1523,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":4.3240347524,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":325026,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3477786599022778,"acs":215524,"articleLive":2,"columnArticles":1590,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":3.9519398302,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"","submitted":619716,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4406042999992532,"acs":177000,"articleLive":2,"columnArticles":1239,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":3.598183274,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":401721,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.4936432391484246,"acs":239803,"articleLive":2,"columnArticles":1538,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":4.0628540674,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":485782,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.4529661724266181,"acs":154673,"articleLive":2,"columnArticles":1048,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":3.0343672269,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":341467,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5244786384793405,"acs":161359,"articleLive":2,"columnArticles":1623,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":3.5789185672,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":307656,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5680095190846796,"acs":146551,"articleLive":2,"columnArticles":1239,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":3.2682876881,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":258008,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3109167551514087,"acs":77889,"articleLive":2,"columnArticles":467,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":1.8578233982,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":250514,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7457663493829859,"acs":187646,"articleLive":2,"columnArticles":1205,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":2.5111328466,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":251615,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3378144498255974,"acs":114185,"articleLive":2,"columnArticles":715,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":1.6731761717,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":338011,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7774892392832045,"acs":141615,"articleLive":2,"columnArticles":1080,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":3.1032098887,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":182144,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5946476182622797,"acs":173071,"articleLive":2,"columnArticles":1385,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":2.9499937715,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":291048,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.37399880490351706,"acs":61963,"articleLive":2,"columnArticles":420,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":2.7085894701,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":165677,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.2386525225147038,"acs":71496,"articleLive":2,"columnArticles":795,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":3.5837696488,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":299582,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6423062771627268,"acs":176315,"articleLive":2,"columnArticles":1508,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":2.6572860523,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":274503,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7894245190679464,"acs":212116,"articleLive":2,"columnArticles":2061,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":4.1655615044,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":268697,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7425799807501817,"acs":264631,"articleLive":2,"columnArticles":1728,"formTitle":"[剑指 Offer 24]反转链表","frequency":4.6249455195,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":356367,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7287360701019144,"acs":168322,"articleLive":2,"columnArticles":1105,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":3.7079986488,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":230978,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.465171667402418,"acs":130663,"articleLive":2,"columnArticles":1100,"formTitle":"[剑指 Offer 26]树的子结构","frequency":3.2583472484,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":280892,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7905661656684371,"acs":174893,"articleLive":2,"columnArticles":1313,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":3.1202323006,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":221225,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5800017096208916,"acs":135703,"articleLive":2,"columnArticles":1020,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":2.3054298386,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":233970,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.43961476537952165,"acs":135433,"articleLive":2,"columnArticles":1406,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":3.8357697131,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":308072,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5743130198527133,"acs":120488,"articleLive":2,"columnArticles":819,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":2.7193507477,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":209795,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6133483292390565,"acs":103616,"articleLive":2,"columnArticles":864,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":1.7651989222,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":168935,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6464171258071136,"acs":122838,"articleLive":2,"columnArticles":875,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":3.1479411175,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":190029,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6861715387299951,"acs":123867,"articleLive":2,"columnArticles":1007,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":2.7872696974,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":180519,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.588872379065544,"acs":107004,"articleLive":2,"columnArticles":1048,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":2.7728394326,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":181710,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5485208045120783,"acs":103089,"articleLive":2,"columnArticles":883,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":2.9490332304,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":187940,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5774867029552712,"acs":120626,"articleLive":2,"columnArticles":800,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":3.177433081,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":208881,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7218520962867762,"acs":103907,"articleLive":2,"columnArticles":752,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":2.8156048263,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":143945,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6535080375083724,"acs":93666,"articleLive":2,"columnArticles":834,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":3.3905040704,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":143328,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5585226660923872,"acs":72618,"articleLive":2,"columnArticles":536,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":3.3347202272,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":130018,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5796421815889029,"acs":147090,"articleLive":2,"columnArticles":1060,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":4.4809084628,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":253760,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6888290796871397,"acs":155353,"articleLive":2,"columnArticles":968,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":2.985827057,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":225532,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.569002154914402,"acs":228138,"articleLive":2,"columnArticles":1722,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":3.7034953538,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":400944,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5789197962034678,"acs":56359,"articleLive":2,"columnArticles":420,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":2.2546337016,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":97352,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6052732010709793,"acs":203005,"articleLive":2,"columnArticles":1454,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":4.4185666183,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":335394,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4815861641431919,"acs":45834,"articleLive":2,"columnArticles":478,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":2.5485791866,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":95173,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41245408290396995,"acs":51313,"articleLive":2,"columnArticles":431,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":2.3443580135,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":124409,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.561686090334551,"acs":96874,"articleLive":2,"columnArticles":734,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":3.3626082587,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":172470,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5394468248514491,"acs":106763,"articleLive":2,"columnArticles":1343,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":3.3940475032,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":197912,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6888576431607658,"acs":105823,"articleLive":2,"columnArticles":904,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":2.8165144961,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":153621,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46451798995941185,"acs":135276,"articleLive":2,"columnArticles":932,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":3.5078606857,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":291218,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6513458157949908,"acs":80776,"articleLive":2,"columnArticles":485,"formTitle":"[剑指 Offer 49]丑数","frequency":3.0782210822,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":124014,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6139524410016213,"acs":136322,"articleLive":2,"columnArticles":969,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":3.2101063839,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":222040,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4807633070478068,"acs":93645,"articleLive":2,"columnArticles":798,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":4.3143275287,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":194784,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6466665058613537,"acs":160857,"articleLive":2,"columnArticles":997,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":3.3118359334,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":248748,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5405022557339811,"acs":171323,"articleLive":2,"columnArticles":1482,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":2.8948065748,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":316970,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44750087652054027,"acs":150610,"articleLive":2,"columnArticles":1370,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":2.8306590035,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":336558,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7541538727893963,"acs":148103,"articleLive":2,"columnArticles":1069,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":2.2350865585,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":196383,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7888481665319943,"acs":164011,"articleLive":2,"columnArticles":1202,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":3.1479411175,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":207912,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5861421467169896,"acs":125173,"articleLive":2,"columnArticles":873,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":2.52024868,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":213554,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.7000223569484081,"acs":106458,"articleLive":2,"columnArticles":971,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":3.0139670156,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":152078,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.7993112145906093,"acs":82393,"articleLive":2,"columnArticles":655,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":2.4290826636,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":103080,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6621209304360188,"acs":121090,"articleLive":2,"columnArticles":768,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":3.1175528783,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":182882,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7058785050804588,"acs":129492,"articleLive":2,"columnArticles":1792,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":3.0586815781,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":183448,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4408138567430603,"acs":116560,"articleLive":2,"columnArticles":885,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":2.8103907783,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":264420,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8561366388730355,"acs":184512,"articleLive":2,"columnArticles":1677,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":2.7746599319,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":215517,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44411946596820545,"acs":122084,"articleLive":2,"columnArticles":1128,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":3.654876686,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":274890,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4741243217905269,"acs":87997,"articleLive":2,"columnArticles":1028,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":2.4228142296,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":185599,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5585115793982623,"acs":59978,"articleLive":2,"columnArticles":542,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":2.8985276478,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":107389,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.46001524757242596,"acs":91716,"articleLive":2,"columnArticles":885,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":3.2347612494,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":199376,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6547410250270204,"acs":101166,"articleLive":2,"columnArticles":717,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":3.4881805799,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":154513,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6338064431309607,"acs":115702,"articleLive":2,"columnArticles":886,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":3.1536261004,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":182551,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.856581335083267,"acs":127921,"articleLive":2,"columnArticles":1234,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":2.7069394409,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":149339,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.581145272797743,"acs":64474,"articleLive":2,"columnArticles":456,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":2.100412067,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":110943,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.597316467133499,"acs":66108,"articleLive":2,"columnArticles":469,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":2.6793133746,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":110675,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.2844105175429759,"acs":62109,"articleLive":2,"columnArticles":520,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":2.6117200835,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":218378,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.693106052293572,"acs":107385,"articleLive":2,"columnArticles":633,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":2.2836044414,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":154933,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.6988202228831008,"acs":106916,"articleLive":2,"columnArticles":636,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":3.0300885964,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":152995,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.21673633567316034,"acs":2748,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.5298547857,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":12679,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5943566591422121,"acs":2633,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":4430,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.795654296875,"acs":3259,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.4567791531,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":4096,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6968312874678847,"acs":2441,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.5646409018,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":3503,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7204346009193481,"acs":1724,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":2393,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6791314837153196,"acs":2252,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.5298547857,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":3316,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.48588604286461057,"acs":1859,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":3826,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5290909090909091,"acs":1746,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":3300,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5643442622950819,"acs":1377,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":2440,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.44427890345649584,"acs":1491,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":3356,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5803713527851458,"acs":1094,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":1885,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6736541210100048,"acs":1414,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.4915652692,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":2099,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6653290529695024,"acs":829,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":1246,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5269430051813472,"acs":1017,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":1930,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6552567237163814,"acs":804,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":1227,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.5047244094488189,"acs":1282,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":2540,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5403481012658228,"acs":683,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":1264,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5509034817100044,"acs":1250,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":2269,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4924205378973105,"acs":1007,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":1.1453830147,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":2045,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.6937134502923976,"acs":949,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.5646409018,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":1368,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5284011220196353,"acs":1507,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":2852,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5269915377881529,"acs":1806,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":3427,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7095548317046688,"acs":1307,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.4567791531,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":1842,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7783251231527094,"acs":3476,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 024]反转链表","frequency":1.0191652974,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":4466,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6122186495176849,"acs":952,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":1.1453830147,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":1555,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6806411837237978,"acs":1104,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.5646409018,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":1622,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.642488827775868,"acs":1869,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":2909,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.5905511811023622,"acs":450,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":762,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.3068371317398555,"acs":552,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":1799,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5646900269541779,"acs":419,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":742,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.6018518518518519,"acs":650,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":1080,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.5940520446096654,"acs":799,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":1345,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7956104252400549,"acs":580,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":729,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5596707818930041,"acs":544,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":972,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.7279411764705882,"acs":495,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":680,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5724867724867725,"acs":541,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":945,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.48743169398907105,"acs":446,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":915,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7818930041152263,"acs":760,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":972,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5417170495767836,"acs":448,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":827,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5540540540540541,"acs":287,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.5646409018,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":518,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.8153998025666338,"acs":826,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":1013,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.866754617414248,"acs":657,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":758,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.650990099009901,"acs":263,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":404,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6660137120470128,"acs":680,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":1021,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.7793939393939394,"acs":643,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":825,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7087912087912088,"acs":645,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":910,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.7162921348314607,"acs":510,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":712,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.7055555555555556,"acs":381,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":540,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7519181585677749,"acs":588,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":782,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6128472222222222,"acs":353,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":576,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.42354533152909335,"acs":313,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":0.5646409018,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":739,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7588046958377801,"acs":711,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.4915652692,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":937,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6461038961038961,"acs":597,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.5298547857,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":924,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8827470686767169,"acs":527,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":597,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8921052631578947,"acs":339,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":380,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7369589345172031,"acs":664,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.5298547857,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":901,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.35714285714285715,"acs":180,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":504,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5762195121951219,"acs":189,"articleLive":2,"columnArticles":4,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":328,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.615606936416185,"acs":426,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":692,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6265432098765432,"acs":406,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":648,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5240506329113924,"acs":207,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":395,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7066326530612245,"acs":277,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":392,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7608695652173914,"acs":175,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":230,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6602870813397129,"acs":138,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":209,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.5579710144927537,"acs":154,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":276,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6490566037735849,"acs":172,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":265,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6866359447004609,"acs":149,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":217,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5334928229665071,"acs":669,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":1254,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7264260768335273,"acs":624,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"","submitted":859,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.7006369426751592,"acs":550,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":785,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5191489361702127,"acs":122,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":235,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4403518416712479,"acs":801,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":1819,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5612052730696798,"acs":298,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":531,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5366379310344828,"acs":498,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.5646409018,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":928,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7328145265888456,"acs":565,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":771,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.654140127388535,"acs":1027,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.5646409018,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":1570,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5199004975124378,"acs":836,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":1608,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6316831683168317,"acs":638,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":1010,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8772563176895307,"acs":729,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":831,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.7412935323383084,"acs":447,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":603,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7968197879858657,"acs":902,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":1132,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6639427987742594,"acs":650,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.4915652692,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":979,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8817921830314586,"acs":925,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.5994270179,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":1049,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6982758620689655,"acs":648,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":928,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.879492600422833,"acs":832,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.4915652692,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":946,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7427652733118971,"acs":462,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":622,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6061776061776062,"acs":471,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":777,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7425149700598802,"acs":1116,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":1503,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6074660633484162,"acs":537,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":884,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5219047619047619,"acs":274,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":525,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7582846003898636,"acs":389,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.5646409018,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":513,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6294642857142857,"acs":282,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":448,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5162790697674419,"acs":222,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":430,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5950155763239875,"acs":191,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":321,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6973550356052899,"acs":1371,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":1.1011280057,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":1966,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.5191815856777494,"acs":203,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":391,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5204460966542751,"acs":140,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":269,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7476979742173112,"acs":406,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":543,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6598360655737705,"acs":644,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":1.1011280057,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":976,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7638297872340426,"acs":359,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":470,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.46710526315789475,"acs":497,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 101]分割等和子串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":1064,"title":"分割等和子串","titleSlug":"NUPfPr"},{"acceptance":0.5672645739910314,"acs":253,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":446,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.5029045643153527,"acs":606,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":0.5646409018,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":1205,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.542528735632184,"acs":236,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":435,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6859781696053736,"acs":817,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.5298547857,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":1191,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.6280701754385964,"acs":179,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":285,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5271084337349398,"acs":175,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":332,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5112359550561798,"acs":91,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":178,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.5114754098360655,"acs":156,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":305,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8370535714285714,"acs":375,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":448,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6888888888888889,"acs":93,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":135,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5705128205128205,"acs":267,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":468,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.6574074074074074,"acs":284,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.5646409018,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":432,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.39111111111111113,"acs":88,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":225,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.25333333333333335,"acs":152,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.5646409018,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":600,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6286254728877679,"acs":997,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 116]朋友圈","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":1586,"title":"朋友圈","titleSlug":"bLyHh0"},{"acceptance":0.5701754385964912,"acs":130,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":228,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6555555555555556,"acs":177,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":270,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.462211118051218,"acs":740,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":1601,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7213850174216028,"acs":82815,"articleLive":2,"columnArticles":1462,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":3.6701194314,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":114800,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6510392383009006,"acs":53061,"articleLive":2,"columnArticles":1036,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":2.3134930978,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":81502,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.580183831925097,"acs":40650,"articleLive":2,"columnArticles":444,"formTitle":"[面试题 01.03]URL化","frequency":1.877532353,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":70064,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5514036502235579,"acs":37614,"articleLive":2,"columnArticles":734,"formTitle":"[面试题 01.04]回文排列","frequency":2.1814749464,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":68215,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3337713242171841,"acs":29974,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 01.05]一次编辑","frequency":2.0893853813,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":89804,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.47379556845882065,"acs":69195,"articleLive":2,"columnArticles":1124,"formTitle":"[面试题 01.06]字符串压缩","frequency":3.3301484145,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":146044,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7553963014320599,"acs":61558,"articleLive":2,"columnArticles":937,"formTitle":"[面试题 01.07]旋转矩阵","frequency":2.8480628539,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":81491,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6219145839140264,"acs":40162,"articleLive":2,"columnArticles":467,"formTitle":"[面试题 01.08]零矩阵","frequency":1.9079139971,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":64578,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5518408032596042,"acs":30338,"articleLive":2,"columnArticles":392,"formTitle":"[面试题 01.09]字符串轮转","frequency":1.4416488308,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":54976,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6846982390152163,"acs":60072,"articleLive":2,"columnArticles":661,"formTitle":"[面试题 02.01]移除重复节点","frequency":2.5071863558,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":87735,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7800117313764399,"acs":62500,"articleLive":2,"columnArticles":916,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":2.7759135205,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":80127,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8540643887998026,"acs":69239,"articleLive":2,"columnArticles":663,"formTitle":"[面试题 02.03]删除中间节点","frequency":2.9924051626,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":81070,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6582052994878647,"acs":23648,"articleLive":2,"columnArticles":341,"formTitle":"[面试题 02.04]分割链表","frequency":2.3981459832,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":35928,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46695497742770764,"acs":34444,"articleLive":2,"columnArticles":501,"formTitle":"[面试题 02.05]链表求和","frequency":3.6962476323,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":73763,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4823123609410588,"acs":36635,"articleLive":2,"columnArticles":485,"formTitle":"[面试题 02.06]回文链表","frequency":1.7608063999,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":75957,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6880334150071533,"acs":41840,"articleLive":2,"columnArticles":378,"formTitle":"[面试题 02.07]链表相交","frequency":1.3796086275,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":60811,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5304047013712333,"acs":25452,"articleLive":2,"columnArticles":273,"formTitle":"[面试题 02.08]环路检测","frequency":2.409279476,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":47986,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5428618080879551,"acs":9974,"articleLive":2,"columnArticles":160,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":18373,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6121296179548606,"acs":24274,"articleLive":2,"columnArticles":278,"formTitle":"[面试题 03.02]栈的最小值","frequency":2.100412067,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":39655,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3875893270268881,"acs":7539,"articleLive":2,"columnArticles":117,"formTitle":"[面试题 03.03]堆盘子","frequency":1.4416488308,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":19451,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7113885055995892,"acs":22169,"articleLive":2,"columnArticles":331,"formTitle":"[面试题 03.04]化栈为队","frequency":1.9393348944,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":31163,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5464114039449693,"acs":13186,"articleLive":2,"columnArticles":170,"formTitle":"[面试题 03.05]栈排序","frequency":0.7843696691,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":24132,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5898162915706775,"acs":9985,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 03.06]动物收容所","frequency":1.4744064273,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":16929,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5346914673752583,"acs":16299,"articleLive":2,"columnArticles":226,"formTitle":"[面试题 04.01]节点间通路","frequency":1.4744064273,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":30483,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7893695154521175,"acs":33103,"articleLive":2,"columnArticles":403,"formTitle":"[面试题 04.02]最小高度树","frequency":2.4610598086,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":41936,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8059864232703738,"acs":22915,"articleLive":2,"columnArticles":501,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":1.9079139971,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":28431,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5832813360249587,"acs":31783,"articleLive":2,"columnArticles":372,"formTitle":"[面试题 04.04]检查平衡性","frequency":1.1156189128,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":54490,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3509198500117178,"acs":23958,"articleLive":2,"columnArticles":300,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":1.9079139971,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":68272,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5916422055992172,"acs":18745,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 04.06]后继者","frequency":0.7843696691,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":31683,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7176383967603884,"acs":15595,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 04.08]首个共同祖先","frequency":1.4100755689,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":21731,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.4781418687751844,"acs":6289,"articleLive":2,"columnArticles":107,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":1.2082968401,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":13153,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7184324426044411,"acs":15271,"articleLive":2,"columnArticles":239,"formTitle":"[面试题 04.10]检查子树","frequency":0.2464260825,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":21256,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.4884649511978705,"acs":16515,"articleLive":2,"columnArticles":246,"formTitle":"[面试题 04.12]求和路径","frequency":1.4100755689,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":33810,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5067493192746654,"acs":8747,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":17261,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6842004590665647,"acs":7154,"articleLive":2,"columnArticles":114,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.8139139155,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":10456,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3915574387201521,"acs":9888,"articleLive":2,"columnArticles":216,"formTitle":"[面试题 05.03]翻转数位","frequency":1.8578233982,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":25253,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3946970300183136,"acs":4957,"articleLive":2,"columnArticles":129,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":12559,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5273377125193199,"acs":10918,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 05.06]整数转换","frequency":0.272605588,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":20704,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.703868269733403,"acs":10772,"articleLive":2,"columnArticles":196,"formTitle":"[面试题 05.07]配对交换","frequency":0.7843696691,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":15304,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5535261288685946,"acs":3273,"articleLive":2,"columnArticles":68,"formTitle":"[面试题 05.08]绘制直线","frequency":1.1453830147,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":5913,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.3638490288695091,"acs":40595,"articleLive":2,"columnArticles":448,"formTitle":"[面试题 08.01]三步问题","frequency":2.2210057851,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":111571,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36052886165752984,"acs":11180,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 08.02]迷路的机器人","frequency":1.7608063999,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":31010,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6769586416718703,"acs":50954,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 08.03]魔术索引","frequency":0.272605588,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":75269,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8227474764258713,"acs":19806,"articleLive":2,"columnArticles":312,"formTitle":"[面试题 08.04]幂集","frequency":2.067716061,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":24073,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6790169491525424,"acs":20031,"articleLive":2,"columnArticles":454,"formTitle":"[面试题 08.05]递归乘法","frequency":0.2212991324,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":29500,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6550399054093999,"acs":22160,"articleLive":2,"columnArticles":251,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":2.8700031811,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":33830,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8133498145859085,"acs":20398,"articleLive":2,"columnArticles":301,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":2.067716061,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":25079,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7187059155459419,"acs":15284,"articleLive":2,"columnArticles":219,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":2.067716061,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":21266,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8111356292852077,"acs":20585,"articleLive":2,"columnArticles":332,"formTitle":"[面试题 08.09]括号","frequency":3.0675531764,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":25378,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5595902353966871,"acs":12837,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 08.10]颜色填充","frequency":0.7559182479,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":22940,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4947816349384099,"acs":33138,"articleLive":2,"columnArticles":320,"formTitle":"[面试题 08.11]硬币","frequency":2.409279476,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":66975,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7581664398211161,"acs":15597,"articleLive":2,"columnArticles":282,"formTitle":"[面试题 08.12]八皇后","frequency":2.3165346477,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":20572,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5014251781472684,"acs":6333,"articleLive":2,"columnArticles":86,"formTitle":"[面试题 08.13]堆箱子","frequency":0.8446288607,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":12630,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5326917633739032,"acs":3764,"articleLive":2,"columnArticles":71,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7066,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5536221518340656,"acs":54183,"articleLive":2,"columnArticles":2358,"formTitle":"[面试题 10.01]合并排序的数组","frequency":3.5489617356,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":97870,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.739505475404137,"acs":34035,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 10.02]变位词组","frequency":2.9115656421,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46024,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3970185679891824,"acs":12038,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":2.8354903976,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":30321,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5524519869549462,"acs":18295,"articleLive":2,"columnArticles":245,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":1.1762496627,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":33116,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.45596716947648624,"acs":12333,"articleLive":2,"columnArticles":159,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":2.1497598147,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":27048,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6297613754261153,"acs":4249,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.2999147674,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":6747,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.666417701428438,"acs":7138,"articleLive":2,"columnArticles":91,"formTitle":"[面试题 10.11]峰与谷","frequency":1.9718656439,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":10711,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8326634877384196,"acs":24447,"articleLive":2,"columnArticles":387,"formTitle":"[面试题 16.01]交换数字","frequency":1.4744064273,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":29360,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7653247688133341,"acs":13821,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.02]单词频率","frequency":0.272605588,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":18059,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44319618031175395,"acs":9468,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 16.03]交点","frequency":0.3284392341,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21363,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4607354525862069,"acs":6841,"articleLive":2,"columnArticles":151,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":14848,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46404280402648046,"acs":10234,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 16.05]阶乘尾数","frequency":1.4416488308,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":22054,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.42389496407969707,"acs":11978,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 16.06]最小差","frequency":1.6843795154,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":28257,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7338030925817185,"acs":18745,"articleLive":2,"columnArticles":277,"formTitle":"[面试题 16.07]最大数值","frequency":1.8243231686,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":25545,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.37737150741635045,"acs":2188,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.3582743826,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":5798,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5468293977182277,"acs":2061,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3769,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.684801016088061,"acs":9705,"articleLive":2,"columnArticles":181,"formTitle":"[面试题 16.10]生存人数","frequency":1.1762496627,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":14172,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.441115361636482,"acs":49468,"articleLive":2,"columnArticles":571,"formTitle":"[面试题 16.11]跳水板","frequency":1.1762496627,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":112143,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.43202846975088965,"acs":1821,"articleLive":2,"columnArticles":48,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4215,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5493072534637327,"acs":3370,"articleLive":2,"columnArticles":55,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6135,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5022888056595922,"acs":8449,"articleLive":2,"columnArticles":209,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.272605588,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":16821,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.45066658079474464,"acs":13995,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 16.16]部分排序","frequency":1.9393348944,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":31054,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.601281704124921,"acs":33308,"articleLive":2,"columnArticles":364,"formTitle":"[面试题 16.17]连续数列","frequency":2.100412067,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":55395,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.34446498728911484,"acs":14905,"articleLive":2,"columnArticles":305,"formTitle":"[面试题 16.18]模式匹配","frequency":1.4744064273,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":43270,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6087881157154027,"acs":19466,"articleLive":2,"columnArticles":346,"formTitle":"[面试题 16.19]水域大小","frequency":2.4610598086,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":31975,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7200895162678602,"acs":8366,"articleLive":2,"columnArticles":161,"formTitle":"[面试题 16.20]T9键盘","frequency":1.6511803438,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":11618,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4648290954564402,"acs":8921,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 16.21]交换和","frequency":0.272605588,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":19192,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5814987769624194,"acs":2615,"articleLive":2,"columnArticles":54,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.3582743826,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4497,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47024246877296105,"acs":10240,"articleLive":2,"columnArticles":151,"formTitle":"[面试题 16.24]数对和","frequency":1.1453830147,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":21776,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5437203101823166,"acs":28958,"articleLive":2,"columnArticles":246,"formTitle":"[面试题 16.25]LRU 缓存","frequency":4.2604123287,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":53259,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3863950276243094,"acs":13428,"articleLive":2,"columnArticles":190,"formTitle":"[面试题 16.26]计算器","frequency":2.9115656421,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":34752,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5990925964116313,"acs":11620,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 17.01]不用加号的加法","frequency":1.1762496627,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":19396,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6457746306323966,"acs":26356,"articleLive":2,"columnArticles":430,"formTitle":"[面试题 17.04]消失的数字","frequency":2.0055842799,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":40813,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.3854041013268999,"acs":5112,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.8446288607,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":13264,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.44702658818753804,"acs":4405,"articleLive":2,"columnArticles":102,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.272605588,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":9854,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.41140215716486905,"acs":8277,"articleLive":2,"columnArticles":210,"formTitle":"[面试题 17.07]婴儿名字","frequency":1.6511803438,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":20119,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27174955473352513,"acs":7934,"articleLive":2,"columnArticles":113,"formTitle":"[面试题 17.08]马戏团人塔","frequency":1.8925974165,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":29196,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5495178578818856,"acs":13278,"articleLive":2,"columnArticles":132,"formTitle":"[面试题 17.09]第 k 个数","frequency":2.6067125617,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":24163,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5713876694025577,"acs":65857,"articleLive":2,"columnArticles":911,"formTitle":"[面试题 17.10]主要元素","frequency":2.929784099,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":115258,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6861980452167045,"acs":13901,"articleLive":2,"columnArticles":249,"formTitle":"[面试题 17.11]单词距离","frequency":1.6843795154,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":20258,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6319587956633708,"acs":19877,"articleLive":2,"columnArticles":282,"formTitle":"[面试题 17.12]BiNode","frequency":0.8446288607,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":31453,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5530028860689908,"acs":24143,"articleLive":2,"columnArticles":261,"formTitle":"[面试题 17.13]恢复空格","frequency":1.4416488308,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":43658,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5472124894664478,"acs":37014,"articleLive":2,"columnArticles":416,"formTitle":"[面试题 17.14]最小K个数","frequency":3.5379321106,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"","submitted":67641,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40265453732011036,"acs":5400,"articleLive":2,"columnArticles":111,"formTitle":"[面试题 17.15]最长单词","frequency":1.4744064273,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":13411,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5195965897640348,"acs":59300,"articleLive":2,"columnArticles":1119,"formTitle":"[面试题 17.16]按摩师","frequency":2.6793133746,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":114127,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.44240400667779634,"acs":7420,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 17.17]多次搜索","frequency":0.8139139155,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":16772,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.44655285620485885,"acs":6801,"articleLive":2,"columnArticles":112,"formTitle":"[面试题 17.18]最短超串","frequency":0.8446288607,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":15230,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5821849694558886,"acs":8196,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 17.19]消失的两个数字","frequency":1.6191673668,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":14078,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5686244204018547,"acs":3679,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 17.20]连续中值","frequency":0.8139139155,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6470,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6350942347901101,"acs":43436,"articleLive":2,"columnArticles":527,"formTitle":"[面试题 17.21]直方图的水量","frequency":4.181755448,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":68393,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.37083894122925076,"acs":8266,"articleLive":2,"columnArticles":148,"formTitle":"[面试题 17.22]单词转换","frequency":1.9393348944,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":22290,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.38027019675401214,"acs":4194,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.3284392341,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":11029,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5136573927371824,"acs":8105,"articleLive":2,"columnArticles":103,"formTitle":"[面试题 17.24]最大子矩阵","frequency":2.9449489248,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":15779,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.4933431952662722,"acs":1334,"articleLive":2,"columnArticles":37,"formTitle":"[面试题 17.25]单词矩阵","frequency":1.3501774273,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":2704,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.34042103036073207,"acs":3218,"articleLive":2,"columnArticles":48,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.8766008934,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":9453,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file +[{"acceptance":0.5338782034754809,"acs":20707,"articleLive":2,"columnArticles":245,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"","submitted":38786,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5186214773505918,"acs":2390232,"articleLive":2,"columnArticles":13752,"formTitle":"[1]两数之和","frequency":4.8321305314,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4608818,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.40725154254360185,"acs":955529,"articleLive":2,"columnArticles":6842,"formTitle":"[2]两数相加","frequency":4.79648884,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2346287,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.3782987179462292,"acs":1169254,"articleLive":2,"columnArticles":7037,"formTitle":"[3]无重复字符的最长子串","frequency":4.7252054574,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3090822,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.40674466969458245,"acs":481713,"articleLive":2,"columnArticles":3592,"formTitle":"[4]寻找两个正序数组的中位数","frequency":4.5890901694,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1184313,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35179558754663814,"acs":692644,"articleLive":2,"columnArticles":3779,"formTitle":"[5]最长回文子串","frequency":4.5874242499,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":1968882,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5059178073556271,"acs":288916,"articleLive":2,"columnArticles":2330,"formTitle":"[6]Z 字形变换","frequency":3.734548363,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":571073,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3538645704481066,"acs":798138,"articleLive":2,"columnArticles":5056,"formTitle":"[7]整数反转","frequency":4.7608471487,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2255490,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.2167366923828189,"acs":330660,"articleLive":2,"columnArticles":2583,"formTitle":"[8]字符串转换整数 (atoi)","frequency":3.6253832864,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1525630,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5856144129687426,"acs":735715,"articleLive":2,"columnArticles":4723,"formTitle":"[9]回文数","frequency":3.7925136933,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1256313,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.31629677917343685,"acs":195052,"articleLive":2,"columnArticles":1189,"formTitle":"[10]正则表达式匹配","frequency":4.2327489122,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":616674,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6323649708720483,"acs":508663,"articleLive":2,"columnArticles":2878,"formTitle":"[11]盛最多水的容器","frequency":4.0892352077,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":804382,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6657281377518907,"acs":216819,"articleLive":2,"columnArticles":1704,"formTitle":"[12]整数转罗马数字","frequency":3.6685376011,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":325687,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6331479270136346,"acs":446444,"articleLive":2,"columnArticles":3731,"formTitle":"[13]罗马数字转整数","frequency":3.9125315182,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":705118,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.406055552211198,"acs":593585,"articleLive":2,"columnArticles":3710,"formTitle":"[14]最长公共前缀","frequency":4.2674444998,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1461832,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.33203802478236927,"acs":614359,"articleLive":2,"columnArticles":2898,"formTitle":"[15]三数之和","frequency":4.5282223926,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":1850267,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4598469635131144,"acs":247537,"articleLive":2,"columnArticles":1357,"formTitle":"[16]最接近的三数之和","frequency":4.1396376714,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":538303,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5713718703291831,"acs":319582,"articleLive":2,"columnArticles":2896,"formTitle":"[17]电话号码的字母组合","frequency":3.8027707195,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":559324,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.40235891511398286,"acs":209664,"articleLive":2,"columnArticles":1442,"formTitle":"[18]四数之和","frequency":3.3283296044,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":521087,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.4272122851752248,"acs":477998,"articleLive":2,"columnArticles":3595,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":3.6802844765,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1118877,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44451640682034943,"acs":739189,"articleLive":2,"columnArticles":5295,"formTitle":"[20]有效的括号","frequency":4.4414787756,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1662906,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.666140924689698,"acs":670269,"articleLive":2,"columnArticles":3258,"formTitle":"[21]合并两个有序链表","frequency":4.0709765299,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1006197,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7724747302562125,"acs":328542,"articleLive":2,"columnArticles":2495,"formTitle":"[22]括号生成","frequency":4.4178188807,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":425311,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5582414405711348,"acs":305113,"articleLive":2,"columnArticles":1994,"formTitle":"[23]合并K个升序链表","frequency":3.999570639,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":546561,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7021955272645336,"acs":299169,"articleLive":2,"columnArticles":2399,"formTitle":"[24]两两交换链表中的节点","frequency":2.8971382237,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":426048,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6560835836296965,"acs":213630,"articleLive":2,"columnArticles":2056,"formTitle":"[25]K 个一组翻转链表","frequency":4.365167226,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":325614,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5403892297257773,"acs":770454,"articleLive":2,"columnArticles":4312,"formTitle":"[26]删除有序数组中的重复项","frequency":3.9011755025,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1425739,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5982881462550568,"acs":454626,"articleLive":2,"columnArticles":3868,"formTitle":"[27]移除元素","frequency":3.5950020934,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":759878,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40718549734251436,"acs":445340,"articleLive":2,"columnArticles":3104,"formTitle":"[28]实现 strStr()","frequency":3.7033721925,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1093703,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.20727062942469762,"acs":104550,"articleLive":2,"columnArticles":855,"formTitle":"[29]两数相除","frequency":3.285917488,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","submitted":504413,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.35513762939616694,"acs":75270,"articleLive":2,"columnArticles":555,"formTitle":"[30]串联所有单词的子串","frequency":2.879087192,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":211946,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37309597546212747,"acs":200948,"articleLive":2,"columnArticles":1641,"formTitle":"[31]下一个排列","frequency":3.8853304599,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":538596,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3551539215180735,"acs":179075,"articleLive":2,"columnArticles":1243,"formTitle":"[32]最长有效括号","frequency":3.7518199495,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":504218,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4250110564465955,"acs":340195,"articleLive":2,"columnArticles":2273,"formTitle":"[33]搜索旋转排序数组","frequency":3.7233999755,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":800438,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4247559789692003,"acs":315798,"articleLive":2,"columnArticles":3063,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":3.4877037708,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":743481,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.46680866773450935,"acs":466586,"articleLive":2,"columnArticles":3680,"formTitle":"[35]搜索插入位置","frequency":3.4980821526,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":999523,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.628272211919334,"acs":167018,"articleLive":2,"columnArticles":1088,"formTitle":"[36]有效的数独","frequency":2.5565266789,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":265837,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6707720756900969,"acs":95037,"articleLive":2,"columnArticles":809,"formTitle":"[37]解数独","frequency":3.1705958839,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":141683,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5792557029472165,"acs":208729,"articleLive":2,"columnArticles":2197,"formTitle":"[38]外观数列","frequency":3.0989466681,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":360340,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7267202709996836,"acs":312356,"articleLive":2,"columnArticles":1841,"formTitle":"[39]组合总和","frequency":3.5000161648,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":429816,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6291298231511254,"acs":187833,"articleLive":2,"columnArticles":1311,"formTitle":"[40]组合总和 II","frequency":3.4647899801,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":298560,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41820279914478065,"acs":155111,"articleLive":2,"columnArticles":1365,"formTitle":"[41]缺失的第一个正数","frequency":4.1575732273,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":370899,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5733763556102836,"acs":301733,"articleLive":2,"columnArticles":2322,"formTitle":"[42]接雨水","frequency":4.6320018345,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":526239,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4487282694380764,"acs":161093,"articleLive":2,"columnArticles":1079,"formTitle":"[43]字符串相乘","frequency":3.9114561645,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":358999,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32770716910124664,"acs":80808,"articleLive":2,"columnArticles":525,"formTitle":"[44]通配符匹配","frequency":3.1302840977,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":246586,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.42384356175187793,"acs":179488,"articleLive":2,"columnArticles":1479,"formTitle":"[45]跳跃游戏 II","frequency":4.6895637661,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":423477,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7821001120687249,"acs":392206,"articleLive":2,"columnArticles":2527,"formTitle":"[46]全排列","frequency":4.5777586034,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":501478,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6358547587972173,"acs":200719,"articleLive":2,"columnArticles":1396,"formTitle":"[47]全排列 II","frequency":3.3833338447,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":315668,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7347704404846355,"acs":208195,"articleLive":2,"columnArticles":1776,"formTitle":"[48]旋转图像","frequency":3.4695197986,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":283347,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6634877302633548,"acs":221654,"articleLive":2,"columnArticles":1243,"formTitle":"[49]字母异位词分组","frequency":3.3298165272,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"","submitted":334074,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3767434343727813,"acs":207476,"articleLive":2,"columnArticles":1233,"formTitle":"[50]Pow(x, n)","frequency":3.2353977708,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":550709,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7389989152963583,"acs":145115,"articleLive":2,"columnArticles":1467,"formTitle":"[51]N 皇后","frequency":3.1943608575,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":196367,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8237961388532232,"acs":71218,"articleLive":2,"columnArticles":584,"formTitle":"[52]N皇后 II","frequency":1.3709030133,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":86451,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.550361166632387,"acs":626147,"articleLive":2,"columnArticles":3539,"formTitle":"[53]最大子序和","frequency":3.7085944511,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1137702,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.47842427542614924,"acs":179234,"articleLive":2,"columnArticles":1904,"formTitle":"[54]螺旋矩阵","frequency":4.1855049391,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":374634,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4316474567252147,"acs":298514,"articleLive":2,"columnArticles":2324,"formTitle":"[55]跳跃游戏","frequency":3.5607576443,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":691569,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.465519978567814,"acs":281499,"articleLive":2,"columnArticles":2183,"formTitle":"[56]合并区间","frequency":4.2160135203,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"","submitted":604698,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.41042463013210273,"acs":82891,"articleLive":2,"columnArticles":898,"formTitle":"[57]插入区间","frequency":1.9402969912,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":201964,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.35160291272615557,"acs":211730,"articleLive":2,"columnArticles":2283,"formTitle":"[58]最后一个单词的长度","frequency":2.5790016615,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"","submitted":602185,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7935514886059384,"acs":118851,"articleLive":2,"columnArticles":1485,"formTitle":"[59]螺旋矩阵 II","frequency":3.6324456289,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":149771,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5233295535676789,"acs":87227,"articleLive":2,"columnArticles":910,"formTitle":"[60]排列序列","frequency":1.7815319859,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":166677,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4182982770814811,"acs":188668,"articleLive":2,"columnArticles":1920,"formTitle":"[61]旋转链表","frequency":3.5793809063,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":451037,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6593595026579614,"acs":295699,"articleLive":2,"columnArticles":2304,"formTitle":"[62]不同路径","frequency":3.23465592,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":448464,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.38938049055630025,"acs":170514,"articleLive":2,"columnArticles":1619,"formTitle":"[63]不同路径 II","frequency":3.3283296044,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":437911,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6876041148346062,"acs":254265,"articleLive":2,"columnArticles":1984,"formTitle":"[64]最小路径和","frequency":3.4567343531,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":369784,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.26891184259403494,"acs":44883,"articleLive":2,"columnArticles":622,"formTitle":"[65]有效数字","frequency":2.2690405504,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":166906,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.45856533969588686,"acs":332879,"articleLive":2,"columnArticles":3036,"formTitle":"[66]加一","frequency":3.045610174,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":725914,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5441053743485594,"acs":186466,"articleLive":2,"columnArticles":1715,"formTitle":"[67]二进制求和","frequency":2.8091984792,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":342702,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.4700573838834666,"acs":19168,"articleLive":2,"columnArticles":289,"formTitle":"[68]文本左右对齐","frequency":2.1398102397,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"","submitted":40778,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39297524893927877,"acs":364459,"articleLive":2,"columnArticles":1841,"formTitle":"[69]x 的平方根","frequency":3.7784229994,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":927435,"title":"x 的平方根","titleSlug":"sqrtx"},{"acceptance":0.5273082770819899,"acs":534795,"articleLive":2,"columnArticles":3372,"formTitle":"[70]爬楼梯","frequency":4.3293499071,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1014198,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42141083030464616,"acs":90093,"articleLive":2,"columnArticles":793,"formTitle":"[71]简化路径","frequency":2.6066876452,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":213789,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6123668495048393,"acs":163554,"articleLive":2,"columnArticles":1172,"formTitle":"[72]编辑距离","frequency":4.4925807013,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":267085,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6006955330571138,"acs":124538,"articleLive":2,"columnArticles":911,"formTitle":"[73]矩阵置零","frequency":2.5847039065,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":207323,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4576955849401963,"acs":159533,"articleLive":2,"columnArticles":1612,"formTitle":"[74]搜索二维矩阵","frequency":3.655391625,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":348557,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5936989894605739,"acs":251688,"articleLive":2,"columnArticles":1760,"formTitle":"[75]颜色分类","frequency":2.2829981605,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":423932,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4230796940329469,"acs":170301,"articleLive":2,"columnArticles":1176,"formTitle":"[76]最小覆盖子串","frequency":4.0191433919,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":402527,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.770072437302167,"acs":202412,"articleLive":2,"columnArticles":1196,"formTitle":"[77]组合","frequency":3.4734442964,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":262848,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8003126114767625,"acs":293898,"articleLive":2,"columnArticles":1936,"formTitle":"[78]子集","frequency":3.7100299513,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":367229,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4567828088823981,"acs":208932,"articleLive":2,"columnArticles":1328,"formTitle":"[79]单词搜索","frequency":3.5431262884,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":457399,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6157654768004064,"acs":143022,"articleLive":2,"columnArticles":1289,"formTitle":"[80]删除有序数组中的重复项 II","frequency":3.2207972662,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":232267,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.41622861779405235,"acs":119011,"articleLive":2,"columnArticles":955,"formTitle":"[81]搜索旋转排序数组 II","frequency":3.4626146475,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":285927,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.528431555066121,"acs":167470,"articleLive":2,"columnArticles":1609,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":3.8216242624,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":316919,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5385549911365761,"acs":298339,"articleLive":2,"columnArticles":1837,"formTitle":"[83]删除排序链表中的重复元素","frequency":3.3233278434,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":553962,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4325065978886756,"acs":173058,"articleLive":2,"columnArticles":1097,"formTitle":"[84]柱状图中最大的矩形","frequency":3.8839591063,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":400128,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5162105239572947,"acs":92157,"articleLive":2,"columnArticles":651,"formTitle":"[85]最大矩形","frequency":2.9192532337,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":178526,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6319418438153982,"acs":114748,"articleLive":2,"columnArticles":1059,"formTitle":"[86]分隔链表","frequency":2.8091984792,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":181580,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48950678264221864,"acs":40632,"articleLive":2,"columnArticles":303,"formTitle":"[87]扰乱字符串","frequency":3.3459742515,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":83006,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5147296593680634,"acs":432009,"articleLive":2,"columnArticles":3048,"formTitle":"[88]合并两个有序数组","frequency":4.6016603148,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":839293,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7090780392850823,"acs":56098,"articleLive":2,"columnArticles":455,"formTitle":"[89]格雷编码","frequency":2.2350262367,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":79114,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6338377913342719,"acs":129668,"articleLive":2,"columnArticles":1151,"formTitle":"[90]子集 II","frequency":3.6289942553,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":204576,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3040155932999779,"acs":152697,"articleLive":2,"columnArticles":1454,"formTitle":"[91]解码方法","frequency":3.1930599597,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":502267,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.546612777140196,"acs":197184,"articleLive":2,"columnArticles":1933,"formTitle":"[92]反转链表 II","frequency":4.3128490664,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":360738,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5367660642986679,"acs":142367,"articleLive":2,"columnArticles":1251,"formTitle":"[93]复原 IP 地址","frequency":3.9421558585,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":265231,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7559541162853126,"acs":523787,"articleLive":2,"columnArticles":2167,"formTitle":"[94]二叉树的中序遍历","frequency":2.9971916161,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":692882,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.6985072227621129,"acs":95597,"articleLive":2,"columnArticles":593,"formTitle":"[95]不同的二叉搜索树 II","frequency":2.9000194058,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":136859,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6992614230622146,"acs":151767,"articleLive":2,"columnArticles":1214,"formTitle":"[96]不同的二叉搜索树","frequency":3.3833338447,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":217039,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4571206238167057,"acs":56981,"articleLive":2,"columnArticles":513,"formTitle":"[97]交错字符串","frequency":2.1101109672,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":124652,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.34812973662088426,"acs":325502,"articleLive":2,"columnArticles":1824,"formTitle":"[98]验证二叉搜索树","frequency":3.5000161648,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":935002,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6160508989500706,"acs":66714,"articleLive":2,"columnArticles":553,"formTitle":"[99]恢复二叉搜索树","frequency":2.6698798593,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":108293,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6039555927771877,"acs":236538,"articleLive":2,"columnArticles":1796,"formTitle":"[100]相同的树","frequency":2.678958922,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":391648,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5604051937040204,"acs":385983,"articleLive":2,"columnArticles":2140,"formTitle":"[101]对称二叉树","frequency":3.4926469346,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":688757,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.642114510628584,"acs":371304,"articleLive":2,"columnArticles":2366,"formTitle":"[102]二叉树的层序遍历","frequency":4.226824298,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":578252,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5716082371507903,"acs":164075,"articleLive":2,"columnArticles":1513,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":3.8901912093,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":287041,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7655828969644474,"acs":486126,"articleLive":2,"columnArticles":2418,"formTitle":"[104]二叉树的最大深度","frequency":3.6503263079,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":634975,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7030191933139973,"acs":233176,"articleLive":2,"columnArticles":1353,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":3.926586532,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":331678,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7212001877439813,"acs":125998,"articleLive":2,"columnArticles":833,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":3.2817494955,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":174706,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6949822501969741,"acs":157009,"articleLive":2,"columnArticles":1268,"formTitle":"[107]二叉树的层序遍历 II","frequency":3.0266160384,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":225918,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7587818019179963,"acs":182377,"articleLive":2,"columnArticles":1143,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":2.4577023522,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":240355,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.763506772409828,"acs":90303,"articleLive":2,"columnArticles":691,"formTitle":"[109]有序链表转换二叉搜索树","frequency":2.7595095142,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":118274,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.562205165477684,"acs":242885,"articleLive":2,"columnArticles":1390,"formTitle":"[110]平衡二叉树","frequency":3.0989466681,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":432022,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.48393974252798627,"acs":255360,"articleLive":2,"columnArticles":1704,"formTitle":"[111]二叉树的最小深度","frequency":2.0465616718,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":527669,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5258217048719642,"acs":249983,"articleLive":2,"columnArticles":1572,"formTitle":"[112]路径总和","frequency":2.7357060793,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":475414,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6257602983301631,"acs":166461,"articleLive":2,"columnArticles":1169,"formTitle":"[113]路径总和 II","frequency":3.0508141824,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":266014,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7252624769431162,"acs":165927,"articleLive":2,"columnArticles":1233,"formTitle":"[114]二叉树展开为链表","frequency":2.2374154386,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":228782,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.525684000724769,"acs":58025,"articleLive":2,"columnArticles":653,"formTitle":"[115]不同的子序列","frequency":3.2466492448,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":110380,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.702211014980025,"acs":145364,"articleLive":2,"columnArticles":1093,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":2.454311139,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":207009,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6091871353950992,"acs":83854,"articleLive":2,"columnArticles":705,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":1.2128460785,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":137649,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7244677546361515,"acs":200566,"articleLive":2,"columnArticles":1641,"formTitle":"[118]杨辉三角","frequency":3.4060983151,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":276846,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6621989590668039,"acs":134484,"articleLive":2,"columnArticles":1150,"formTitle":"[119]杨辉三角 II","frequency":2.7000389606,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":203087,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6786930788742602,"acs":168567,"articleLive":2,"columnArticles":1489,"formTitle":"[120]三角形最小路径和","frequency":2.5318584325,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":248370,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5726587483117084,"acs":527023,"articleLive":2,"columnArticles":3224,"formTitle":"[121]买卖股票的最佳时机","frequency":4.0787201028,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":920309,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6864974892680068,"acs":433379,"articleLive":2,"columnArticles":2529,"formTitle":"[122]买卖股票的最佳时机 II","frequency":3.3833338447,"frontendQuestionId":"122","leaf":true,"level":1,"nodeType":"def","questionId":"122","status":"","submitted":631290,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5325725154541132,"acs":124320,"articleLive":2,"columnArticles":792,"formTitle":"[123]买卖股票的最佳时机 III","frequency":2.8720868134,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":233433,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4425372888512249,"acs":147784,"articleLive":2,"columnArticles":1037,"formTitle":"[124]二叉树中的最大路径和","frequency":4.022976797,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":333947,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47385853062378436,"acs":264822,"articleLive":2,"columnArticles":1777,"formTitle":"[125]验证回文串","frequency":3.2075760091,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":558863,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3932188025117184,"acs":35569,"articleLive":2,"columnArticles":317,"formTitle":"[126]单词接龙 II","frequency":1.9925912299,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":90456,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46690339794396923,"acs":118995,"articleLive":2,"columnArticles":629,"formTitle":"[127]单词接龙","frequency":2.430005062,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":254860,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5427282368751059,"acs":157103,"articleLive":2,"columnArticles":1031,"formTitle":"[128]最长连续序列","frequency":3.662750213,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":289469,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6793762084605793,"acs":112788,"articleLive":2,"columnArticles":1069,"formTitle":"[129]求根节点到叶节点数字之和","frequency":3.0685861091,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":166017,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44143428046051114,"acs":120512,"articleLive":2,"columnArticles":1111,"formTitle":"[130]被围绕的区域","frequency":2.7807278718,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":273001,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7238178292349884,"acs":126160,"articleLive":2,"columnArticles":829,"formTitle":"[131]分割回文串","frequency":4.0847016974,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":174298,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49289460154241643,"acs":47934,"articleLive":2,"columnArticles":428,"formTitle":"[132]分割回文串 II","frequency":3.1807871291,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":97250,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6753268164009465,"acs":69637,"articleLive":2,"columnArticles":507,"formTitle":"[133]克隆图","frequency":0.2768834642,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":103116,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5759326358269913,"acs":118736,"articleLive":2,"columnArticles":924,"formTitle":"[134]加油站","frequency":3.5113447354,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":206163,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4851842146638017,"acs":92578,"articleLive":2,"columnArticles":740,"formTitle":"[135]分发糖果","frequency":4.1278585098,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"","submitted":190810,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7188599540131544,"acs":470519,"articleLive":2,"columnArticles":2143,"formTitle":"[136]只出现一次的数字","frequency":3.7418276381,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":654535,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7194583937804561,"acs":96706,"articleLive":2,"columnArticles":740,"formTitle":"[137]只出现一次的数字 II","frequency":3.5035625193,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":134415,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6586368075474943,"acs":107232,"articleLive":2,"columnArticles":832,"formTitle":"[138]复制带随机指针的链表","frequency":3.2919182261,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":162809,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5120493856922693,"acs":178419,"articleLive":2,"columnArticles":1137,"formTitle":"[139]单词拆分","frequency":3.7518199495,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":348441,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.48097803016724994,"acs":50988,"articleLive":2,"columnArticles":516,"formTitle":"[140]单词拆分 II","frequency":2.0263098659,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":106009,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5121037168943255,"acs":495213,"articleLive":2,"columnArticles":2583,"formTitle":"[141]环形链表","frequency":3.7700924496,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":967017,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5513210926110949,"acs":276455,"articleLive":2,"columnArticles":1625,"formTitle":"[142]环形链表 II","frequency":3.4581210658,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":501441,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6163023439557546,"acs":117005,"articleLive":2,"columnArticles":1023,"formTitle":"[143]重排链表","frequency":4.4009294402,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":189850,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7022705701978535,"acs":384760,"articleLive":2,"columnArticles":1744,"formTitle":"[144]二叉树的前序遍历","frequency":2.6354169983,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":547880,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7490933501647482,"acs":280089,"articleLive":2,"columnArticles":1473,"formTitle":"[145]二叉树的后序遍历","frequency":3.2070156501,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":373904,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5264340994256753,"acs":215221,"articleLive":2,"columnArticles":1311,"formTitle":"[146]LRU 缓存机制","frequency":4.4684937442,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":408828,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6803083134520096,"acs":96382,"articleLive":2,"columnArticles":759,"formTitle":"[147]对链表进行插入排序","frequency":2.3043300274,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":141674,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6675824268317728,"acs":198286,"articleLive":2,"columnArticles":1192,"formTitle":"[148]排序链表","frequency":3.8650263182,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":297021,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.33532320308731306,"acs":44488,"articleLive":2,"columnArticles":490,"formTitle":"[149]直线上最多的点数","frequency":3.1302840977,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":132672,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5368884440523851,"acs":126594,"articleLive":2,"columnArticles":1004,"formTitle":"[150]逆波兰表达式求值","frequency":3.3519044821,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":235792,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.4792790786555401,"acs":159263,"articleLive":2,"columnArticles":1359,"formTitle":"[151]翻转字符串里的单词","frequency":2.9408897333,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":332297,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42001742228871786,"acs":170685,"articleLive":2,"columnArticles":1164,"formTitle":"[152]乘积最大子数组","frequency":3.6165697596,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":406376,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5652083806495571,"acs":199089,"articleLive":2,"columnArticles":1410,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":2.7248664523,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":352240,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.53190812184481,"acs":108630,"articleLive":2,"columnArticles":858,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":3.0989466681,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":204227,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5720685939085763,"acs":273383,"articleLive":2,"columnArticles":1529,"formTitle":"[155]最小栈","frequency":3.286710346,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":477885,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7263007840342124,"acs":6114,"articleLive":2,"columnArticles":105,"formTitle":"[156]上下翻转二叉树","frequency":0.8353654542,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"","submitted":8418,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5305232558139535,"acs":5110,"articleLive":2,"columnArticles":79,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"","submitted":9632,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5878884100703107,"acs":2592,"articleLive":2,"columnArticles":61,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.4265946251,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"","submitted":4409,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5393672647932889,"acs":14338,"articleLive":2,"columnArticles":178,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":2.088441647,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"","submitted":26583,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6113416750459079,"acs":314940,"articleLive":2,"columnArticles":1866,"formTitle":"[160]相交链表","frequency":3.5604041575,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":515162,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3366810587572743,"acs":7174,"articleLive":2,"columnArticles":96,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.3041926436,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"","submitted":21308,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49440256171049646,"acs":117651,"articleLive":2,"columnArticles":688,"formTitle":"[162]寻找峰值","frequency":2.9686324364,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":237966,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3225099225099225,"acs":8532,"articleLive":2,"columnArticles":133,"formTitle":"[163]缺失的区间","frequency":0.8353654542,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"","submitted":26455,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6106968894206118,"acs":57171,"articleLive":2,"columnArticles":482,"formTitle":"[164]最大间距","frequency":2.9039950799,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":93616,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.4849493662646345,"acs":52150,"articleLive":2,"columnArticles":517,"formTitle":"[165]比较版本号","frequency":3.8960214497,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"","submitted":107537,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.2979849426861967,"acs":25450,"articleLive":2,"columnArticles":198,"formTitle":"[166]分数到小数","frequency":2.5148736074,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":85407,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5863091474396153,"acs":268906,"articleLive":2,"columnArticles":1760,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":2.7755465131,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":458642,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.4325736705007129,"acs":80707,"articleLive":2,"columnArticles":731,"formTitle":"[168]Excel表列名称","frequency":2.9828070182,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":186574,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6640613908314191,"acs":364834,"articleLive":2,"columnArticles":2083,"formTitle":"[169]多数元素","frequency":3.4734442964,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":549398,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.4163003568288773,"acs":8050,"articleLive":2,"columnArticles":79,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.2768834642,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"","submitted":19337,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.717239659460096,"acs":103540,"articleLive":2,"columnArticles":887,"formTitle":"[171]Excel 表列序号","frequency":1.0663107544,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":144359,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.43702889526412114,"acs":86679,"articleLive":2,"columnArticles":566,"formTitle":"[172]阶乘后的零","frequency":2.3043300274,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","questionId":"172","status":"","submitted":198337,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.802991415169484,"acs":72584,"articleLive":2,"columnArticles":609,"formTitle":"[173]二叉搜索树迭代器","frequency":2.3598690077,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":90392,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4795647454257726,"acs":36668,"articleLive":2,"columnArticles":394,"formTitle":"[174]地下城游戏","frequency":3.0866886083,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":76461,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7396955353716259,"acs":289110,"articleLive":2,"columnArticles":1415,"formTitle":"[175]组合两个表","frequency":4.5347823318,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":390850,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.35616073474659754,"acs":239345,"articleLive":2,"columnArticles":972,"formTitle":"[176]第二高的薪水","frequency":4.5736802943,"frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","questionId":"176","status":"","submitted":672014,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4617675201898419,"acs":120646,"articleLive":2,"columnArticles":462,"formTitle":"[177]第N高的薪水","frequency":3.752924068,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":261270,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6012937497322538,"acs":112288,"articleLive":2,"columnArticles":636,"formTitle":"[178]分数排名","frequency":3.3833338447,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":186744,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4097431001809555,"acs":115028,"articleLive":2,"columnArticles":929,"formTitle":"[179]最大数","frequency":3.9160137554,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":280732,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.4869135392712359,"acs":82154,"articleLive":2,"columnArticles":471,"formTitle":"[180]连续出现的数字","frequency":3.5536195641,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":168724,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7032064365637642,"acs":154351,"articleLive":2,"columnArticles":639,"formTitle":"[181]超过经理收入的员工","frequency":3.4399420522,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":219496,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7971228226389894,"acs":171882,"articleLive":2,"columnArticles":550,"formTitle":"[182]查找重复的电子邮箱","frequency":3.0569589725,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":215628,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6776612622742281,"acs":142235,"articleLive":2,"columnArticles":521,"formTitle":"[183]从不订购的客户","frequency":2.2417313711,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":209891,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.4739582310065031,"acs":96496,"articleLive":2,"columnArticles":632,"formTitle":"[184]部门工资最高的员工","frequency":3.752924068,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":203596,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.4918815593310405,"acs":66647,"articleLive":2,"columnArticles":595,"formTitle":"[185]部门工资前三高的所有员工","frequency":3.6770577174,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":135494,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7529830437513083,"acs":7194,"articleLive":2,"columnArticles":105,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.3041926436,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"","submitted":9554,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.48186971225012937,"acs":40040,"articleLive":2,"columnArticles":265,"formTitle":"[187]重复的DNA序列","frequency":1.6719059297,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"","submitted":83093,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3879939412634031,"acs":84275,"articleLive":2,"columnArticles":660,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":2.4188715691,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":217207,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.45318825983535765,"acs":315884,"articleLive":2,"columnArticles":1568,"formTitle":"[189]旋转数组","frequency":3.1448684187,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":697026,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6950168498977957,"acs":125805,"articleLive":2,"columnArticles":790,"formTitle":"[190]颠倒二进制位","frequency":2.454311139,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":181010,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7469167955180235,"acs":182114,"articleLive":2,"columnArticles":1150,"formTitle":"[191]位1的个数","frequency":2.9295604781,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":243821,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.35518725858871175,"acs":20874,"articleLive":2,"columnArticles":167,"formTitle":"[192]统计词频","frequency":2.7966391064,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":58769,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3235722291647879,"acs":25116,"articleLive":2,"columnArticles":136,"formTitle":"[193]有效电话号码","frequency":1.9286395831,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":77621,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34590141041753947,"acs":9908,"articleLive":2,"columnArticles":67,"formTitle":"[194]转置文件","frequency":1.4623744168,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":28644,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4357544029073166,"acs":34293,"articleLive":2,"columnArticles":139,"formTitle":"[195]第十行","frequency":2.5693047726,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":78698,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6646611867099537,"acs":96223,"articleLive":2,"columnArticles":363,"formTitle":"[196]删除重复的电子邮箱","frequency":2.88897358,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":144770,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5334424682005293,"acs":89286,"articleLive":2,"columnArticles":484,"formTitle":"[197]上升的温度","frequency":2.7906806785,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":167377,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5102695882098577,"acs":359911,"articleLive":2,"columnArticles":2517,"formTitle":"[198]打家劫舍","frequency":3.8663212861,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":705335,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6518934137157467,"acs":131056,"articleLive":2,"columnArticles":1506,"formTitle":"[199]二叉树的右视图","frequency":3.9977928924,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":201039,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5504433753596347,"acs":302860,"articleLive":2,"columnArticles":2018,"formTitle":"[200]岛屿数量","frequency":4.3177199966,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":550211,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5218534629164977,"acs":47628,"articleLive":2,"columnArticles":312,"formTitle":"[201]数字范围按位与","frequency":1.7815319859,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":91267,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6177482423191756,"acs":160352,"articleLive":2,"columnArticles":1316,"formTitle":"[202]快乐数","frequency":2.7261910786,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":259575,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5124470007440564,"acs":216947,"articleLive":2,"columnArticles":1551,"formTitle":"[203]移除链表元素","frequency":2.8184362983,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":423355,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.3794445965264471,"acs":162175,"articleLive":2,"columnArticles":707,"formTitle":"[204]计数质数","frequency":2.6368067753,"frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","questionId":"204","status":"","submitted":427401,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5010710272228975,"acs":109241,"articleLive":2,"columnArticles":843,"formTitle":"[205]同构字符串","frequency":2.3650835995,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":218015,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7218433935946175,"acs":659819,"articleLive":2,"columnArticles":7148,"formTitle":"[206]反转链表","frequency":4.6527480212,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":914075,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5453296872751198,"acs":132616,"articleLive":2,"columnArticles":884,"formTitle":"[207]课程表","frequency":3.3833338447,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":243185,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.716202140083962,"acs":136140,"articleLive":2,"columnArticles":921,"formTitle":"[208]实现 Trie (前缀树)","frequency":3.1161115248,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":190086,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.46849179464117024,"acs":176055,"articleLive":2,"columnArticles":1256,"formTitle":"[209]长度最小的子数组","frequency":2.7503513819,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":375791,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.540872376895907,"acs":83303,"articleLive":2,"columnArticles":645,"formTitle":"[210]课程表 II","frequency":2.3598690077,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":154016,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4814131248585308,"acs":27649,"articleLive":2,"columnArticles":302,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":1.6719059297,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":57433,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.45123603115475786,"acs":39975,"articleLive":2,"columnArticles":387,"formTitle":"[212]单词搜索 II","frequency":2.0263098659,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"","submitted":88590,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4318856840192843,"acs":151664,"articleLive":2,"columnArticles":1425,"formTitle":"[213]打家劫舍 II","frequency":3.522616461,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":351167,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3706609139046872,"acs":30240,"articleLive":2,"columnArticles":296,"formTitle":"[214]最短回文串","frequency":2.866869569,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":81584,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6469962080472786,"acs":409667,"articleLive":2,"columnArticles":2176,"formTitle":"[215]数组中的第K个最大元素","frequency":4.3425287063,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":633183,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7397995934243593,"acs":92435,"articleLive":2,"columnArticles":974,"formTitle":"[216]组合总和 III","frequency":3.0391440768,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":124946,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5614705477081086,"acs":334130,"articleLive":2,"columnArticles":1547,"formTitle":"[217]存在重复元素","frequency":3.1848609523,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":595098,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5422968076860681,"acs":30085,"articleLive":2,"columnArticles":263,"formTitle":"[218]天际线问题","frequency":2.9828070182,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":55477,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.42555553761183423,"acs":105405,"articleLive":2,"columnArticles":835,"formTitle":"[219]存在重复元素 II","frequency":2.088441647,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"","submitted":247688,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.287007839580907,"acs":62347,"articleLive":2,"columnArticles":411,"formTitle":"[220]存在重复元素 III","frequency":3.0266160384,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":217231,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4716428779493155,"acs":129532,"articleLive":2,"columnArticles":937,"formTitle":"[221]最大正方形","frequency":3.5927552549,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":274640,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7796257648678961,"acs":109829,"articleLive":2,"columnArticles":843,"formTitle":"[222]完全二叉树的节点个数","frequency":1.9286395831,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":140874,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.45926797693303517,"acs":19512,"articleLive":2,"columnArticles":245,"formTitle":"[223]矩形面积","frequency":2.3372602337,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"","submitted":42485,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.41768604571860796,"acs":67369,"articleLive":2,"columnArticles":632,"formTitle":"[224]基本计算器","frequency":4.313522331,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":161291,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6754404551281372,"acs":127511,"articleLive":2,"columnArticles":4712,"formTitle":"[225]用队列实现栈","frequency":2.7000389606,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":188782,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7872506324913939,"acs":284721,"articleLive":2,"columnArticles":1762,"formTitle":"[226]翻转二叉树","frequency":3.722746073,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":361665,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43680006012906275,"acs":81361,"articleLive":2,"columnArticles":678,"formTitle":"[227]基本计算器 II","frequency":3.6908450173,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":186266,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5816922147949617,"acs":54910,"articleLive":2,"columnArticles":619,"formTitle":"[228]汇总区间","frequency":1.1363444987,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":94397,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.4628157498768293,"acs":34757,"articleLive":2,"columnArticles":299,"formTitle":"[229]求众数 II","frequency":1.8127357656,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":75099,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7402197274556429,"acs":129497,"articleLive":2,"columnArticles":801,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":1.9133230025,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":174944,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.503388848614545,"acs":159015,"articleLive":2,"columnArticles":1153,"formTitle":"[231]2 的幂","frequency":2.2199629887,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":315889,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6907468927866186,"acs":148666,"articleLive":2,"columnArticles":1197,"formTitle":"[232]用栈实现队列","frequency":3.2701228939,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":215225,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47588382746996283,"acs":33033,"articleLive":2,"columnArticles":401,"formTitle":"[233]数字 1 的个数","frequency":2.088441647,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":69414,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.4917790358263444,"acs":292311,"articleLive":2,"columnArticles":1887,"formTitle":"[234]回文链表","frequency":3.7142933292,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":594395,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.665655462358057,"acs":161498,"articleLive":2,"columnArticles":923,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":2.4016357064,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":242615,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6790160449575413,"acs":240206,"articleLive":2,"columnArticles":1306,"formTitle":"[236]二叉树的最近公共祖先","frequency":3.5927552549,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":353756,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8479438027533954,"acs":201223,"articleLive":2,"columnArticles":991,"formTitle":"[237]删除链表中的节点","frequency":2.6497771258,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":237307,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7223353662564125,"acs":131231,"articleLive":2,"columnArticles":826,"formTitle":"[238]除自身以外数组的乘积","frequency":2.6745793369,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":181676,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4960547486279782,"acs":180052,"articleLive":2,"columnArticles":1258,"formTitle":"[239]滑动窗口最大值","frequency":3.434131967,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":362968,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.47332524688255284,"acs":157259,"articleLive":2,"columnArticles":705,"formTitle":"[240]搜索二维矩阵 II","frequency":3.0831585284,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":332243,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.73683030710603,"acs":29583,"articleLive":2,"columnArticles":266,"formTitle":"[241]为运算表达式设计优先级","frequency":2.5279119417,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":40149,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6433696856236374,"acs":273555,"articleLive":2,"columnArticles":1578,"formTitle":"[242]有效的字母异位词","frequency":2.7000389606,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":425191,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6564243614931238,"acs":8353,"articleLive":2,"columnArticles":95,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"","submitted":12725,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5470317479051103,"acs":4635,"articleLive":2,"columnArticles":55,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"","submitted":8473,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6115011202389843,"acs":4094,"articleLive":2,"columnArticles":55,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"","submitted":6695,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4741235392320534,"acs":5396,"articleLive":2,"columnArticles":101,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"","submitted":11381,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5206812652068127,"acs":4922,"articleLive":2,"columnArticles":88,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"","submitted":9453,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4659111679766039,"acs":2549,"articleLive":2,"columnArticles":50,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"","submitted":5471,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.637309374630571,"acs":5391,"articleLive":2,"columnArticles":94,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"","submitted":8459,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6343104995513013,"acs":4241,"articleLive":2,"columnArticles":72,"formTitle":"[250]统计同值子树","frequency":0.3041926436,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"","submitted":6686,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5413150772170037,"acs":3400,"articleLive":2,"columnArticles":65,"formTitle":"[251]展开二维向量","frequency":0.8058212079,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"","submitted":6281,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5609287267944763,"acs":11089,"articleLive":2,"columnArticles":146,"formTitle":"[252]会议室","frequency":0.3041926436,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"","submitted":19769,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.4963951577747225,"acs":29606,"articleLive":2,"columnArticles":317,"formTitle":"[253]会议室 II","frequency":2.6274381477,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"","submitted":59642,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5688878349537586,"acs":4798,"articleLive":2,"columnArticles":69,"formTitle":"[254]因子的组合","frequency":0.8353654542,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"","submitted":8434,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4733608524527215,"acs":4931,"articleLive":2,"columnArticles":54,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"","submitted":10417,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6293372606774669,"acs":10683,"articleLive":2,"columnArticles":164,"formTitle":"[256]粉刷房子","frequency":0.3041926436,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"","submitted":16975,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6797933433089336,"acs":134474,"articleLive":2,"columnArticles":998,"formTitle":"[257]二叉树的所有路径","frequency":2.9295604781,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":197816,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6913734579166363,"acs":75769,"articleLive":2,"columnArticles":623,"formTitle":"[258]各位相加","frequency":2.3342186838,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":109592,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.567721626680279,"acs":6673,"articleLive":2,"columnArticles":81,"formTitle":"[259]较小的三数之和","frequency":0.2507039587,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"","submitted":11754,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7253568602163144,"acs":49494,"articleLive":2,"columnArticles":420,"formTitle":"[260]只出现一次的数字 III","frequency":2.4817853945,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":68234,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.4965642178910545,"acs":7949,"articleLive":2,"columnArticles":113,"formTitle":"[261]以图判树","frequency":1.2623366327,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"","submitted":16008,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.4384674550523988,"acs":36484,"articleLive":2,"columnArticles":354,"formTitle":"[262]行程和用户","frequency":3.0643251627,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":83208,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5154616638181168,"acs":103748,"articleLive":2,"columnArticles":815,"formTitle":"[263]丑数","frequency":2.6406390786,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":201272,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5778270024220148,"acs":94952,"articleLive":2,"columnArticles":590,"formTitle":"[264]丑数 II","frequency":2.9369904848,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":164326,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5788723019872587,"acs":6088,"articleLive":2,"columnArticles":126,"formTitle":"[265]粉刷房子 II","frequency":0.2255770086,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"","submitted":10517,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6690088363675077,"acs":6284,"articleLive":2,"columnArticles":98,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"","submitted":9393,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44387965379859873,"acs":3231,"articleLive":2,"columnArticles":74,"formTitle":"[267]回文排列 II","frequency":0.3041926436,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"","submitted":7279,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6223358651679585,"acs":144451,"articleLive":2,"columnArticles":1048,"formTitle":"[268]丢失的数字","frequency":1.6398929527,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":232111,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3402508551881414,"acs":5968,"articleLive":2,"columnArticles":99,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"","submitted":17540,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5496201615820572,"acs":9116,"articleLive":2,"columnArticles":132,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.8353654542,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"","submitted":16586,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5501964207769533,"acs":2521,"articleLive":2,"columnArticles":44,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"","submitted":4582,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6431840796019901,"acs":3232,"articleLive":2,"columnArticles":70,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.4610570293,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"","submitted":5025,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.30853748291452004,"acs":11738,"articleLive":2,"columnArticles":156,"formTitle":"[273]整数转换英文表示","frequency":1.8450487545,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"","submitted":38044,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4403947212787888,"acs":52126,"articleLive":2,"columnArticles":556,"formTitle":"[274]H 指数","frequency":2.76335124,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":118362,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.463435120203076,"acs":49658,"articleLive":2,"columnArticles":405,"formTitle":"[275]H 指数 II","frequency":1.5502271905,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":107152,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.48451677949013394,"acs":6728,"articleLive":2,"columnArticles":120,"formTitle":"[276]栅栏涂色","frequency":1.229022426,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"","submitted":13886,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5682250724038064,"acs":6867,"articleLive":2,"columnArticles":81,"formTitle":"[277]搜寻名人","frequency":0.3327171103,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"","submitted":12085,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45488141218289585,"acs":158170,"articleLive":2,"columnArticles":916,"formTitle":"[278]第一个错误的版本","frequency":3.2459709292,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":347717,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6298433526565895,"acs":190464,"articleLive":2,"columnArticles":1139,"formTitle":"[279]完全平方数","frequency":3.4850215816,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":302399,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6864384971693258,"acs":5335,"articleLive":2,"columnArticles":69,"formTitle":"[280]摆动排序","frequency":0.8660803995,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"","submitted":7772,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7554988842843481,"acs":2370,"articleLive":2,"columnArticles":59,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"","submitted":3137,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.3879592990390051,"acs":6863,"articleLive":2,"columnArticles":70,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":17690,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6390654492529507,"acs":449626,"articleLive":2,"columnArticles":3144,"formTitle":"[283]移动零","frequency":3.4841579193,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":703568,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7329792009576538,"acs":9797,"articleLive":2,"columnArticles":95,"formTitle":"[284]顶端迭代器","frequency":0.8353654542,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"","submitted":13366,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6359165677463117,"acs":7500,"articleLive":2,"columnArticles":95,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"","submitted":11794,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5064790818215475,"acs":10944,"articleLive":2,"columnArticles":138,"formTitle":"[286]墙与门","frequency":0.3938048023,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"ac","submitted":21608,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6629940007936693,"acs":170412,"articleLive":2,"columnArticles":1178,"formTitle":"[287]寻找重复数","frequency":2.9277755284,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":257034,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.42390035033086804,"acs":3267,"articleLive":2,"columnArticles":52,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"","submitted":7707,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7530314097881665,"acs":51545,"articleLive":2,"columnArticles":805,"formTitle":"[289]生命游戏","frequency":0.8660803995,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":68450,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45706616888311746,"acs":78843,"articleLive":2,"columnArticles":1048,"formTitle":"[290]单词规律","frequency":1.2882112974,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":172498,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5357946870778928,"acs":2380,"articleLive":2,"columnArticles":50,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"","submitted":4442,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.6965212854930732,"acs":84114,"articleLive":2,"columnArticles":552,"formTitle":"[292]Nim 游戏","frequency":2.0568559182,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"","submitted":120763,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7106299212598425,"acs":4693,"articleLive":2,"columnArticles":78,"formTitle":"[293]翻转游戏","frequency":0.2768834642,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"","submitted":6604,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5865815798551225,"acs":3401,"articleLive":2,"columnArticles":49,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"","submitted":5798,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5214182822868207,"acs":44161,"articleLive":2,"columnArticles":350,"formTitle":"[295]数据流的中位数","frequency":3.0643251627,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":84694,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6185622317596566,"acs":2306,"articleLive":2,"columnArticles":41,"formTitle":"[296]最佳的碰头地点","frequency":1.2970141712,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"","submitted":3728,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5570693651421788,"acs":98540,"articleLive":2,"columnArticles":715,"formTitle":"[297]二叉树的序列化与反序列化","frequency":2.7906806785,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":176890,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5797709923664122,"acs":4557,"articleLive":2,"columnArticles":78,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"","submitted":7860,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5038054125275221,"acs":29060,"articleLive":2,"columnArticles":339,"formTitle":"[299]猜数字游戏","frequency":1.1969752486,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":57681,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5101967628195715,"acs":330057,"articleLive":2,"columnArticles":1876,"formTitle":"[300]最长递增子序列","frequency":3.7798650543,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":646921,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5220690245782307,"acs":30481,"articleLive":2,"columnArticles":217,"formTitle":"[301]删除无效的括号","frequency":2.4817853945,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":58385,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.672107363075807,"acs":1853,"articleLive":2,"columnArticles":32,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"","submitted":2757,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7235048183499305,"acs":125981,"articleLive":2,"columnArticles":775,"formTitle":"[303]区域和检索 - 数组不可变","frequency":3.0162158377,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":174126,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.53815337141001,"acs":59643,"articleLive":2,"columnArticles":544,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":2.8228926337,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":110829,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3767428625628379,"acs":3972,"articleLive":2,"columnArticles":60,"formTitle":"[305]岛屿数量 II","frequency":0.3041926436,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"","submitted":10543,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.336966336966337,"acs":16046,"articleLive":2,"columnArticles":238,"formTitle":"[306]累加数","frequency":1.9133230025,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":47619,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5437221343305049,"acs":22683,"articleLive":2,"columnArticles":220,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.8660803995,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":41718,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6043103448275862,"acs":2103,"articleLive":2,"columnArticles":39,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"","submitted":3480,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6039051448557012,"acs":108436,"articleLive":2,"columnArticles":878,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":3.4877037708,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":179558,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.37907127629993514,"acs":20449,"articleLive":2,"columnArticles":203,"formTitle":"[310]最小高度树","frequency":2.0976668046,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":53945,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7633989922125516,"acs":3333,"articleLive":2,"columnArticles":43,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.8980524322,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"","submitted":4366,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6821090350652674,"acs":53300,"articleLive":2,"columnArticles":364,"formTitle":"[312]戳气球","frequency":2.6324456694,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":78140,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6574833952025037,"acs":39497,"articleLive":2,"columnArticles":346,"formTitle":"[313]超级丑数","frequency":1.5920644034,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":60073,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5472394254842535,"acs":4153,"articleLive":2,"columnArticles":84,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"","submitted":7589,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4187361438121917,"acs":48730,"articleLive":2,"columnArticles":468,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":2.7595095142,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":116374,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47706428853475186,"acs":64033,"articleLive":2,"columnArticles":497,"formTitle":"[316]去除重复字母","frequency":2.756107456,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":134223,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48511576626240355,"acs":3960,"articleLive":2,"columnArticles":62,"formTitle":"[317]离建筑物最近的距离","frequency":0.3041926436,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"","submitted":8163,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6820469798657718,"acs":18699,"articleLive":2,"columnArticles":163,"formTitle":"[318]最大单词长度乘积","frequency":0.3041926436,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":27416,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5154870357393132,"acs":22068,"articleLive":2,"columnArticles":211,"formTitle":"[319]灯泡开关","frequency":0.8353654542,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":42810,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6704084069739671,"acs":2807,"articleLive":2,"columnArticles":44,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"","submitted":4187,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.4259691963404199,"acs":25887,"articleLive":2,"columnArticles":222,"formTitle":"[321]拼接最大数","frequency":1.6398929527,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":60772,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.44227632585975435,"acs":282006,"articleLive":2,"columnArticles":1727,"formTitle":"[322]零钱兑换","frequency":3.8229881842,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":637624,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6345141371465713,"acs":9762,"articleLive":2,"columnArticles":131,"formTitle":"[323]无向图中连通分量的数目","frequency":1.6719059297,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"","submitted":15385,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3767097443637393,"acs":23961,"articleLive":2,"columnArticles":161,"formTitle":"[324]摆动排序 II","frequency":1.8450487545,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"","submitted":63606,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5377717725095197,"acs":8756,"articleLive":2,"columnArticles":98,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":1.5791209144,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"","submitted":16282,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.48929474690194463,"acs":92669,"articleLive":2,"columnArticles":369,"formTitle":"[326]3的幂","frequency":1.1363444987,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"","submitted":189393,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.424665544431647,"acs":23966,"articleLive":2,"columnArticles":200,"formTitle":"[327]区间和的个数","frequency":1.7754180025,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":56435,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6567440619161996,"acs":123041,"articleLive":2,"columnArticles":1026,"formTitle":"[328]奇偶链表","frequency":2.9408897333,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":187350,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.48210727371233897,"acs":52501,"articleLive":2,"columnArticles":462,"formTitle":"[329]矩阵中的最长递增路径","frequency":2.667902519,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":108899,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5344193529851176,"acs":18601,"articleLive":2,"columnArticles":147,"formTitle":"[330]按要求补齐数组","frequency":1.6398929527,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":34806,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4798571319010003,"acs":43798,"articleLive":2,"columnArticles":493,"formTitle":"[331]验证二叉树的前序序列化","frequency":2.803436767,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":91273,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4484880534589683,"acs":37316,"articleLive":2,"columnArticles":313,"formTitle":"[332]重新安排行程","frequency":2.2417313711,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":83204,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46520302675050623,"acs":4365,"articleLive":2,"columnArticles":74,"formTitle":"[333]最大 BST 子树","frequency":0.8980524322,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"","submitted":9383,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4134642492587372,"acs":42531,"articleLive":2,"columnArticles":276,"formTitle":"[334]递增的三元子序列","frequency":0.2255770086,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":102865,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.3695045822818435,"acs":2782,"articleLive":2,"columnArticles":35,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":7529,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4015851315400532,"acs":21737,"articleLive":2,"columnArticles":185,"formTitle":"[336]回文对","frequency":1.6719059297,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":54128,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6091468672871628,"acs":122910,"articleLive":2,"columnArticles":893,"formTitle":"[337]打家劫舍 III","frequency":3.3554458131,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":201774,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7874381316807387,"acs":151459,"articleLive":2,"columnArticles":1321,"formTitle":"[338]比特位计数","frequency":3.3833338447,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":192344,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8094701240135288,"acs":3590,"articleLive":2,"columnArticles":57,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"","submitted":4435,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.49364774700667213,"acs":10802,"articleLive":2,"columnArticles":167,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":1.3709030133,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"","submitted":21882,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7270788285306621,"acs":49429,"articleLive":2,"columnArticles":478,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":3.4808452686,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":67983,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5151759975028002,"acs":84171,"articleLive":2,"columnArticles":750,"formTitle":"[342]4的幂","frequency":2.3043300274,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":163383,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6037747001696429,"acs":102146,"articleLive":2,"columnArticles":989,"formTitle":"[343]整数拆分","frequency":3.0508141824,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":169179,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7641985809253083,"acs":341421,"articleLive":2,"columnArticles":1816,"formTitle":"[344]反转字符串","frequency":3.3361886542,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":446770,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5383483179027435,"acs":104607,"articleLive":2,"columnArticles":1007,"formTitle":"[345]反转字符串中的元音字母","frequency":1.4308011549,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":194311,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7059288057344186,"acs":11621,"articleLive":2,"columnArticles":128,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"ac","submitted":16462,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6223027010713746,"acs":189704,"articleLive":2,"columnArticles":1402,"formTitle":"[347]前 K 个高频元素","frequency":3.7854931646,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"","submitted":304842,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6001822679338628,"acs":4610,"articleLive":2,"columnArticles":75,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"","submitted":7681,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.738143858745525,"acs":203507,"articleLive":2,"columnArticles":1433,"formTitle":"[349]两个数组的交集","frequency":3.3528715441,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":275701,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5491799197110927,"acs":231604,"articleLive":2,"columnArticles":1291,"formTitle":"[350]两个数组的交集 II","frequency":3.0745829488,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":421727,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.588796587337225,"acs":5245,"articleLive":2,"columnArticles":99,"formTitle":"[351]安卓系统手势解锁","frequency":0.966163858,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"","submitted":8908,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.5928942564246594,"acs":4222,"articleLive":2,"columnArticles":80,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"","submitted":7121,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4247916666666667,"acs":2039,"articleLive":2,"columnArticles":47,"formTitle":"[353]贪吃蛇","frequency":0.3625522588,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"","submitted":4800,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.45056063165177757,"acs":66423,"articleLive":2,"columnArticles":516,"formTitle":"[354]俄罗斯套娃信封问题","frequency":3.702190983,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":147423,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4067884693463256,"acs":25048,"articleLive":2,"columnArticles":414,"formTitle":"[355]设计推特","frequency":1.8127357656,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":61575,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.3520730850316233,"acs":1503,"articleLive":2,"columnArticles":39,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"","submitted":4269,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5193076187994092,"acs":23911,"articleLive":2,"columnArticles":369,"formTitle":"[357]计算各个位数不同的数字个数","frequency":2.1704854006,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":46044,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35185644587778053,"acs":4255,"articleLive":2,"columnArticles":58,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"","submitted":12093,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7241158585373659,"acs":4525,"articleLive":2,"columnArticles":52,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"","submitted":6249,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6057065827903841,"acs":2696,"articleLive":2,"columnArticles":59,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"","submitted":4451,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5652901785714286,"acs":3039,"articleLive":2,"columnArticles":59,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"","submitted":5376,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6962371721778792,"acs":3053,"articleLive":2,"columnArticles":59,"formTitle":"[362]敲击计数器","frequency":0.3625522588,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"","submitted":4385,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.49066748128914006,"acs":32124,"articleLive":2,"columnArticles":212,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":2.7332867038,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":65470,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7170590665014457,"acs":1736,"articleLive":2,"columnArticles":47,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"","submitted":2421,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3634860389754517,"acs":32753,"articleLive":2,"columnArticles":474,"formTitle":"[365]水壶问题","frequency":2.088441647,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":90108,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.764905021628738,"acs":4067,"articleLive":2,"columnArticles":117,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"","submitted":5317,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4391239073056154,"acs":72538,"articleLive":2,"columnArticles":572,"formTitle":"[367]有效的完全平方数","frequency":0.2014329097,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":165188,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4588636260700213,"acs":40525,"articleLive":2,"columnArticles":441,"formTitle":"[368]最大整除子集","frequency":3.4180836927,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":88316,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6161601817665436,"acs":4339,"articleLive":2,"columnArticles":117,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"","submitted":7042,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7174022066198595,"acs":2861,"articleLive":2,"columnArticles":43,"formTitle":"[370]区间加法","frequency":0.3041926436,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"","submitted":3988,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.5792626678098174,"acs":53375,"articleLive":2,"columnArticles":307,"formTitle":"[371]两整数之和","frequency":2.3372602337,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":92143,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5063080758480019,"acs":13404,"articleLive":2,"columnArticles":132,"formTitle":"[372]超级次方","frequency":0.3041926436,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":26474,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4279638366607014,"acs":18414,"articleLive":2,"columnArticles":184,"formTitle":"[373]查找和最小的K对数字","frequency":2.2022005323,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":43027,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5141271313037655,"acs":79846,"articleLive":2,"columnArticles":546,"formTitle":"[374]猜数字大小","frequency":1.6719059297,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":155304,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.4668951290923609,"acs":14033,"articleLive":2,"columnArticles":116,"formTitle":"[375]猜数字大小 II","frequency":1.6719059297,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":30056,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4615901278792588,"acs":70098,"articleLive":2,"columnArticles":767,"formTitle":"[376]摆动序列","frequency":1.5791209144,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"","submitted":151862,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5068075077569982,"acs":59782,"articleLive":2,"columnArticles":517,"formTitle":"[377]组合总和 Ⅳ","frequency":2.88897358,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":117958,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6389949665127501,"acs":76804,"articleLive":2,"columnArticles":547,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":2.5279119417,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":120195,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6455696202531646,"acs":2907,"articleLive":2,"columnArticles":65,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"","submitted":4503,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5019572511494967,"acs":32314,"articleLive":2,"columnArticles":199,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":1.6719059297,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":64376,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.4433196651289937,"acs":20758,"articleLive":2,"columnArticles":173,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.3041926436,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":46824,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6263068423289417,"acs":14737,"articleLive":2,"columnArticles":117,"formTitle":"[382]链表随机节点","frequency":1.4951320132,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":23530,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.5937334354202249,"acs":60486,"articleLive":2,"columnArticles":661,"formTitle":"[383]赎金信","frequency":0.7234701728,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":101874,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5748443486590038,"acs":48011,"articleLive":2,"columnArticles":187,"formTitle":"[384]打乱数组","frequency":2.7000389606,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":83520,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41460417763735297,"acs":7086,"articleLive":2,"columnArticles":82,"formTitle":"[385]迷你语法分析器","frequency":0.2507039587,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17091,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7459909282474374,"acs":20887,"articleLive":2,"columnArticles":227,"formTitle":"[386]字典序排数","frequency":2.6656476758,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":27999,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5299759214197445,"acs":207997,"articleLive":2,"columnArticles":1128,"formTitle":"[387]字符串中的第一个唯一字符","frequency":2.9408897333,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":392465,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5235986811116344,"acs":5558,"articleLive":2,"columnArticles":101,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":10615,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6925052799817342,"acs":97056,"articleLive":2,"columnArticles":958,"formTitle":"[389]找不同","frequency":1.1363444987,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":140152,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.4665928131274666,"acs":6739,"articleLive":2,"columnArticles":92,"formTitle":"[390]消除游戏","frequency":1.7051051014,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":14443,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.3538211382113821,"acs":4352,"articleLive":2,"columnArticles":64,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":12300,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5142137406274391,"acs":139011,"articleLive":2,"columnArticles":1515,"formTitle":"[392]判断子序列","frequency":2.7906806785,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"","submitted":270337,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3911466158525413,"acs":10674,"articleLive":2,"columnArticles":125,"formTitle":"[393]UTF-8 编码验证","frequency":1.7051051014,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":27289,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5510319932461937,"acs":113571,"articleLive":2,"columnArticles":1238,"formTitle":"[394]字符串解码","frequency":4.1713040485,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":206106,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5201302452602279,"acs":49519,"articleLive":2,"columnArticles":418,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":3.1102258312,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":95205,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.42259146040824375,"acs":8571,"articleLive":2,"columnArticles":141,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":20282,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37800229741019215,"acs":14479,"articleLive":2,"columnArticles":177,"formTitle":"[397]整数替换","frequency":1.1969752486,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":38304,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6521153846153847,"acs":13564,"articleLive":2,"columnArticles":114,"formTitle":"[398]随机数索引","frequency":1.9925912299,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":20800,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.592078128682536,"acs":40195,"articleLive":2,"columnArticles":510,"formTitle":"[399]除法求值","frequency":1.4308011549,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":67888,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4128438271040848,"acs":18071,"articleLive":2,"columnArticles":188,"formTitle":"[400]第 N 位数字","frequency":2.3043300274,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":43772,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6138089516721686,"acs":52620,"articleLive":2,"columnArticles":652,"formTitle":"[401]二进制手表","frequency":2.4498082495,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":85727,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3279282357966681,"acs":76768,"articleLive":2,"columnArticles":563,"formTitle":"[402]移掉 K 位数字","frequency":3.3497736482,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":234100,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45622001722087824,"acs":44507,"articleLive":2,"columnArticles":450,"formTitle":"[403]青蛙过河","frequency":3.300812821,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":97556,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5815100458056681,"acs":94325,"articleLive":2,"columnArticles":1072,"formTitle":"[404]左叶子之和","frequency":2.76335124,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":162207,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5229902404668477,"acs":25990,"articleLive":2,"columnArticles":267,"formTitle":"[405]数字转换为十六进制数","frequency":2.2350262367,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"","submitted":49695,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.735009645966943,"acs":112774,"articleLive":2,"columnArticles":765,"formTitle":"[406]根据身高重建队列","frequency":2.7530736572,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":153432,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.48225448679169186,"acs":9566,"articleLive":2,"columnArticles":124,"formTitle":"[407]接雨水 II","frequency":2.2350262367,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":19836,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3247528628755995,"acs":3318,"articleLive":2,"columnArticles":76,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"","submitted":10217,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5551822547507385,"acs":88903,"articleLive":2,"columnArticles":1265,"formTitle":"[409]最长回文串","frequency":3.1475849259,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":160133,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5611216988837463,"acs":37098,"articleLive":2,"columnArticles":300,"formTitle":"[410]分割数组的最大值","frequency":3.4841579193,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":66114,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.49510086455331415,"acs":859,"articleLive":2,"columnArticles":21,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"","submitted":1735,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6722892254385882,"acs":70626,"articleLive":2,"columnArticles":356,"formTitle":"[412]Fizz Buzz","frequency":1.1969752486,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"","submitted":105053,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6858515428832306,"acs":66101,"articleLive":2,"columnArticles":868,"formTitle":"[413]等差数列划分","frequency":1.8127357656,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":96378,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.36457496559497343,"acs":58546,"articleLive":2,"columnArticles":808,"formTitle":"[414]第三大的数","frequency":1.8127357656,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":160587,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5350963867092899,"acs":138095,"articleLive":2,"columnArticles":1021,"formTitle":"[415]字符串相加","frequency":4.3303658782,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":258075,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.505943322502365,"acs":159913,"articleLive":2,"columnArticles":922,"formTitle":"[416]分割等和子集","frequency":3.21607972,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":316069,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4759278302327755,"acs":25455,"articleLive":2,"columnArticles":295,"formTitle":"[417]太平洋大西洋水流问题","frequency":2.8562159835,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":53485,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.35978279908915745,"acs":2054,"articleLive":2,"columnArticles":32,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"","submitted":5709,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7564658001837994,"acs":11524,"articleLive":2,"columnArticles":149,"formTitle":"[419]甲板上的战舰","frequency":0.7773697867,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":15234,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20551242236024844,"acs":2647,"articleLive":2,"columnArticles":49,"formTitle":"[420]强密码检验器","frequency":1.0018055493,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":12880,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6222811977153406,"acs":32358,"articleLive":2,"columnArticles":296,"formTitle":"[421]数组中两个数的最大异或值","frequency":2.890728767,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":51999,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4264133669031815,"acs":1863,"articleLive":2,"columnArticles":44,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"","submitted":4369,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.569508639692811,"acs":8009,"articleLive":2,"columnArticles":133,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14063,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.52999732405673,"acs":49515,"articleLive":2,"columnArticles":440,"formTitle":"[424]替换后的最长重复字符","frequency":3.1206394927,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"","submitted":93425,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6110183639398998,"acs":1464,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"","submitted":2396,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6686284813452443,"acs":6362,"articleLive":2,"columnArticles":111,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":1.4003342134,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"","submitted":9515,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6129131912264443,"acs":3968,"articleLive":2,"columnArticles":64,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6474,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6472898664571878,"acs":2472,"articleLive":2,"columnArticles":52,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"","submitted":3819,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6975770228379832,"acs":55133,"articleLive":2,"columnArticles":440,"formTitle":"[429]N 叉树的层序遍历","frequency":1.0529937962,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":79035,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5406820761531318,"acs":20959,"articleLive":2,"columnArticles":300,"formTitle":"[430]扁平化多级双向链表","frequency":1.4623744168,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":38764,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7260018639328985,"acs":779,"articleLive":2,"columnArticles":27,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"","submitted":1073,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.3774535966316788,"acs":6365,"articleLive":2,"columnArticles":84,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.9313777419,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":16863,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5331677899964526,"acs":15030,"articleLive":2,"columnArticles":205,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":28190,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3740330105854613,"acs":37278,"articleLive":2,"columnArticles":510,"formTitle":"[434]字符串中的单词数","frequency":1.4308011549,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"","submitted":99665,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5101980215314208,"acs":87626,"articleLive":2,"columnArticles":795,"formTitle":"[435]无重叠区间","frequency":3.0391440768,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"","submitted":171749,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4859664607237423,"acs":8259,"articleLive":2,"columnArticles":138,"formTitle":"[436]寻找右区间","frequency":0.3327171103,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":16995,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5667972882007886,"acs":94306,"articleLive":2,"columnArticles":785,"formTitle":"[437]路径总和 III","frequency":2.5774867851,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"","submitted":166384,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5157184011523227,"acs":85929,"articleLive":2,"columnArticles":734,"formTitle":"[438]找到字符串中所有字母异位词","frequency":2.4016357064,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":166620,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5882229673093042,"acs":2807,"articleLive":2,"columnArticles":66,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"","submitted":4772,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.37952253855278767,"acs":15357,"articleLive":2,"columnArticles":117,"formTitle":"[440]字典序的第K小数字","frequency":3.4193478195,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":40464,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4258485171590598,"acs":45131,"articleLive":2,"columnArticles":450,"formTitle":"[441]排列硬币","frequency":1.1969752486,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":105979,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6959980918956675,"acs":40853,"articleLive":2,"columnArticles":400,"formTitle":"[442]数组中重复的数据","frequency":3.0989466681,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":58697,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.47590614901216555,"acs":53163,"articleLive":2,"columnArticles":665,"formTitle":"[443]压缩字符串","frequency":1.9940975038,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"","submitted":111709,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2479169941833045,"acs":3154,"articleLive":2,"columnArticles":50,"formTitle":"[444]序列重建","frequency":0.8980524322,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"","submitted":12722,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5874247750700113,"acs":78870,"articleLive":2,"columnArticles":903,"formTitle":"[445]两数相加 II","frequency":3.3833338447,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":134264,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5515347334410339,"acs":18777,"articleLive":2,"columnArticles":167,"formTitle":"[446]等差数列划分 II - 子序列","frequency":1.320942574,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":34045,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6040592970061961,"acs":20863,"articleLive":2,"columnArticles":162,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"","submitted":34538,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6469196083804589,"acs":129840,"articleLive":2,"columnArticles":1029,"formTitle":"[448]找到所有数组中消失的数字","frequency":2.9558184688,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":200705,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5538278886293133,"acs":14461,"articleLive":2,"columnArticles":132,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.3041926436,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":26111,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4837399806218621,"acs":54919,"articleLive":2,"columnArticles":574,"formTitle":"[450]删除二叉搜索树中的节点","frequency":2.2472531963,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":113530,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7108673706038035,"acs":78162,"articleLive":2,"columnArticles":907,"formTitle":"[451]根据字符出现频率排序","frequency":2.8687884398,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":109953,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5093350931817157,"acs":90299,"articleLive":2,"columnArticles":793,"formTitle":"[452]用最少数量的箭引爆气球","frequency":2.3650835995,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":177288,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5540520382722101,"acs":26000,"articleLive":2,"columnArticles":289,"formTitle":"[453]最小操作次数使数组元素相等","frequency":1.4003342134,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":46927,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.5993395266072988,"acs":74773,"articleLive":2,"columnArticles":464,"formTitle":"[454]四数相加 II","frequency":2.667902519,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"","submitted":124759,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5774896424735307,"acs":143013,"articleLive":2,"columnArticles":1172,"formTitle":"[455]分发饼干","frequency":2.7854150142,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"","submitted":247646,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.36215382596141227,"acs":55185,"articleLive":2,"columnArticles":441,"formTitle":"[456]132 模式","frequency":3.5073314863,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":152380,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43503362616443275,"acs":27880,"articleLive":2,"columnArticles":329,"formTitle":"[457]环形数组是否存在循环","frequency":1.4748288085,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":64087,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6075233336475913,"acs":6444,"articleLive":2,"columnArticles":59,"formTitle":"[458]可怜的小猪","frequency":0.8058212079,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":10607,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5114896775064094,"acs":75813,"articleLive":2,"columnArticles":615,"formTitle":"[459]重复的子字符串","frequency":2.5599501674,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":148220,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4397679619793123,"acs":31461,"articleLive":2,"columnArticles":386,"formTitle":"[460]LFU 缓存","frequency":3.0508141824,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":71540,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8115007864296095,"acs":163037,"articleLive":2,"columnArticles":1311,"formTitle":"[461]汉明距离","frequency":2.7982532597,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":200908,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6028028933092224,"acs":13334,"articleLive":2,"columnArticles":122,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":1.8450487545,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":22120,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7150474792067156,"acs":74021,"articleLive":2,"columnArticles":882,"formTitle":"[463]岛屿的周长","frequency":1.8127357656,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":103519,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.35830895857424666,"acs":10535,"articleLive":2,"columnArticles":105,"formTitle":"[464]我能赢吗","frequency":1.8785489841,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":29402,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5285864608909154,"acs":1507,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"","submitted":2851,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37361274317796056,"acs":11446,"articleLive":2,"columnArticles":178,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":30636,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44013580181422735,"acs":8297,"articleLive":2,"columnArticles":109,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.8353654542,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":18851,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.2478314611614694,"acs":22857,"articleLive":2,"columnArticles":286,"formTitle":"[468]验证IP地址","frequency":2.4817853945,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":92228,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4382520582647245,"acs":1384,"articleLive":2,"columnArticles":20,"formTitle":"[469]凸多边形","frequency":1.229022426,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"","submitted":3158,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5558229480017189,"acs":32335,"articleLive":2,"columnArticles":155,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":3.1302840977,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"","submitted":58175,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6193152784874808,"acs":1212,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":0.6036237946,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"","submitted":1957,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.4112961622013034,"acs":6248,"articleLive":2,"columnArticles":78,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":15191,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4196822120449805,"acs":19519,"articleLive":2,"columnArticles":171,"formTitle":"[473]火柴拼正方形","frequency":1.9600604803,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":46509,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6097556798232469,"acs":71203,"articleLive":2,"columnArticles":577,"formTitle":"[474]一和零","frequency":3.1779767175,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":116773,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.32937540936801973,"acs":19612,"articleLive":2,"columnArticles":227,"formTitle":"[475]供暖器","frequency":1.4623744168,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":59543,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7011568983650445,"acs":36667,"articleLive":2,"columnArticles":460,"formTitle":"[476]数字的补数","frequency":0.2507039587,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":52295,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6035684503673867,"acs":38361,"articleLive":2,"columnArticles":327,"formTitle":"[477]汉明距离总和","frequency":2.3043300274,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":63557,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43590108015918133,"acs":6134,"articleLive":2,"columnArticles":48,"formTitle":"[478]在圆内随机生成点","frequency":1.4951320132,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":14072,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.4132394366197183,"acs":2934,"articleLive":2,"columnArticles":23,"formTitle":"[479]最大回文数乘积","frequency":0.4610570293,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","submitted":7100,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4484825777444736,"acs":28728,"articleLive":2,"columnArticles":400,"formTitle":"[480]滑动窗口中位数","frequency":2.1901811569,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":64056,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5343250577947533,"acs":5316,"articleLive":2,"columnArticles":93,"formTitle":"[481]神奇字符串","frequency":0.2768834642,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":9949,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4250334981287252,"acs":18398,"articleLive":2,"columnArticles":217,"formTitle":"[482]密钥格式化","frequency":0.7499407495,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"","submitted":43286,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5897285227406276,"acs":15054,"articleLive":2,"columnArticles":114,"formTitle":"[483]最小好进制","frequency":1.5502271905,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":25527,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6419294990723562,"acs":1384,"articleLive":2,"columnArticles":33,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"","submitted":2156,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6059039867126771,"acs":117466,"articleLive":2,"columnArticles":950,"formTitle":"[485]最大连续 1 的个数","frequency":2.4188715691,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":193869,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5881872546695118,"acs":44654,"articleLive":2,"columnArticles":394,"formTitle":"[486]预测赢家","frequency":2.0263098659,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":75918,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5785756327251325,"acs":4915,"articleLive":2,"columnArticles":97,"formTitle":"[487]最大连续1的个数 II","frequency":1.8127357656,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"","submitted":8495,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3894972330154245,"acs":3308,"articleLive":2,"columnArticles":69,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":8493,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.718409843823947,"acs":1518,"articleLive":2,"columnArticles":23,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"","submitted":2113,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4830515018145317,"acs":6256,"articleLive":2,"columnArticles":73,"formTitle":"[490]迷宫","frequency":0.3625522588,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"","submitted":12951,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5477155719153382,"acs":44044,"articleLive":2,"columnArticles":376,"formTitle":"[491]递增子序列","frequency":2.5279119417,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":80414,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5495685860186652,"acs":18726,"articleLive":2,"columnArticles":173,"formTitle":"[492]构造矩形","frequency":0.2768834642,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":34074,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.34396512771443,"acs":25882,"articleLive":2,"columnArticles":264,"formTitle":"[493]翻转对","frequency":1.9133230025,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":75246,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.5004264047066443,"acs":139071,"articleLive":2,"columnArticles":986,"formTitle":"[494]目标和","frequency":3.5726656859,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":277905,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5411697667792746,"acs":26592,"articleLive":2,"columnArticles":406,"formTitle":"[495]提莫攻击","frequency":1.1969752486,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":49138,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6869958799976789,"acs":94712,"articleLive":2,"columnArticles":984,"formTitle":"[496]下一个更大元素 I","frequency":2.6274381477,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":137864,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.403529240192504,"acs":2767,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":6857,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4591465693992909,"acs":40533,"articleLive":2,"columnArticles":420,"formTitle":"[498]对角线遍历","frequency":2.667902519,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":88279,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.367827868852459,"acs":2513,"articleLive":2,"columnArticles":47,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"","submitted":6832,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7076240360832242,"acs":29181,"articleLive":2,"columnArticles":441,"formTitle":"[500]键盘行","frequency":0.8058212079,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":41238,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5105266626031663,"acs":61981,"articleLive":2,"columnArticles":516,"formTitle":"[501]二叉搜索树中的众数","frequency":2.2119282355,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":121406,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4169751116783663,"acs":6534,"articleLive":2,"columnArticles":89,"formTitle":"[502]IPO","frequency":1.5291604751,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"","submitted":15670,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6333127698951264,"acs":97527,"articleLive":2,"columnArticles":943,"formTitle":"[503]下一个更大元素 II","frequency":3.2029905279,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":153995,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5050644889948128,"acs":28821,"articleLive":2,"columnArticles":305,"formTitle":"[504]七进制数","frequency":1.1969752486,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":57064,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.48233038078714274,"acs":5282,"articleLive":2,"columnArticles":64,"formTitle":"[505]迷宫 II","frequency":0.8980524322,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"","submitted":10951,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.562755333635951,"acs":19836,"articleLive":2,"columnArticles":268,"formTitle":"[506]相对名次","frequency":0.7499407495,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":35248,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4082386073455808,"acs":27977,"articleLive":2,"columnArticles":221,"formTitle":"[507]完美数","frequency":1.1661086006,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":68531,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6736023945157864,"acs":13953,"articleLive":2,"columnArticles":197,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.8660803995,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":20714,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6777471258628652,"acs":217180,"articleLive":2,"columnArticles":1364,"formTitle":"[509]斐波那契数","frequency":3.1826182458,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":320444,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6123529411764705,"acs":3123,"articleLive":2,"columnArticles":53,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.3938048023,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"","submitted":5100,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7337033636591269,"acs":17581,"articleLive":2,"columnArticles":99,"formTitle":"[511]游戏玩法分析 I","frequency":1.8450487545,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"","submitted":23962,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.537329330880217,"acs":16647,"articleLive":2,"columnArticles":142,"formTitle":"[512]游戏玩法分析 II","frequency":0.2768834642,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"","submitted":30981,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7304943324937028,"acs":46401,"articleLive":2,"columnArticles":525,"formTitle":"[513]找树左下角的值","frequency":0.2255770086,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":63520,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5018233334207833,"acs":19128,"articleLive":2,"columnArticles":234,"formTitle":"[514]自由之路","frequency":2.4996909759,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":38117,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6430972149047108,"acs":35398,"articleLive":2,"columnArticles":389,"formTitle":"[515]在每个树行中找最大值","frequency":1.7051051014,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":55043,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6510232569530044,"acs":79751,"articleLive":2,"columnArticles":588,"formTitle":"[516]最长回文子序列","frequency":1.7544951456,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":122501,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.4399756246191347,"acs":3610,"articleLive":2,"columnArticles":45,"formTitle":"[517]超级洗衣机","frequency":0.2768834642,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"","submitted":8205,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6500775337636346,"acs":98098,"articleLive":2,"columnArticles":642,"formTitle":"[518]零钱兑换 II","frequency":3.4935167268,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":150902,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.39493316754740443,"acs":2541,"articleLive":2,"columnArticles":36,"formTitle":"[519]随机翻转矩阵","frequency":0.9313777419,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6434,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5627873710023501,"acs":38556,"articleLive":2,"columnArticles":618,"formTitle":"[520]检测大写字母","frequency":0.8058212079,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":68509,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7120397664874862,"acs":24638,"articleLive":2,"columnArticles":241,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.8353654542,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":34602,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.35794569330069,"acs":6433,"articleLive":2,"columnArticles":100,"formTitle":"[522]最长特殊序列 II","frequency":0.8353654542,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":17972,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2743062429881872,"acs":66505,"articleLive":2,"columnArticles":586,"formTitle":"[523]连续的子数组和","frequency":2.8562159835,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":242448,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4729545034784215,"acs":38411,"articleLive":2,"columnArticles":367,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":1.6719059297,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"","submitted":81215,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5365141428889604,"acs":43360,"articleLive":2,"columnArticles":498,"formTitle":"[525]连续数组","frequency":3.3833338447,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":80818,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7342908849334524,"acs":32054,"articleLive":2,"columnArticles":376,"formTitle":"[526]优美的排列","frequency":1.6611071552,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":43653,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5756126718469815,"acs":1926,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"","submitted":3346,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.4694152250859963,"acs":9416,"articleLive":2,"columnArticles":91,"formTitle":"[528]按权重随机选择","frequency":1.1363444987,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"","submitted":20059,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6464884473902799,"acs":38137,"articleLive":2,"columnArticles":455,"formTitle":"[529]扫雷游戏","frequency":1.7754180025,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":58991,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6205906344159411,"acs":74559,"articleLive":2,"columnArticles":617,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.8058212079,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":120142,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6635548917102315,"acs":3554,"articleLive":2,"columnArticles":73,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"","submitted":5356,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37205877933707965,"acs":24762,"articleLive":2,"columnArticles":264,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.8353654542,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":66554,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5267461669505963,"acs":1546,"articleLive":2,"columnArticles":33,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"","submitted":2935,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6764024107556792,"acs":13131,"articleLive":2,"columnArticles":131,"formTitle":"[534]游戏玩法分析 III","frequency":0.8058212079,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"","submitted":19413,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8416657510163719,"acs":15320,"articleLive":2,"columnArticles":93,"formTitle":"[535]TinyURL 的加密与解密","frequency":1.4951320132,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18202,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5344891871737509,"acs":2867,"articleLive":2,"columnArticles":45,"formTitle":"[536]从字符串生成二叉树","frequency":0.3938048023,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"","submitted":5364,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7110056925996205,"acs":11241,"articleLive":2,"columnArticles":164,"formTitle":"[537]复数乘法","frequency":0.3041926436,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":15810,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.6946455094730192,"acs":103357,"articleLive":2,"columnArticles":787,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":1.7221761885,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":148791,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5937247870909906,"acs":13246,"articleLive":2,"columnArticles":168,"formTitle":"[539]最小时间差","frequency":1.4003342134,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":22310,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5811276954012653,"acs":35547,"articleLive":2,"columnArticles":370,"formTitle":"[540]有序数组中的单一元素","frequency":2.2690405504,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":61169,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6082131864571522,"acs":67581,"articleLive":2,"columnArticles":768,"formTitle":"[541]反转字符串 II","frequency":1.407851209,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":111114,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45938070546994814,"acs":62903,"articleLive":2,"columnArticles":595,"formTitle":"[542]01 矩阵","frequency":2.088441647,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":136930,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.548161224353089,"acs":139114,"articleLive":2,"columnArticles":1176,"formTitle":"[543]二叉树的直径","frequency":3.5000161648,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":253783,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7098646034816247,"acs":2202,"articleLive":2,"columnArticles":49,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"","submitted":3102,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.41615930999492645,"acs":3281,"articleLive":2,"columnArticles":74,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"","submitted":7884,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6309873547068591,"acs":14820,"articleLive":2,"columnArticles":118,"formTitle":"[546]移除盒子","frequency":1.229022426,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":23487,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6179703357385072,"acs":152533,"articleLive":2,"columnArticles":1071,"formTitle":"[547]省份数量","frequency":2.7807278718,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":246829,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.35666435666435664,"acs":1544,"articleLive":2,"columnArticles":39,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"","submitted":4329,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48427049789447607,"acs":1955,"articleLive":2,"columnArticles":47,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"","submitted":4037,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4385565052231719,"acs":11545,"articleLive":2,"columnArticles":166,"formTitle":"[550]游戏玩法分析 IV","frequency":1.4308011549,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"","submitted":26325,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5668441787262685,"acs":57266,"articleLive":2,"columnArticles":734,"formTitle":"[551]学生出勤记录 I","frequency":1.0206243207,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":101026,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5783030604628017,"acs":23242,"articleLive":2,"columnArticles":284,"formTitle":"[552]学生出勤记录 II","frequency":1.5222486422,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":40190,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6020091909800149,"acs":5633,"articleLive":2,"columnArticles":80,"formTitle":"[553]最优除法","frequency":0.2768834642,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9357,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5002217799260733,"acs":43982,"articleLive":2,"columnArticles":481,"formTitle":"[554]砖墙","frequency":2.9322912281,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":87925,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3414012738853503,"acs":1072,"articleLive":2,"columnArticles":21,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"","submitted":3140,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32457386363636365,"acs":13710,"articleLive":2,"columnArticles":204,"formTitle":"[556]下一个更大元素 III","frequency":2.4996909759,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":42240,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.744950354249727,"acs":146677,"articleLive":2,"columnArticles":1183,"formTitle":"[557]反转字符串中的单词 III","frequency":2.9039950799,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":196895,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5015100373068041,"acs":2823,"articleLive":2,"columnArticles":35,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5629,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7266147549166417,"acs":58228,"articleLive":2,"columnArticles":534,"formTitle":"[559]N 叉树的最大深度","frequency":1.6089881446,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":80136,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4470261482183986,"acs":138579,"articleLive":2,"columnArticles":859,"formTitle":"[560]和为K的子数组","frequency":3.8556590947,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":310002,"title":"和为K的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7733171414895315,"acs":87241,"articleLive":2,"columnArticles":725,"formTitle":"[561]数组拆分 I","frequency":1.1363444987,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"","submitted":112814,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.45994599459945995,"acs":3577,"articleLive":2,"columnArticles":51,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"","submitted":7777,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.603979983707669,"acs":31140,"articleLive":2,"columnArticles":311,"formTitle":"[563]二叉树的坡度","frequency":1.4003342134,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":51558,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.1783645369826211,"acs":4249,"articleLive":2,"columnArticles":74,"formTitle":"[564]寻找最近的回文数","frequency":0.8660803995,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":23822,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6097209071644348,"acs":13523,"articleLive":2,"columnArticles":133,"formTitle":"[565]数组嵌套","frequency":0.8058212079,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":22179,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.696940694659292,"acs":62625,"articleLive":2,"columnArticles":578,"formTitle":"[566]重塑矩阵","frequency":1.4623744168,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":89857,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.42980173856921,"acs":106550,"articleLive":2,"columnArticles":960,"formTitle":"[567]字符串的排列","frequency":2.6440332846,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":247905,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.4930939226519337,"acs":1071,"articleLive":2,"columnArticles":24,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"","submitted":2172,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.563904096658486,"acs":8961,"articleLive":2,"columnArticles":149,"formTitle":"[569]员工薪水中位数","frequency":1.229022426,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"","submitted":15891,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6644142865254671,"acs":11701,"articleLive":2,"columnArticles":105,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.8353654542,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"","submitted":17611,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.48969555035128803,"acs":6273,"articleLive":2,"columnArticles":95,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.8353654542,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"","submitted":12810,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4739793969453152,"acs":78172,"articleLive":2,"columnArticles":687,"formTitle":"[572]另一棵树的子树","frequency":2.5148736074,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":164927,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6601218686526743,"acs":975,"articleLive":2,"columnArticles":29,"formTitle":"[573]松鼠模拟","frequency":0.6492521472,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"","submitted":1477,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6474055947945053,"acs":11641,"articleLive":2,"columnArticles":108,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"","submitted":17981,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6845934185477291,"acs":40276,"articleLive":2,"columnArticles":402,"formTitle":"[575]分糖果","frequency":1.4623744168,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":58832,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.46915713905876094,"acs":24703,"articleLive":2,"columnArticles":272,"formTitle":"[576]出界的路径数","frequency":1.2623366327,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":52654,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7068244046081521,"acs":13682,"articleLive":2,"columnArticles":78,"formTitle":"[577]员工奖金","frequency":0.8353654542,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"","submitted":19357,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.49873612484888447,"acs":9076,"articleLive":2,"columnArticles":106,"formTitle":"[578]查询回答率最高的问题","frequency":0.2768834642,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"","submitted":18198,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.41422740524781343,"acs":7104,"articleLive":2,"columnArticles":122,"formTitle":"[579]查询员工的累计薪水","frequency":0.8353654542,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"","submitted":17150,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5266981893668551,"acs":9134,"articleLive":2,"columnArticles":74,"formTitle":"[580]统计各专业学生人数","frequency":0.8058212079,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"","submitted":17342,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.4035315213530366,"acs":94292,"articleLive":2,"columnArticles":823,"formTitle":"[581]最短无序连续子数组","frequency":1.5519009431,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":233667,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.402379690736548,"acs":8353,"articleLive":2,"columnArticles":128,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"","submitted":20759,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.5808129581668935,"acs":26463,"articleLive":2,"columnArticles":253,"formTitle":"[583]两个字符串的删除操作","frequency":1.8688514683,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":45562,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7725185230543139,"acs":12616,"articleLive":2,"columnArticles":54,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"","submitted":16331,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5937620331151329,"acs":7710,"articleLive":2,"columnArticles":91,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"","submitted":12985,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7491640691413999,"acs":13219,"articleLive":2,"columnArticles":83,"formTitle":"[586]订单最多的客户","frequency":1.1969752486,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"","submitted":17645,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3790987535953979,"acs":1977,"articleLive":2,"columnArticles":36,"formTitle":"[587]安装栅栏","frequency":0.6036237946,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5215,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.43302280758111145,"acs":1348,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":0.3938048023,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"","submitted":3113,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7446953781512605,"acs":85074,"articleLive":2,"columnArticles":547,"formTitle":"[589]N 叉树的前序遍历","frequency":1.9133230025,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":114240,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7594832914937367,"acs":60205,"articleLive":2,"columnArticles":441,"formTitle":"[590]N 叉树的后序遍历","frequency":0.8058212079,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":79271,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3388756927949327,"acs":1712,"articleLive":2,"columnArticles":40,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5052,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5203011230408491,"acs":4216,"articleLive":2,"columnArticles":102,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8103,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.4406437503504738,"acs":7858,"articleLive":2,"columnArticles":123,"formTitle":"[593]有效的正方形","frequency":1.1969752486,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":17833,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5157334133443349,"acs":27502,"articleLive":2,"columnArticles":258,"formTitle":"[594]最长和谐子序列","frequency":0.2255770086,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":53326,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7962266890365878,"acs":98713,"articleLive":2,"columnArticles":229,"formTitle":"[595]大的国家","frequency":1.9286395831,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":123976,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4202687600512443,"acs":77092,"articleLive":2,"columnArticles":269,"formTitle":"[596]超过5名学生的课","frequency":1.1661086006,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":183435,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4408075721546137,"acs":9454,"articleLive":2,"columnArticles":78,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.8353654542,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"","submitted":21447,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5166050408765562,"acs":15229,"articleLive":2,"columnArticles":192,"formTitle":"[598]范围求和 II","frequency":0.2768834642,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":29479,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5221397638170823,"acs":27369,"articleLive":2,"columnArticles":254,"formTitle":"[599]两个列表的最小索引总和","frequency":0.8660803995,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":52417,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.3431858407079646,"acs":3878,"articleLive":2,"columnArticles":67,"formTitle":"[600]不含连续1的非负整数","frequency":0.8058212079,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"","submitted":11300,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.4966907240496225,"acs":29868,"articleLive":2,"columnArticles":353,"formTitle":"[601]体育馆的人流量","frequency":2.6656476758,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":60134,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6278481012658228,"acs":7440,"articleLive":2,"columnArticles":81,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.3327171103,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"","submitted":11850,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6728330424665503,"acs":11566,"articleLive":2,"columnArticles":104,"formTitle":"[603]连续空余座位","frequency":1.2623366327,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"","submitted":17190,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37282626361124654,"acs":2294,"articleLive":2,"columnArticles":50,"formTitle":"[604]迭代压缩字符串","frequency":0.3625522588,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"","submitted":6153,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3350757636494829,"acs":104485,"articleLive":2,"columnArticles":1215,"formTitle":"[605]种花问题","frequency":2.667902519,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":311825,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5674013752414983,"acs":27313,"articleLive":2,"columnArticles":298,"formTitle":"[606]根据二叉树创建字符串","frequency":1.1363444987,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":48137,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6645829612430791,"acs":11163,"articleLive":2,"columnArticles":82,"formTitle":"[607]销售员","frequency":0.2768834642,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"","submitted":16797,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6587509349289454,"acs":7046,"articleLive":2,"columnArticles":90,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"","submitted":10696,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.48035714285714287,"acs":6187,"articleLive":2,"columnArticles":95,"formTitle":"[609]在系统中查找重复文件","frequency":0.3327171103,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":12880,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6686877134295073,"acs":9595,"articleLive":2,"columnArticles":69,"formTitle":"[610]判断三角形","frequency":0.2768834642,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"","submitted":14349,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5319104043354174,"acs":47898,"articleLive":2,"columnArticles":374,"formTitle":"[611]有效三角形的个数","frequency":2.44904159,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":90049,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6697779524464531,"acs":6817,"articleLive":2,"columnArticles":58,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"","submitted":10178,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8171489168307832,"acs":10788,"articleLive":2,"columnArticles":79,"formTitle":"[613]直线上的最近距离","frequency":0.2768834642,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"","submitted":13202,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.34694161906088894,"acs":7470,"articleLive":2,"columnArticles":60,"formTitle":"[614]二级关注者","frequency":0.8353654542,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"","submitted":21531,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.4239951384668808,"acs":4884,"articleLive":2,"columnArticles":82,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.3625522588,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"","submitted":11519,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.4610649430594029,"acs":2996,"articleLive":2,"columnArticles":52,"formTitle":"[616]给字符串添加加粗标签","frequency":1.8450487545,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"","submitted":6498,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7881141275340817,"acs":174241,"articleLive":2,"columnArticles":1142,"formTitle":"[617]合并二叉树","frequency":3.0912673184,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":221086,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6203271028037384,"acs":4248,"articleLive":2,"columnArticles":44,"formTitle":"[618]学生地理信息报告","frequency":1.4951320132,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"","submitted":6848,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.46586666666666665,"acs":10482,"articleLive":2,"columnArticles":77,"formTitle":"[619]只出现一次的最大数字","frequency":0.2768834642,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"","submitted":22500,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7723491912051693,"acs":89048,"articleLive":2,"columnArticles":298,"formTitle":"[620]有趣的电影","frequency":1.9286395831,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":115295,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5682706502367348,"acs":74294,"articleLive":2,"columnArticles":477,"formTitle":"[621]任务调度器","frequency":2.9192532337,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":130737,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4359557084802401,"acs":61577,"articleLive":2,"columnArticles":397,"formTitle":"[622]设计循环队列","frequency":2.5491509264,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":141246,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5453085332366199,"acs":10525,"articleLive":2,"columnArticles":178,"formTitle":"[623]在二叉树中增加一行","frequency":0.2507039587,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":19301,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.41561014263074486,"acs":2098,"articleLive":2,"columnArticles":45,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"","submitted":5048,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.33962264150943394,"acs":2412,"articleLive":2,"columnArticles":50,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"","submitted":7102,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.683034154090548,"acs":42997,"articleLive":2,"columnArticles":330,"formTitle":"[626]换座位","frequency":2.0568559182,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":62950,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8065727699530516,"acs":81605,"articleLive":2,"columnArticles":317,"formTitle":"[627]变更性别","frequency":1.4003342134,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":101175,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.525128503802629,"acs":77541,"articleLive":2,"columnArticles":735,"formTitle":"[628]三个数的最大乘积","frequency":1.6089881446,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":147661,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40111076828139464,"acs":3900,"articleLive":2,"columnArticles":54,"formTitle":"[629]K个逆序对数组","frequency":1.2623366327,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":9723,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.3644010142865978,"acs":5892,"articleLive":2,"columnArticles":71,"formTitle":"[630]课程表 III","frequency":0.3327171103,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":16169,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28187361419068735,"acs":1017,"articleLive":2,"columnArticles":32,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"","submitted":3608,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5970950732701452,"acs":18458,"articleLive":2,"columnArticles":232,"formTitle":"[632]最小区间","frequency":0.8660803995,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":30913,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.3996874766814589,"acs":91058,"articleLive":2,"columnArticles":736,"formTitle":"[633]平方数之和","frequency":2.9505096849,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":227823,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.437187604131956,"acs":1312,"articleLive":2,"columnArticles":18,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"","submitted":3001,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5546594982078853,"acs":3714,"articleLive":2,"columnArticles":61,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"","submitted":6696,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.546339449000059,"acs":9261,"articleLive":2,"columnArticles":108,"formTitle":"[636]函数的独占时间","frequency":0.8353654542,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":16951,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6890279944573107,"acs":71107,"articleLive":2,"columnArticles":624,"formTitle":"[637]二叉树的层平均值","frequency":1.0529937962,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":103199,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5939502552405779,"acs":10937,"articleLive":2,"columnArticles":111,"formTitle":"[638]大礼包","frequency":0.8980524322,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":18414,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.31021619975639464,"acs":4075,"articleLive":2,"columnArticles":78,"formTitle":"[639]解码方法 II","frequency":1.2623366327,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"","submitted":13136,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42333319707313083,"acs":10356,"articleLive":2,"columnArticles":198,"formTitle":"[640]求解方程","frequency":1.229022426,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":24463,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5333089407521626,"acs":20406,"articleLive":2,"columnArticles":229,"formTitle":"[641]设计循环双端队列","frequency":1.3709030133,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":38263,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4906562364189483,"acs":2258,"articleLive":2,"columnArticles":50,"formTitle":"[642]设计搜索自动补全系统","frequency":0.4265946251,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"","submitted":4602,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.45217911417642626,"acs":61235,"articleLive":2,"columnArticles":559,"formTitle":"[643]子数组最大平均数 I","frequency":1.8127357656,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":135422,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4,"acs":1084,"articleLive":2,"columnArticles":22,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"","submitted":2710,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4359120734908136,"acs":66433,"articleLive":2,"columnArticles":681,"formTitle":"[645]错误的集合","frequency":2.0568559182,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":152400,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.574248171972071,"acs":20890,"articleLive":2,"columnArticles":177,"formTitle":"[646]最长数对链","frequency":0.7773697867,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":36378,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.655583870655105,"acs":114994,"articleLive":2,"columnArticles":870,"formTitle":"[647]回文子串","frequency":2.9697588164,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":175407,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5810672664076876,"acs":19894,"articleLive":2,"columnArticles":255,"formTitle":"[648]单词替换","frequency":0.2507039587,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":34237,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.481202248325536,"acs":28594,"articleLive":2,"columnArticles":302,"formTitle":"[649]Dota2 参议院","frequency":0.2507039587,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":59422,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5343155773832011,"acs":25458,"articleLive":2,"columnArticles":296,"formTitle":"[650]只有两个键的键盘","frequency":1.1969752486,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"","submitted":47646,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5803832413121143,"acs":3574,"articleLive":2,"columnArticles":59,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"","submitted":6158,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5709275953420114,"acs":29956,"articleLive":2,"columnArticles":215,"formTitle":"[652]寻找重复的子树","frequency":2.7000389606,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"","submitted":52469,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5934960632406078,"acs":37614,"articleLive":2,"columnArticles":356,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":63377,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8096812766648459,"acs":54847,"articleLive":2,"columnArticles":559,"formTitle":"[654]最大二叉树","frequency":2.1830428583,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":67739,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5951337562953758,"acs":9099,"articleLive":2,"columnArticles":132,"formTitle":"[655]输出二叉树","frequency":0.8660803995,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15289,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.3066001534919417,"acs":799,"articleLive":2,"columnArticles":24,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"","submitted":2606,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7831611620350163,"acs":80740,"articleLive":2,"columnArticles":607,"formTitle":"[657]机器人能否返回原点","frequency":0.8660803995,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":103095,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.4528422708893646,"acs":24751,"articleLive":2,"columnArticles":224,"formTitle":"[658]找到 K 个最接近的元素","frequency":1.6719059297,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":54657,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.542257371607108,"acs":27769,"articleLive":2,"columnArticles":258,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":51210,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6467661691542289,"acs":650,"articleLive":2,"columnArticles":20,"formTitle":"[660]移除 9","frequency":0.6492521472,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"","submitted":1005,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5596388293574114,"acs":15929,"articleLive":2,"columnArticles":203,"formTitle":"[661]图片平滑器","frequency":0.2768834642,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":28463,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4057521434138737,"acs":26029,"articleLive":2,"columnArticles":251,"formTitle":"[662]二叉树最大宽度","frequency":2.7906806785,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":64150,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4649025069637883,"acs":1669,"articleLive":2,"columnArticles":33,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"","submitted":3590,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6557535487768046,"acs":21712,"articleLive":2,"columnArticles":187,"formTitle":"[664]奇怪的打印机","frequency":2.7357060793,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33110,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2698476224356694,"acs":72820,"articleLive":2,"columnArticles":914,"formTitle":"[665]非递减数列","frequency":2.4067736718,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":269856,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6185988061577129,"acs":1969,"articleLive":2,"columnArticles":74,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"","submitted":3183,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6239102357119793,"acs":7729,"articleLive":2,"columnArticles":115,"formTitle":"[667]优美的排列 II","frequency":0.7773697867,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12388,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5072813643797212,"acs":6514,"articleLive":2,"columnArticles":63,"formTitle":"[668]乘法表中第k小的数","frequency":1.6719059297,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":12841,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6671414159397069,"acs":33726,"articleLive":2,"columnArticles":286,"formTitle":"[669]修剪二叉搜索树","frequency":0.8353654542,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":50553,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4491818631149034,"acs":17267,"articleLive":2,"columnArticles":265,"formTitle":"[670]最大交换","frequency":3.0733173822,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":38441,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.4867052347262073,"acs":52076,"articleLive":2,"columnArticles":653,"formTitle":"[671]二叉树中第二小的节点","frequency":1.0636299313,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":106997,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5524206476434754,"acs":3446,"articleLive":2,"columnArticles":37,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.2507039587,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6238,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.3895444722474977,"acs":27399,"articleLive":2,"columnArticles":255,"formTitle":"[673]最长递增子序列的个数","frequency":2.3372602337,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":70336,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4898230940967146,"acs":86443,"articleLive":2,"columnArticles":733,"formTitle":"[674]最长连续递增序列","frequency":1.6939017577,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":176478,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.4004041570438799,"acs":2774,"articleLive":2,"columnArticles":46,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":6928,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5854818065459865,"acs":6404,"articleLive":2,"columnArticles":114,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":10938,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6151894303963601,"acs":14062,"articleLive":2,"columnArticles":230,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":22858,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.3508596325953839,"acs":17877,"articleLive":2,"columnArticles":218,"formTitle":"[678]有效的括号字符串","frequency":3.5516846539,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"","submitted":50952,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5410007403213866,"acs":24846,"articleLive":2,"columnArticles":255,"formTitle":"[679]24 点游戏","frequency":3.3150479368,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":45926,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.40156012769104993,"acs":82519,"articleLive":2,"columnArticles":784,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":2.7854150142,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":205496,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5002049180327869,"acs":2441,"articleLive":2,"columnArticles":58,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"","submitted":4880,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6953002937316418,"acs":44502,"articleLive":2,"columnArticles":495,"formTitle":"[682]棒球比赛","frequency":1.4308011549,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":64004,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4275377299979326,"acs":2068,"articleLive":2,"columnArticles":47,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"","submitted":4837,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6662429528147547,"acs":56606,"articleLive":2,"columnArticles":584,"formTitle":"[684]冗余连接","frequency":1.4308011549,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":84963,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4342829142258948,"acs":19498,"articleLive":2,"columnArticles":252,"formTitle":"[685]冗余连接 II","frequency":1.4623744168,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":44897,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3543589417181168,"acs":16702,"articleLive":2,"columnArticles":187,"formTitle":"[686]重复叠加字符串匹配","frequency":0.3041926436,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":47133,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4391806457051336,"acs":36470,"articleLive":2,"columnArticles":260,"formTitle":"[687]最长同值路径","frequency":2.3713792637,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":83041,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5095431269535147,"acs":7662,"articleLive":2,"columnArticles":102,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.2768834642,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15037,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.48514222151597014,"acs":3053,"articleLive":2,"columnArticles":65,"formTitle":"[689]三个无重叠子数组的最大和","frequency":1.7395770104,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6293,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6462813248298916,"acs":54519,"articleLive":2,"columnArticles":555,"formTitle":"[690]员工的重要性","frequency":3.1961524268,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":84358,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.48838907550752153,"acs":3344,"articleLive":2,"columnArticles":44,"formTitle":"[691]贴纸拼词","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":6847,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5809321614595047,"acs":64577,"articleLive":2,"columnArticles":708,"formTitle":"[692]前K个高频单词","frequency":3.0989466681,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":111161,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6090571892651943,"acs":25123,"articleLive":2,"columnArticles":269,"formTitle":"[693]交替位二进制数","frequency":0.2255770086,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":41249,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5284195605953225,"acs":3728,"articleLive":2,"columnArticles":70,"formTitle":"[694]不同岛屿的数量","frequency":0.8660803995,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"","submitted":7055,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6621401662209185,"acs":115123,"articleLive":2,"columnArticles":1151,"formTitle":"[695]岛屿的最大面积","frequency":3.1930599597,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":173865,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6301448695173518,"acs":50370,"articleLive":2,"columnArticles":460,"formTitle":"[696]计数二进制子串","frequency":0.8058212079,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":79934,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.605978387550931,"acs":64993,"articleLive":2,"columnArticles":824,"formTitle":"[697]数组的度","frequency":1.6398929527,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":107253,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.4404411159575344,"acs":26759,"articleLive":2,"columnArticles":201,"formTitle":"[698]划分为k个相等的子集","frequency":2.8311163642,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":60755,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47265336289726534,"acs":2558,"articleLive":2,"columnArticles":37,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5412,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7587488101208815,"acs":74129,"articleLive":2,"columnArticles":466,"formTitle":"[700]二叉搜索树中的搜索","frequency":1.3148973373,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":97699,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7241128864909733,"acs":69790,"articleLive":2,"columnArticles":520,"formTitle":"[701]二叉搜索树中的插入操作","frequency":1.4184857283,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":96380,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7381564450973191,"acs":4020,"articleLive":2,"columnArticles":74,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"","submitted":5446,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5117768485682528,"acs":58014,"articleLive":2,"columnArticles":527,"formTitle":"[703]数据流中的第 K 大元素","frequency":1.5222486422,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":113358,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.555018335361521,"acs":203871,"articleLive":2,"columnArticles":997,"formTitle":"[704]二分查找","frequency":3.9053683104,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":367323,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6473108626458827,"acs":63452,"articleLive":2,"columnArticles":417,"formTitle":"[705]设计哈希集合","frequency":2.6656476758,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":98024,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6447549435957556,"acs":53897,"articleLive":2,"columnArticles":373,"formTitle":"[706]设计哈希映射","frequency":2.1101109672,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":83593,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3174276627449236,"acs":57090,"articleLive":2,"columnArticles":402,"formTitle":"[707]设计链表","frequency":2.8562159835,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":179852,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.33657651715039577,"acs":2041,"articleLive":2,"columnArticles":48,"formTitle":"[708]循环有序列表的插入","frequency":0.3625522588,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"","submitted":6064,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.759659799908054,"acs":69401,"articleLive":2,"columnArticles":493,"formTitle":"[709]转换成小写字母","frequency":0.2768834642,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":91358,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3505338078291815,"acs":4728,"articleLive":2,"columnArticles":55,"formTitle":"[710]黑名单中的随机数","frequency":1.229022426,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":13488,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5740897544453852,"acs":678,"articleLive":2,"columnArticles":24,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"","submitted":1181,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6712782821732238,"acs":13974,"articleLive":2,"columnArticles":147,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":1.8127357656,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":20817,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4027532360797206,"acs":19602,"articleLive":2,"columnArticles":177,"formTitle":"[713]乘积小于K的子数组","frequency":2.0534117956,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":48670,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7166450046307467,"acs":92081,"articleLive":2,"columnArticles":629,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":2.0756782318,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":128489,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.40266756711126117,"acs":2385,"articleLive":2,"columnArticles":40,"formTitle":"[715]Range 模块","frequency":0.966163858,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":5923,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.45899772209567197,"acs":3627,"articleLive":2,"columnArticles":67,"formTitle":"[716]最大栈","frequency":0.2768834642,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"ac","submitted":7902,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5101730994538044,"acs":30917,"articleLive":2,"columnArticles":370,"formTitle":"[717]1比特与2比特字符","frequency":0.8353654542,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":60601,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5638001553955991,"acs":76917,"articleLive":2,"columnArticles":553,"formTitle":"[718]最长重复子数组","frequency":3.3519044821,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":136426,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3664767747589833,"acs":8363,"articleLive":2,"columnArticles":78,"formTitle":"[719]找出第 k 小的距离对","frequency":0.8353654542,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":22820,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48627279282991653,"acs":18881,"articleLive":2,"columnArticles":247,"formTitle":"[720]词典中最长的单词","frequency":0.1425667653,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":38828,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.46951565999264633,"acs":28093,"articleLive":2,"columnArticles":328,"formTitle":"[721]账户合并","frequency":2.2022005323,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":59834,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3216816249409542,"acs":4767,"articleLive":2,"columnArticles":72,"formTitle":"[722]删除注释","frequency":1.6398929527,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":14819,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7254437869822485,"acs":1226,"articleLive":2,"columnArticles":38,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"","submitted":1690,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4559630681718675,"acs":130177,"articleLive":2,"columnArticles":818,"formTitle":"[724]寻找数组的中心下标","frequency":1.2623366327,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":285499,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.5626719436266229,"acs":23316,"articleLive":2,"columnArticles":304,"formTitle":"[725]分隔链表","frequency":1.1969752486,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":41438,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5556767708252163,"acs":21393,"articleLive":2,"columnArticles":388,"formTitle":"[726]原子的数量","frequency":2.5491509264,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":38499,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.41295483061480553,"acs":2633,"articleLive":2,"columnArticles":43,"formTitle":"[727]最小窗口子序列","frequency":1.4951320132,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"","submitted":6376,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7588967157625103,"acs":33182,"articleLive":2,"columnArticles":298,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":43724,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5056024346382626,"acs":7310,"articleLive":2,"columnArticles":82,"formTitle":"[729]我的日程安排表 I","frequency":1.1661086006,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":14458,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.48770385710587627,"acs":3768,"articleLive":2,"columnArticles":47,"formTitle":"[730]统计不同回文子序列","frequency":2.0263098659,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":7726,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5102965403624382,"acs":3717,"articleLive":2,"columnArticles":37,"formTitle":"[731]我的日程安排表 II","frequency":0.2768834642,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":7284,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6116352201257862,"acs":3112,"articleLive":2,"columnArticles":49,"formTitle":"[732]我的日程安排表 III","frequency":0.3938048023,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5088,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5805059914725079,"acs":57455,"articleLive":2,"columnArticles":489,"formTitle":"[733]图像渲染","frequency":1.898257939,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":98974,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4784892446223112,"acs":1913,"articleLive":2,"columnArticles":34,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"","submitted":3998,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.40999427903390295,"acs":16483,"articleLive":2,"columnArticles":210,"formTitle":"[735]行星碰撞","frequency":1.4623744168,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":40203,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.45850046282011725,"acs":1486,"articleLive":2,"columnArticles":44,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3241,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4628637059724349,"acs":3627,"articleLive":2,"columnArticles":60,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"","submitted":7836,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5019242532368233,"acs":39387,"articleLive":2,"columnArticles":568,"formTitle":"[738]单调递增的数字","frequency":1.5291604751,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"","submitted":78472,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6775689024516254,"acs":196724,"articleLive":2,"columnArticles":1425,"formTitle":"[739]每日温度","frequency":4.2877261458,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":290338,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.631097474360067,"acs":44428,"articleLive":2,"columnArticles":525,"formTitle":"[740]删除并获得点数","frequency":2.9248617734,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":70398,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.36507324595219737,"acs":3788,"articleLive":2,"columnArticles":43,"formTitle":"[741]摘樱桃","frequency":1.3709030133,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10376,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4928813559322034,"acs":1454,"articleLive":2,"columnArticles":42,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"","submitted":2950,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5154241141423643,"acs":52598,"articleLive":2,"columnArticles":492,"formTitle":"[743]网络延迟时间","frequency":1.3445995505,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":102048,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45931305155051055,"acs":39088,"articleLive":2,"columnArticles":346,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":1.4308011549,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":85101,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.390742890307603,"acs":2693,"articleLive":2,"columnArticles":51,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":6892,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5789458450316941,"acs":120012,"articleLive":2,"columnArticles":1187,"formTitle":"[746]使用最小花费爬楼梯","frequency":2.2558121444,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":207294,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.414522333432925,"acs":44397,"articleLive":2,"columnArticles":393,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.2768834642,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":107104,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.5983774851019079,"acs":11949,"articleLive":2,"columnArticles":165,"formTitle":"[748]最短补全词","frequency":0.2507039587,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":19969,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5064516129032258,"acs":1256,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.9313777419,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2480,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7230354391371341,"acs":1877,"articleLive":2,"columnArticles":42,"formTitle":"[750]角矩形的数量","frequency":1.2128460785,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"","submitted":2596,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5083674228337672,"acs":1367,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"","submitted":2689,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5319169561353906,"acs":65846,"articleLive":2,"columnArticles":560,"formTitle":"[752]打开转盘锁","frequency":1.9925912299,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":123790,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5871329211746522,"acs":3039,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":1.0018055493,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5176,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.42744400600233423,"acs":7691,"articleLive":2,"columnArticles":87,"formTitle":"[754]到达终点数字","frequency":0.8353654542,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":17993,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.5014061872237846,"acs":1248,"articleLive":2,"columnArticles":30,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"","submitted":2489,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.574025634318598,"acs":4389,"articleLive":2,"columnArticles":66,"formTitle":"[756]金字塔转换矩阵","frequency":0.3041926436,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":7646,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.41613475177304965,"acs":2347,"articleLive":2,"columnArticles":36,"formTitle":"[757]设置交集大小至少为2","frequency":0.4265946251,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5640,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.45853397538790797,"acs":3428,"articleLive":2,"columnArticles":68,"formTitle":"[758]字符串中的加粗单词","frequency":0.6492521472,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"","submitted":7476,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6577540106951871,"acs":1722,"articleLive":2,"columnArticles":44,"formTitle":"[759]员工空闲时间","frequency":0.3625522588,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"","submitted":2618,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8382642998027613,"acs":3825,"articleLive":2,"columnArticles":87,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"","submitted":4563,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5940333430827728,"acs":2031,"articleLive":2,"columnArticles":33,"formTitle":"[761]特殊的二进制序列","frequency":0.6036237946,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3419,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.6976331599532277,"acs":17302,"articleLive":2,"columnArticles":136,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":24801,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7627250900360144,"acs":76242,"articleLive":2,"columnArticles":925,"formTitle":"[763]划分字母区间","frequency":3.1181116855,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":99960,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.49054020413243715,"acs":3941,"articleLive":2,"columnArticles":51,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8034,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6655749293119698,"acs":28247,"articleLive":2,"columnArticles":424,"formTitle":"[765]情侣牵手","frequency":2.7966391064,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":42440,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7081391695900309,"acs":54099,"articleLive":2,"columnArticles":627,"formTitle":"[766]托普利茨矩阵","frequency":0.2768834642,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":76396,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.4773974616553143,"acs":38969,"articleLive":2,"columnArticles":487,"formTitle":"[767]重构字符串","frequency":2.0976668046,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":81628,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.49989388794567063,"acs":4711,"articleLive":2,"columnArticles":75,"formTitle":"[768]最多能完成排序的块 II","frequency":1.229022426,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":9424,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5905487490991455,"acs":11472,"articleLive":2,"columnArticles":134,"formTitle":"[769]最多能完成排序的块","frequency":0.2768834642,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":19426,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5520428015564203,"acs":1135,"articleLive":2,"columnArticles":25,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2056,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8514205315975047,"acs":150681,"articleLive":2,"columnArticles":1095,"formTitle":"[771]宝石与石头","frequency":2.1704854006,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"","submitted":176976,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4888927912898411,"acs":5568,"articleLive":2,"columnArticles":115,"formTitle":"[772]基本计算器 III","frequency":1.3709030133,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"","submitted":11389,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7159671330224295,"acs":22568,"articleLive":2,"columnArticles":324,"formTitle":"[773]滑动谜题","frequency":2.4996909759,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":31521,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5941348973607038,"acs":1013,"articleLive":2,"columnArticles":21,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"","submitted":1705,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.46147324792765637,"acs":4899,"articleLive":2,"columnArticles":74,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":10616,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5709560039695667,"acs":1726,"articleLive":2,"columnArticles":37,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"","submitted":3023,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3240380587636886,"acs":5415,"articleLive":2,"columnArticles":58,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.8660803995,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":16711,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5985532026831514,"acs":22754,"articleLive":2,"columnArticles":342,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.3327171103,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":38015,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4354234853657962,"acs":18492,"articleLive":2,"columnArticles":227,"formTitle":"[779]第K个语法符号","frequency":1.8450487545,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":42469,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2839974114819266,"acs":3072,"articleLive":2,"columnArticles":48,"formTitle":"[780]到达终点","frequency":0.966163858,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":10817,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6236042253733367,"acs":41383,"articleLive":2,"columnArticles":637,"formTitle":"[781]森林中的兔子","frequency":4.3697904428,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":66361,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42159853569249545,"acs":1382,"articleLive":2,"columnArticles":28,"formTitle":"[782]变为棋盘","frequency":1.6939017577,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3278,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5957487669678321,"acs":68246,"articleLive":2,"columnArticles":659,"formTitle":"[783]二叉搜索树节点最小距离","frequency":1.6719059297,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":114555,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6839059736602621,"acs":39830,"articleLive":2,"columnArticles":429,"formTitle":"[784]字母大小写全排列","frequency":1.1661086006,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"","submitted":58239,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.511202657807309,"acs":38468,"articleLive":2,"columnArticles":395,"formTitle":"[785]判断二分图","frequency":2.0263098659,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":75250,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.45959357277882795,"acs":3890,"articleLive":2,"columnArticles":50,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":8464,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3530704143515997,"acs":19445,"articleLive":2,"columnArticles":191,"formTitle":"[787]K 站中转内最便宜的航班","frequency":1.8450487545,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"","submitted":55074,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6067133429365851,"acs":18111,"articleLive":2,"columnArticles":181,"formTitle":"[788]旋转数字","frequency":0.8980524322,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":29851,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6932508758132552,"acs":19393,"articleLive":2,"columnArticles":277,"formTitle":"[789]逃脱阻碍者","frequency":1.1035882436,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":27974,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.44741337237676915,"acs":3667,"articleLive":2,"columnArticles":59,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8196,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6947455681673256,"acs":10895,"articleLive":2,"columnArticles":192,"formTitle":"[791]自定义字符串排序","frequency":1.7051051014,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":15682,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.45031004774186467,"acs":8206,"articleLive":2,"columnArticles":92,"formTitle":"[792]匹配子序列的单词数","frequency":0.8353654542,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":18223,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.39390396659707727,"acs":4717,"articleLive":2,"columnArticles":64,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.2507039587,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":11975,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3409276616198029,"acs":7093,"articleLive":2,"columnArticles":96,"formTitle":"[794]有效的井字游戏","frequency":0.3041926436,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":20805,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5341606047639423,"acs":7490,"articleLive":2,"columnArticles":83,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":14022,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5227077773541746,"acs":21937,"articleLive":2,"columnArticles":259,"formTitle":"[796]旋转字符串","frequency":2.121137653,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":41968,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7405993593962529,"acs":16879,"articleLive":2,"columnArticles":246,"formTitle":"[797]所有可能的路径","frequency":1.1969752486,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":22791,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4568678267308404,"acs":1234,"articleLive":2,"columnArticles":30,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2701,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4069373942470389,"acs":4810,"articleLive":2,"columnArticles":65,"formTitle":"[799]香槟塔","frequency":2.4067736718,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":11820,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7055498458376156,"acs":1373,"articleLive":2,"columnArticles":33,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"","submitted":1946,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.41748925089323563,"acs":6894,"articleLive":2,"columnArticles":82,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.3938048023,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":16513,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5773719699719203,"acs":30226,"articleLive":2,"columnArticles":329,"formTitle":"[802]找到最终的安全状态","frequency":1.2399818402,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":52351,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4835089969141987,"acs":12065,"articleLive":2,"columnArticles":122,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":24953,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7693555085332331,"acs":38904,"articleLive":2,"columnArticles":387,"formTitle":"[804]唯一摩尔斯密码词","frequency":1.1661086006,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":50567,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.28904237883399675,"acs":2469,"articleLive":2,"columnArticles":39,"formTitle":"[805]数组的均值分割","frequency":1.2623366327,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":8542,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6582906857727738,"acs":12863,"articleLive":2,"columnArticles":143,"formTitle":"[806]写字符串需要的行数","frequency":0.8353654542,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":19540,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8436102236421725,"acs":15843,"articleLive":2,"columnArticles":203,"formTitle":"[807]保持城市天际线","frequency":0.2768834642,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":18780,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4783891094724901,"acs":4217,"articleLive":2,"columnArticles":40,"formTitle":"[808]分汤","frequency":1.2970141712,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":8815,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.41777092031221635,"acs":4603,"articleLive":2,"columnArticles":84,"formTitle":"[809]情感丰富的文字","frequency":0.8660803995,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11018,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7366879899090009,"acs":16353,"articleLive":2,"columnArticles":132,"formTitle":"[810]黑板异或游戏","frequency":2.0263098659,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22198,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7026815333579064,"acs":15251,"articleLive":2,"columnArticles":187,"formTitle":"[811]子域名访问计数","frequency":0.8058212079,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":21704,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6294811034147527,"acs":10360,"articleLive":2,"columnArticles":90,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":16458,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5473278606131681,"acs":6534,"articleLive":2,"columnArticles":80,"formTitle":"[813]最大平均值和的分组","frequency":0.3625522588,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":11938,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6998365017792454,"acs":21830,"articleLive":2,"columnArticles":335,"formTitle":"[814]二叉树剪枝","frequency":0.2768834642,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":31193,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4350950078321869,"acs":25554,"articleLive":2,"columnArticles":308,"formTitle":"[815]公交路线","frequency":4.0709765299,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":58732,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.51171875,"acs":3406,"articleLive":2,"columnArticles":59,"formTitle":"[816]模糊坐标","frequency":0.3938048023,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":6656,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5914647900031579,"acs":13111,"articleLive":2,"columnArticles":163,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22167,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.42934648581997537,"acs":3482,"articleLive":2,"columnArticles":42,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8110,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42062591211285877,"acs":20752,"articleLive":2,"columnArticles":238,"formTitle":"[819]最常见的单词","frequency":0.9313777419,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":49336,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5055830792682927,"acs":53066,"articleLive":2,"columnArticles":591,"formTitle":"[820]单词的压缩编码","frequency":1.9494671609,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":104960,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.691602059537196,"acs":23372,"articleLive":2,"columnArticles":314,"formTitle":"[821]字符的最短距离","frequency":1.4623744168,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":33794,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5019419271314962,"acs":2714,"articleLive":2,"columnArticles":35,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5407,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4292721518987342,"acs":2713,"articleLive":2,"columnArticles":52,"formTitle":"[823]带因子的二叉树","frequency":0.532340412,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6320,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6141640283431328,"acs":16295,"articleLive":2,"columnArticles":232,"formTitle":"[824]山羊拉丁文","frequency":0.2768834642,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":26532,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3895020694845102,"acs":6211,"articleLive":2,"columnArticles":84,"formTitle":"[825]适龄的朋友","frequency":0.2768834642,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":15946,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.37273390289643676,"acs":7155,"articleLive":2,"columnArticles":103,"formTitle":"[826]安排工作以达到最大收益","frequency":0.3041926436,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":19196,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3933621653141552,"acs":8095,"articleLive":2,"columnArticles":170,"formTitle":"[827]最大人工岛","frequency":1.4951320132,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":20579,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.48695368558382257,"acs":2986,"articleLive":2,"columnArticles":49,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6132,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3610801657680139,"acs":8103,"articleLive":2,"columnArticles":94,"formTitle":"[829]连续整数求和","frequency":1.4623744168,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":22441,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5431609432307025,"acs":51389,"articleLive":2,"columnArticles":572,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":94611,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.403341020304854,"acs":7171,"articleLive":2,"columnArticles":68,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":17779,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7954532639136891,"acs":84641,"articleLive":2,"columnArticles":909,"formTitle":"[832]翻转图像","frequency":2.846843668,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":106406,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4247733612273361,"acs":4873,"articleLive":2,"columnArticles":73,"formTitle":"[833]字符串中的查找与替换","frequency":0.2768834642,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":11472,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5291476192402605,"acs":13080,"articleLive":2,"columnArticles":128,"formTitle":"[834]树中距离之和","frequency":0.8980524322,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":24719,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5724989593450812,"acs":4126,"articleLive":2,"columnArticles":46,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7207,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.47719079041557666,"acs":36664,"articleLive":2,"columnArticles":645,"formTitle":"[836]矩形重叠","frequency":0.8353654542,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":76833,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.3968939989246867,"acs":19193,"articleLive":2,"columnArticles":239,"formTitle":"[837]新21点","frequency":0.8660803995,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":48358,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5005929439667951,"acs":6754,"articleLive":2,"columnArticles":118,"formTitle":"[838]推多米诺","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":13492,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5742562122744125,"acs":18742,"articleLive":2,"columnArticles":265,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":32637,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3586492746556138,"acs":8826,"articleLive":2,"columnArticles":111,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":24609,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6563780186253645,"acs":53355,"articleLive":2,"columnArticles":522,"formTitle":"[841]钥匙和房间","frequency":0.8353654542,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":81287,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48952649181482133,"acs":27810,"articleLive":2,"columnArticles":318,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":2.088441647,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":56810,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3760928765945249,"acs":2624,"articleLive":2,"columnArticles":33,"formTitle":"[843]猜猜这个单词","frequency":0.4610570293,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":6977,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5162718286346669,"acs":82572,"articleLive":2,"columnArticles":919,"formTitle":"[844]比较含退格的字符串","frequency":1.3424434944,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":159939,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4200797887541295,"acs":36749,"articleLive":2,"columnArticles":546,"formTitle":"[845]数组中的最长山脉","frequency":1.6719059297,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":87481,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5109538461538462,"acs":8303,"articleLive":2,"columnArticles":112,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":16250,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6838760921366164,"acs":18081,"articleLive":2,"columnArticles":155,"formTitle":"[847]访问所有节点的最短路径","frequency":1.5854369908,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":26439,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4457121825542878,"acs":8477,"articleLive":2,"columnArticles":92,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":19019,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.4255511433657401,"acs":15539,"articleLive":2,"columnArticles":176,"formTitle":"[849]到最近的人的最大距离","frequency":0.3625522588,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":36515,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4416814683244523,"acs":2238,"articleLive":2,"columnArticles":40,"formTitle":"[850]矩形面积 II","frequency":1.4951320132,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5067,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4821493404332567,"acs":3984,"articleLive":2,"columnArticles":68,"formTitle":"[851]喧闹和富有","frequency":1.1969752486,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":8263,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7153662978008124,"acs":81712,"articleLive":2,"columnArticles":702,"formTitle":"[852]山脉数组的峰顶索引","frequency":2.9124421462,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":114224,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3812159095433372,"acs":9575,"articleLive":2,"columnArticles":117,"formTitle":"[853]车队","frequency":1.7754180025,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":25117,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.36102590320381733,"acs":4237,"articleLive":2,"columnArticles":63,"formTitle":"[854]相似度为 K 的字符串","frequency":0.3938048023,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":11736,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.40796586059743956,"acs":4302,"articleLive":2,"columnArticles":51,"formTitle":"[855]考场就座","frequency":0.8353654542,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":10545,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6250300072017284,"acs":15622,"articleLive":2,"columnArticles":212,"formTitle":"[856]括号的分数","frequency":1.8785489841,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":24994,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46691717039699393,"acs":2858,"articleLive":2,"columnArticles":45,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":1.3331626853,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6121,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5568321707016824,"acs":2714,"articleLive":2,"columnArticles":44,"formTitle":"[858]镜面反射","frequency":1.2623366327,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":4874,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.30144792049235974,"acs":27086,"articleLive":2,"columnArticles":350,"formTitle":"[859]亲密字符串","frequency":0.8353654542,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":89853,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5863553056979881,"acs":85422,"articleLive":2,"columnArticles":747,"formTitle":"[860]柠檬水找零","frequency":1.6398929527,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"","submitted":145683,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8090533267465745,"acs":31117,"articleLive":2,"columnArticles":434,"formTitle":"[861]翻转矩阵后的得分","frequency":0.2768834642,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"","submitted":38461,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.18730458452370735,"acs":15276,"articleLive":2,"columnArticles":122,"formTitle":"[862]和至少为 K 的最短子数组","frequency":2.3043300274,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":81557,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6034171859099106,"acs":33798,"articleLive":2,"columnArticles":548,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":1.4602335926,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":56011,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.4527080372651192,"acs":2867,"articleLive":2,"columnArticles":41,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6333,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6536223005054372,"acs":8535,"articleLive":2,"columnArticles":120,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13058,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22323924194489664,"acs":7268,"articleLive":2,"columnArticles":82,"formTitle":"[866]回文素数","frequency":0.8660803995,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":32557,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6709697860897399,"acs":82589,"articleLive":2,"columnArticles":741,"formTitle":"[867]转置矩阵","frequency":3.1206394927,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":123089,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6236837969511236,"acs":15874,"articleLive":2,"columnArticles":224,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":25452,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.550075401401579,"acs":6201,"articleLive":2,"columnArticles":87,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.2768834642,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11273,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.42294073797987325,"acs":13617,"articleLive":2,"columnArticles":174,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":32196,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.33827075439200827,"acs":8838,"articleLive":2,"columnArticles":117,"formTitle":"[871]最低加油次数","frequency":1.8127357656,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":26127,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.652133905880291,"acs":59532,"articleLive":2,"columnArticles":711,"formTitle":"[872]叶子相似的树","frequency":2.667902519,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":91288,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5084788118953268,"acs":14243,"articleLive":2,"columnArticles":101,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":1.6719059297,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":28011,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4129225234270415,"acs":19741,"articleLive":2,"columnArticles":216,"formTitle":"[874]模拟行走机器人","frequency":1.6719059297,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","questionId":"906","status":"","submitted":47808,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.47636116577640336,"acs":40666,"articleLive":2,"columnArticles":316,"formTitle":"[875]爱吃香蕉的珂珂","frequency":2.1704854006,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":85368,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7061739879596399,"acs":133606,"articleLive":2,"columnArticles":1511,"formTitle":"[876]链表的中间结点","frequency":2.0263098659,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":189197,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7566740919426138,"acs":65559,"articleLive":2,"columnArticles":471,"formTitle":"[877]石子游戏","frequency":2.8687884398,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":86641,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2792691029900332,"acs":4203,"articleLive":2,"columnArticles":59,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15050,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5560558307068888,"acs":20995,"articleLive":2,"columnArticles":179,"formTitle":"[879]盈利计划","frequency":3.4841579193,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":37757,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2521259979173898,"acs":5811,"articleLive":2,"columnArticles":72,"formTitle":"[880]索引处的解码字符串","frequency":0.3938048023,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23048,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.4788481141692151,"acs":18790,"articleLive":2,"columnArticles":180,"formTitle":"[881]救生艇","frequency":1.6398929527,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"","submitted":39240,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4820886460230723,"acs":1588,"articleLive":2,"columnArticles":28,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3294,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6850331647731004,"acs":10431,"articleLive":2,"columnArticles":102,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15227,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6607513819935917,"acs":18766,"articleLive":2,"columnArticles":240,"formTitle":"[884]两句话中的不常见单词","frequency":0.2507039587,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":28401,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6893724377168086,"acs":4372,"articleLive":2,"columnArticles":65,"formTitle":"[885]螺旋矩阵 III","frequency":1.4951320132,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6342,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.42241196436147643,"acs":7965,"articleLive":2,"columnArticles":105,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":18856,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.29160334234164975,"acs":49311,"articleLive":2,"columnArticles":322,"formTitle":"[887]鸡蛋掉落","frequency":3.2364967445,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":169103,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6394658042879386,"acs":53389,"articleLive":2,"columnArticles":448,"formTitle":"[888]公平的糖果棒交换","frequency":0.2255770086,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":83490,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6795501795501796,"acs":14382,"articleLive":2,"columnArticles":145,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":2.2725106074,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":21164,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7255817903855953,"acs":8543,"articleLive":2,"columnArticles":118,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":11774,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3260895665746188,"acs":2716,"articleLive":2,"columnArticles":37,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8329,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6387642958389157,"acs":32897,"articleLive":2,"columnArticles":674,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":51501,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.723812777587974,"acs":10593,"articleLive":2,"columnArticles":101,"formTitle":"[893]特殊等价字符串组","frequency":0.3327171103,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14635,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7743123772102161,"acs":12612,"articleLive":2,"columnArticles":115,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":16288,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5391787852865697,"acs":6303,"articleLive":2,"columnArticles":74,"formTitle":"[895]最大频率栈","frequency":1.1969752486,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":11690,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5865779513609277,"acs":58273,"articleLive":2,"columnArticles":707,"formTitle":"[896]单调数列","frequency":1.9600604803,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":99344,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7454859918551592,"acs":60775,"articleLive":2,"columnArticles":697,"formTitle":"[897]递增顺序搜索树","frequency":2.8562159835,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":81524,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.33404173106646057,"acs":5187,"articleLive":2,"columnArticles":36,"formTitle":"[898]子数组按位或操作","frequency":1.229022426,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15528,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5347165717385408,"acs":3943,"articleLive":2,"columnArticles":38,"formTitle":"[899]有序队列","frequency":0.3327171103,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7374,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4927312094030312,"acs":3186,"articleLive":2,"columnArticles":39,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6466,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5405304908279623,"acs":17444,"articleLive":2,"columnArticles":218,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":32272,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.325831096427834,"acs":3156,"articleLive":2,"columnArticles":72,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":9686,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5307335190343547,"acs":2858,"articleLive":2,"columnArticles":41,"formTitle":"[903]DI 序列的有效排列","frequency":0.6978998714,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5385,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.45182447556087657,"acs":17360,"articleLive":2,"columnArticles":241,"formTitle":"[904]水果成篮","frequency":1.6719059297,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":38422,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7015319796068459,"acs":56279,"articleLive":2,"columnArticles":579,"formTitle":"[905]按奇偶排序数组","frequency":1.4623744168,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":80223,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2719621251972646,"acs":2068,"articleLive":2,"columnArticles":34,"formTitle":"[906]超级回文数","frequency":1.9348384624,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7604,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3151350706661101,"acs":10569,"articleLive":2,"columnArticles":120,"formTitle":"[907]子数组的最小值之和","frequency":1.6719059297,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":33538,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6979377133700272,"acs":20035,"articleLive":2,"columnArticles":179,"formTitle":"[908]最小差值 I","frequency":0.2768834642,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":28706,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.4616363478612951,"acs":15962,"articleLive":2,"columnArticles":191,"formTitle":"[909]蛇梯棋","frequency":1.9870891527,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":34577,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3169333532725188,"acs":6358,"articleLive":2,"columnArticles":63,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20061,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.430530456043372,"acs":4050,"articleLive":2,"columnArticles":61,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":9407,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5671918468993987,"acs":202247,"articleLive":2,"columnArticles":985,"formTitle":"[912]排序数组","frequency":4.0324965079,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":356576,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.401910686514108,"acs":1809,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":0.3938048023,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4501,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3889152517835168,"acs":48355,"articleLive":2,"columnArticles":607,"formTitle":"[914]卡牌分组","frequency":0.8353654542,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":124333,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46786429248761985,"acs":8881,"articleLive":2,"columnArticles":108,"formTitle":"[915]分割数组","frequency":0.8660803995,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":18982,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4385277995301488,"acs":6160,"articleLive":2,"columnArticles":66,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14047,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5693537401338195,"acs":28421,"articleLive":2,"columnArticles":418,"formTitle":"[917]仅仅反转字母","frequency":1.7395770104,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":49918,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.35837027558155476,"acs":15683,"articleLive":2,"columnArticles":190,"formTitle":"[918]环形子数组的最大和","frequency":1.4308011549,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":43762,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6249208560212739,"acs":4935,"articleLive":2,"columnArticles":89,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":7897,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.47905331882480956,"acs":1761,"articleLive":2,"columnArticles":18,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3676,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7349946704892123,"acs":19997,"articleLive":2,"columnArticles":289,"formTitle":"[921]使括号有效的最少添加","frequency":0.3327171103,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":27207,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7144849828663576,"acs":88614,"articleLive":2,"columnArticles":814,"formTitle":"[922]按奇偶排序数组 II","frequency":0.8353654542,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":124025,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.33808209921729826,"acs":6004,"articleLive":2,"columnArticles":79,"formTitle":"[923]三数之和的多种可能","frequency":0.8660803995,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":17759,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3596432688224231,"acs":5928,"articleLive":2,"columnArticles":89,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":16483,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3883139689856845,"acs":49531,"articleLive":2,"columnArticles":665,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":127554,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5146454049517415,"acs":6132,"articleLive":2,"columnArticles":109,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.8660803995,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":11915,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3375240798945554,"acs":3329,"articleLive":2,"columnArticles":65,"formTitle":"[927]三等分","frequency":1.8127357656,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":9863,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.42026117926394935,"acs":2124,"articleLive":2,"columnArticles":40,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5054,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6422554137164711,"acs":24854,"articleLive":2,"columnArticles":224,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":38698,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.544963909674856,"acs":32918,"articleLive":2,"columnArticles":335,"formTitle":"[930]和相同的二元子数组","frequency":2.5599501674,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":60404,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6585541529246749,"acs":17372,"articleLive":2,"columnArticles":216,"formTitle":"[931]下降路径最小和","frequency":1.1363444987,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":26379,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6266073979996825,"acs":7894,"articleLive":2,"columnArticles":74,"formTitle":"[932]漂亮数组","frequency":0.8353654542,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":12598,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7233052018451989,"acs":34025,"articleLive":2,"columnArticles":291,"formTitle":"[933]最近的请求次数","frequency":1.6719059297,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":47041,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47525017869907077,"acs":21276,"articleLive":2,"columnArticles":243,"formTitle":"[934]最短的桥","frequency":2.1901811569,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":44768,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4748213125406108,"acs":5846,"articleLive":2,"columnArticles":78,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12312,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.3788109756097561,"acs":1491,"articleLive":2,"columnArticles":24,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":3936,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5883144439269264,"acs":11368,"articleLive":2,"columnArticles":119,"formTitle":"[937]重新排列日志文件","frequency":0.8353654542,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":19323,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8181082500408929,"acs":95029,"articleLive":2,"columnArticles":780,"formTitle":"[938]二叉搜索树的范围和","frequency":2.4642102497,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":116157,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4501145778247841,"acs":5107,"articleLive":2,"columnArticles":59,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":11346,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.41190972880713067,"acs":4344,"articleLive":2,"columnArticles":53,"formTitle":"[940]不同的子序列 II","frequency":0.2768834642,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"","submitted":10546,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3926390248930578,"acs":60947,"articleLive":2,"columnArticles":602,"formTitle":"[941]有效的山脉数组","frequency":0.2507039587,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":155224,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7288062283737025,"acs":21905,"articleLive":2,"columnArticles":201,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":30056,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4735143855875235,"acs":1761,"articleLive":2,"columnArticles":41,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":3719,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6902925531914894,"acs":20764,"articleLive":2,"columnArticles":173,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30080,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4869761228919686,"acs":34998,"articleLive":2,"columnArticles":533,"formTitle":"[945]使数组唯一的最小增量","frequency":1.4623744168,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":71868,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6215149034525931,"acs":25814,"articleLive":2,"columnArticles":285,"formTitle":"[946]验证栈序列","frequency":2.3969888579,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":41534,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6129397317666322,"acs":25456,"articleLive":2,"columnArticles":331,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":41531,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3913690476190476,"acs":6575,"articleLive":2,"columnArticles":93,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":16800,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.36954511834319526,"acs":7994,"articleLive":2,"columnArticles":115,"formTitle":"[949]给定数字能组成的最大时间","frequency":1.6719059297,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":21632,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7746779355050464,"acs":9441,"articleLive":2,"columnArticles":136,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.8353654542,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12187,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6614985444880395,"acs":10453,"articleLive":2,"columnArticles":159,"formTitle":"[951]翻转等价二叉树","frequency":1.4308011549,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":15802,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.34819379002053885,"acs":2882,"articleLive":2,"columnArticles":52,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8277,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5527363605557438,"acs":13049,"articleLive":2,"columnArticles":154,"formTitle":"[953]验证外星语词典","frequency":1.1969752486,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":23608,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.2988369541364933,"acs":6809,"articleLive":2,"columnArticles":100,"formTitle":"[954]二倍数对数组","frequency":1.4623744168,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":22785,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3299839657936932,"acs":3087,"articleLive":2,"columnArticles":47,"formTitle":"[955]删列造序 II","frequency":0.3041926436,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9355,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4350028137310073,"acs":3865,"articleLive":2,"columnArticles":49,"formTitle":"[956]最高的广告牌","frequency":1.2970141712,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":8885,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.35957245155855094,"acs":13658,"articleLive":2,"columnArticles":131,"formTitle":"[957]N 天后的牢房","frequency":1.2623366327,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":37984,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5363451086956522,"acs":22106,"articleLive":2,"columnArticles":213,"formTitle":"[958]二叉树的完全性检验","frequency":1.6719059297,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":41216,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7437011962918798,"acs":19334,"articleLive":2,"columnArticles":298,"formTitle":"[959]由斜杠划分区域","frequency":1.1969752486,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":25997,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5522733854619172,"acs":1907,"articleLive":2,"columnArticles":29,"formTitle":"[960]删列造序 III","frequency":0.3938048023,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3453,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6767434329580738,"acs":35527,"articleLive":2,"columnArticles":283,"formTitle":"[961]重复 N 次的元素","frequency":0.8353654542,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":52497,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.44126782436820555,"acs":12502,"articleLive":2,"columnArticles":118,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":28332,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5025578064252098,"acs":2456,"articleLive":2,"columnArticles":31,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":4887,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4256488549618321,"acs":1394,"articleLive":2,"columnArticles":24,"formTitle":"[964]表示数字的最少运算符","frequency":1.0018055493,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3275,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6839572769446542,"acs":31698,"articleLive":2,"columnArticles":373,"formTitle":"[965]单值二叉树","frequency":0.2768834642,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":46345,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.40216949152542375,"acs":2966,"articleLive":2,"columnArticles":45,"formTitle":"[966]元音拼写检查器","frequency":0.4966987206,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7375,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.4577747149480015,"acs":7307,"articleLive":2,"columnArticles":139,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":15962,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4961308959031775,"acs":23530,"articleLive":2,"columnArticles":313,"formTitle":"[968]监控二叉树","frequency":1.7815319859,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":47427,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6521563523762509,"acs":14532,"articleLive":2,"columnArticles":187,"formTitle":"[969]煎饼排序","frequency":0.3041926436,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":22283,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4144071691176471,"acs":10821,"articleLive":2,"columnArticles":121,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26112,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4427991886409736,"acs":6549,"articleLive":2,"columnArticles":99,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.3938048023,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":14790,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4104180491041805,"acs":1237,"articleLive":2,"columnArticles":26,"formTitle":"[972]相等的有理数","frequency":0.8058212079,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3014,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6383547638708663,"acs":64936,"articleLive":2,"columnArticles":622,"formTitle":"[973]最接近原点的 K 个点","frequency":0.8353654542,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":101724,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.46525230106403814,"acs":35636,"articleLive":2,"columnArticles":372,"formTitle":"[974]和可被 K 整除的子数组","frequency":2.7000389606,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":76595,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4420846513029071,"acs":2935,"articleLive":2,"columnArticles":43,"formTitle":"[975]奇偶跳","frequency":0.3625522588,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6639,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5970222196965392,"acs":52529,"articleLive":2,"columnArticles":486,"formTitle":"[976]三角形的最大周长","frequency":1.229022426,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"","submitted":87985,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7179855612598723,"acs":143908,"articleLive":2,"columnArticles":1130,"formTitle":"[977]有序数组的平方","frequency":2.3456753126,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":200433,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47357110247530815,"acs":42530,"articleLive":2,"columnArticles":590,"formTitle":"[978]最长湍流子数组","frequency":0.8353654542,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":89807,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7122604358099238,"acs":8139,"articleLive":2,"columnArticles":128,"formTitle":"[979]在二叉树中分配硬币","frequency":0.8660803995,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11427,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7330851408222726,"acs":13587,"articleLive":2,"columnArticles":200,"formTitle":"[980]不同路径 III","frequency":1.2970141712,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":18534,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5356764165826157,"acs":20713,"articleLive":2,"columnArticles":304,"formTitle":"[981]基于时间的键值存储","frequency":2.5847039065,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":38667,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5416852429781542,"acs":2430,"articleLive":2,"columnArticles":24,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4486,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6335074327038972,"acs":31536,"articleLive":2,"columnArticles":445,"formTitle":"[983]最低票价","frequency":2.3043300274,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":49780,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4159097428052395,"acs":8700,"articleLive":2,"columnArticles":137,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":20918,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.598997118586985,"acs":16007,"articleLive":2,"columnArticles":177,"formTitle":"[985]查询后的偶数和","frequency":0.2768834642,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":26723,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6760942969548651,"acs":21825,"articleLive":2,"columnArticles":214,"formTitle":"[986]区间列表的交集","frequency":2.2119282355,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":32281,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5322530900808996,"acs":22435,"articleLive":2,"columnArticles":405,"formTitle":"[987]二叉树的垂序遍历","frequency":1.4355847086,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":42151,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4953737866833173,"acs":8727,"articleLive":2,"columnArticles":106,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":17617,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4730184713257315,"acs":50858,"articleLive":2,"columnArticles":574,"formTitle":"[989]数组形式的整数加法","frequency":0.8058212079,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":107518,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.4986563759647533,"acs":31917,"articleLive":2,"columnArticles":484,"formTitle":"[990]等式方程的可满足性","frequency":0.2768834642,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":64006,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5177444069874348,"acs":8447,"articleLive":2,"columnArticles":106,"formTitle":"[991]坏了的计算器","frequency":0.8980524322,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16315,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45115615967502537,"acs":23101,"articleLive":2,"columnArticles":268,"formTitle":"[992]K 个不同整数的子数组","frequency":0.8660803995,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":51204,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5576064204882526,"acs":49816,"articleLive":2,"columnArticles":786,"formTitle":"[993]二叉树的堂兄弟节点","frequency":2.430005062,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":89339,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5090207518672543,"acs":49205,"articleLive":2,"columnArticles":1333,"formTitle":"[994]腐烂的橘子","frequency":1.8450487545,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":96666,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5402466110132496,"acs":21162,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":1.229022426,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39171,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49651777137367914,"acs":4135,"articleLive":2,"columnArticles":84,"formTitle":"[996]正方形数组的数目","frequency":1.1218535916,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8328,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5122618703723413,"acs":33693,"articleLive":2,"columnArticles":362,"formTitle":"[997]找到小镇的法官","frequency":0.7499407495,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":65773,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6142562834775442,"acs":7454,"articleLive":2,"columnArticles":107,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12135,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6913614311006875,"acs":30068,"articleLive":2,"columnArticles":564,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.2768834642,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":43491,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4065443129678821,"acs":3367,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":1.7395770104,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8282,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29132947976878615,"acs":2016,"articleLive":2,"columnArticles":50,"formTitle":"[1001]网格照明","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":6920,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7377143622722401,"acs":55063,"articleLive":2,"columnArticles":584,"formTitle":"[1002]查找常用字符","frequency":1.9600604803,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":74640,"title":"查找常用字符","titleSlug":"find-common-characters"},{"acceptance":0.5758062162556544,"acs":11838,"articleLive":2,"columnArticles":178,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":20559,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5985977295675232,"acs":63434,"articleLive":2,"columnArticles":679,"formTitle":"[1004]最大连续1的个数 III","frequency":2.4969142761,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"","submitted":105971,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5377200724671343,"acs":23151,"articleLive":2,"columnArticles":381,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":1.0798482563,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":43054,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6276720226033848,"acs":43986,"articleLive":2,"columnArticles":594,"formTitle":"[1006]笨阶乘","frequency":2.4996909759,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70078,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46389795763419633,"acs":6110,"articleLive":2,"columnArticles":81,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13171,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7266759588148015,"acs":16162,"articleLive":2,"columnArticles":211,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":1.9925912299,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":22241,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5924270837489526,"acs":14848,"articleLive":2,"columnArticles":204,"formTitle":"[1009]十进制整数的反码","frequency":0.2768834642,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":25063,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.44961298377028713,"acs":18007,"articleLive":2,"columnArticles":240,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40050,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6271610555050046,"acs":57897,"articleLive":2,"columnArticles":558,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":3.2946494733,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":92316,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3293615107913669,"acs":2930,"articleLive":2,"columnArticles":63,"formTitle":"[1012]至少有 1 位重复的数字","frequency":1.1218535916,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":8896,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.3982735758300616,"acs":45954,"articleLive":2,"columnArticles":909,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":1.7395770104,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":115383,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5451591020240744,"acs":34556,"articleLive":2,"columnArticles":419,"formTitle":"[1014]最佳观光组合","frequency":0.7773697867,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":63387,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35353459308891066,"acs":4696,"articleLive":2,"columnArticles":40,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.8980524322,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13283,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5833044683062002,"acs":5052,"articleLive":2,"columnArticles":78,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8661,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5616393442622951,"acs":3426,"articleLive":2,"columnArticles":52,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6100,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5167114046131553,"acs":43504,"articleLive":2,"columnArticles":369,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":84194,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5972983735105829,"acs":19500,"articleLive":2,"columnArticles":255,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.2768834642,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":32647,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5365325077399381,"acs":8665,"articleLive":2,"columnArticles":130,"formTitle":"[1020]飞地的数量","frequency":1.1969752486,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":16150,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7834569784372183,"acs":56499,"articleLive":2,"columnArticles":639,"formTitle":"[1021]删除最外层的括号","frequency":1.4623744168,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":72115,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7024424699802967,"acs":18895,"articleLive":2,"columnArticles":249,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.2768834642,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":26899,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5646098156410472,"acs":6707,"articleLive":2,"columnArticles":145,"formTitle":"[1023]驼峰式匹配","frequency":0.2768834642,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":11879,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5606563613099561,"acs":32425,"articleLive":2,"columnArticles":371,"formTitle":"[1024]视频拼接","frequency":0.8058212079,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":57834,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7096138502504158,"acs":73819,"articleLive":2,"columnArticles":635,"formTitle":"[1025]除数博弈","frequency":2.088441647,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":104027,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6678051160521363,"acs":9581,"articleLive":2,"columnArticles":163,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14347,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.433234010117109,"acs":12504,"articleLive":2,"columnArticles":113,"formTitle":"[1027]最长等差数列","frequency":1.4951320132,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":28862,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7319322482272109,"acs":19921,"articleLive":2,"columnArticles":417,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.8660803995,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27217,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6525167987768077,"acs":16217,"articleLive":2,"columnArticles":174,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"","submitted":24853,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7121637468462386,"acs":40082,"articleLive":2,"columnArticles":440,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.3327171103,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":56282,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5668501529051988,"acs":4634,"articleLive":2,"columnArticles":69,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.3041926436,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8175,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39453317964762064,"acs":2396,"articleLive":2,"columnArticles":38,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6073,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.38913585601214357,"acs":10767,"articleLive":2,"columnArticles":161,"formTitle":"[1033]移动石子直到连续","frequency":0.2768834642,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":27669,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4321318228630278,"acs":4196,"articleLive":2,"columnArticles":90,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":9710,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6274118555051484,"acs":33330,"articleLive":2,"columnArticles":367,"formTitle":"[1035]不相交的线","frequency":2.9322912281,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":53123,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.2997881355932203,"acs":3113,"articleLive":2,"columnArticles":52,"formTitle":"[1036]逃离大迷宫","frequency":0.3041926436,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10384,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.4387293422869934,"acs":9212,"articleLive":2,"columnArticles":104,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":20997,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7936178620825923,"acs":24099,"articleLive":2,"columnArticles":307,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.2507039587,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":30366,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5534042826003334,"acs":4316,"articleLive":2,"columnArticles":58,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":7799,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5240532241555783,"acs":2560,"articleLive":2,"columnArticles":28,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":4885,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.48090861540760665,"acs":6436,"articleLive":2,"columnArticles":109,"formTitle":"[1041]困于环中的机器人","frequency":1.1969752486,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":13383,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.526348929574736,"acs":10867,"articleLive":2,"columnArticles":145,"formTitle":"[1042]不邻接植花","frequency":0.8058212079,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":20646,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6902030838661151,"acs":7341,"articleLive":2,"columnArticles":97,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":10636,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20937487659440035,"acs":5302,"articleLive":2,"columnArticles":69,"formTitle":"[1044]最长重复子串","frequency":2.5599501674,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":25323,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6446030183727034,"acs":7859,"articleLive":2,"columnArticles":97,"formTitle":"[1045]买下所有产品的客户","frequency":0.2768834642,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"","submitted":12192,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6595668092808952,"acs":64131,"articleLive":2,"columnArticles":894,"formTitle":"[1046]最后一块石头的重量","frequency":1.4951320132,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":97232,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7259836679488951,"acs":99838,"articleLive":2,"columnArticles":944,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":3.7043785933,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":137521,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.45026929982046676,"acs":8778,"articleLive":2,"columnArticles":123,"formTitle":"[1048]最长字符串链","frequency":1.4951320132,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":19495,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6416729341748144,"acs":39246,"articleLive":2,"columnArticles":382,"formTitle":"[1049]最后一块石头的重量 II","frequency":2.8562159835,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":61162,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7569288660539837,"acs":10460,"articleLive":2,"columnArticles":49,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.2768834642,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"","submitted":13819,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7518006088656783,"acs":30375,"articleLive":2,"columnArticles":356,"formTitle":"[1051]高度检查器","frequency":0.2768834642,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":40403,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5808950406554528,"acs":46794,"articleLive":2,"columnArticles":735,"formTitle":"[1052]爱生气的书店老板","frequency":1.6719059297,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":80555,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.45890085524231866,"acs":5795,"articleLive":2,"columnArticles":92,"formTitle":"[1053]交换一次的先前排列","frequency":0.8353654542,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":12628,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37534206411258797,"acs":7681,"articleLive":2,"columnArticles":104,"formTitle":"[1054]距离相等的条形码","frequency":0.8353654542,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":20464,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5865797864966034,"acs":4231,"articleLive":2,"columnArticles":74,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"","submitted":7213,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4060339409176619,"acs":3230,"articleLive":2,"columnArticles":60,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"","submitted":7955,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4609895337773549,"acs":2907,"articleLive":2,"columnArticles":36,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"","submitted":6306,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3380058185665168,"acs":1278,"articleLive":2,"columnArticles":28,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"","submitted":3781,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.35902287975227937,"acs":2087,"articleLive":2,"columnArticles":35,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"","submitted":5813,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5288737914815783,"acs":4048,"articleLive":2,"columnArticles":59,"formTitle":"[1060]有序数组中的缺失元素","frequency":1.4623744168,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"","submitted":7654,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.5988584474885845,"acs":2623,"articleLive":2,"columnArticles":57,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"","submitted":4380,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5354102826012939,"acs":3145,"articleLive":2,"columnArticles":39,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"","submitted":5874,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.6980676328502415,"acs":1734,"articleLive":2,"columnArticles":37,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"","submitted":2484,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6509513150531617,"acs":4653,"articleLive":2,"columnArticles":66,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"","submitted":7148,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5372585096596136,"acs":2336,"articleLive":2,"columnArticles":64,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"","submitted":4348,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.471923828125,"acs":1933,"articleLive":2,"columnArticles":38,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"","submitted":4096,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4195095948827292,"acs":787,"articleLive":2,"columnArticles":25,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"","submitted":1876,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8642816980601631,"acs":12297,"articleLive":2,"columnArticles":58,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"","submitted":14228,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.820229158435401,"acs":10380,"articleLive":2,"columnArticles":51,"formTitle":"[1069]产品销售分析 II","frequency":0.2768834642,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"","submitted":12655,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.4833790381914253,"acs":7227,"articleLive":2,"columnArticles":64,"formTitle":"[1070]产品销售分析 III","frequency":0.2768834642,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"","submitted":14951,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5865111718870942,"acs":34098,"articleLive":2,"columnArticles":659,"formTitle":"[1071]字符串的最大公因子","frequency":0.2768834642,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":58137,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5781533987640858,"acs":3181,"articleLive":2,"columnArticles":51,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.4966987206,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5502,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.337080270932411,"acs":2339,"articleLive":2,"columnArticles":51,"formTitle":"[1073]负二进制数相加","frequency":0.4966987206,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":6939,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6699719846652905,"acs":18175,"articleLive":2,"columnArticles":184,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":2.2690405504,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27128,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6955766192733017,"acs":8806,"articleLive":2,"columnArticles":68,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"","submitted":12660,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4979205053961569,"acs":9458,"articleLive":2,"columnArticles":81,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"","submitted":18995,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7215803589849391,"acs":6995,"articleLive":2,"columnArticles":83,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"","submitted":9694,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6218957294008004,"acs":11344,"articleLive":2,"columnArticles":171,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":18241,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7350170648464164,"acs":10768,"articleLive":2,"columnArticles":178,"formTitle":"[1079]活字印刷","frequency":0.2507039587,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":14650,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.48980330638349223,"acs":4059,"articleLive":2,"columnArticles":80,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8287,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5717720207253886,"acs":13794,"articleLive":2,"columnArticles":133,"formTitle":"[1081]不同字符的最小子序列","frequency":2.0263098659,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":24125,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7595900647640738,"acs":10673,"articleLive":2,"columnArticles":89,"formTitle":"[1082]销售分析 I ","frequency":0.3327171103,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"","submitted":14051,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5273607484769365,"acs":9695,"articleLive":2,"columnArticles":93,"formTitle":"[1083]销售分析 II","frequency":0.8660803995,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"","submitted":18384,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5391084945332212,"acs":9615,"articleLive":2,"columnArticles":93,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"","submitted":17835,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7731573157315732,"acs":3514,"articleLive":2,"columnArticles":70,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"","submitted":4545,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6899018232819074,"acs":4919,"articleLive":2,"columnArticles":76,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"","submitted":7130,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5304428044280443,"acs":1725,"articleLive":2,"columnArticles":50,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"","submitted":3252,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.44483985765124556,"acs":1000,"articleLive":2,"columnArticles":33,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"","submitted":2248,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5854074542008844,"acs":18534,"articleLive":2,"columnArticles":274,"formTitle":"[1089]复写零","frequency":0.2507039587,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":31660,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5411174785100287,"acs":3777,"articleLive":2,"columnArticles":75,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":6980,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.37742580347531907,"acs":24544,"articleLive":2,"columnArticles":257,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":1.9600604803,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":65030,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4880095923261391,"acs":2442,"articleLive":2,"columnArticles":46,"formTitle":"[1092]最短公共超序列","frequency":0.9313777419,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5004,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.38715676621813805,"acs":3539,"articleLive":2,"columnArticles":53,"formTitle":"[1093]大样本统计","frequency":0.4966987206,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9141,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6183296760036143,"acs":23951,"articleLive":2,"columnArticles":355,"formTitle":"[1094]拼车","frequency":0.7773697867,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":38735,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3730464148276133,"acs":19000,"articleLive":2,"columnArticles":377,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":50932,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5590083798882681,"acs":1601,"articleLive":2,"columnArticles":45,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":2864,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.521341178668161,"acs":5582,"articleLive":2,"columnArticles":98,"formTitle":"[1097]游戏玩法分析 V","frequency":1.5645561361,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"","submitted":10707,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.47489995085305065,"acs":6764,"articleLive":2,"columnArticles":95,"formTitle":"[1098]小众书籍","frequency":0.8660803995,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"","submitted":14243,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5794463405384908,"acs":4584,"articleLive":2,"columnArticles":84,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"","submitted":7911,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6975488765684272,"acs":4781,"articleLive":2,"columnArticles":95,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"","submitted":6854,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6687045123726346,"acs":2297,"articleLive":2,"columnArticles":50,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"","submitted":3435,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.36572077185017027,"acs":4833,"articleLive":2,"columnArticles":62,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"","submitted":13215,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6364416058394161,"acs":34877,"articleLive":2,"columnArticles":1091,"formTitle":"[1103]分糖果 II","frequency":0.8353654542,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":54800,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.761332074962923,"acs":28234,"articleLive":2,"columnArticles":659,"formTitle":"[1104]二叉树寻路","frequency":1.0269957982,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37085,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5556171675723633,"acs":5010,"articleLive":2,"columnArticles":64,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9017,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5731208574249048,"acs":4064,"articleLive":2,"columnArticles":119,"formTitle":"[1106]解析布尔表达式","frequency":0.8980524322,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7091,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41132688273902157,"acs":6079,"articleLive":2,"columnArticles":82,"formTitle":"[1107]每日新用户统计","frequency":0.3041926436,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"","submitted":14779,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8390374807636054,"acs":65971,"articleLive":2,"columnArticles":670,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":78627,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.507558038052016,"acs":29078,"articleLive":2,"columnArticles":270,"formTitle":"[1109]航班预订统计","frequency":1.9286395831,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"","submitted":57290,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6264720019226148,"acs":10427,"articleLive":2,"columnArticles":194,"formTitle":"[1110]删点成林","frequency":0.8980524322,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":16644,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.772565512779036,"acs":23880,"articleLive":2,"columnArticles":396,"formTitle":"[1111]有效括号的嵌套深度","frequency":1.229022426,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":30910,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6413043478260869,"acs":7021,"articleLive":2,"columnArticles":79,"formTitle":"[1112]每位学生的最高成绩","frequency":0.8353654542,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"","submitted":10948,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5430605592726025,"acs":6331,"articleLive":2,"columnArticles":45,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"","submitted":11658,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6525595449697832,"acs":73426,"articleLive":2,"columnArticles":550,"formTitle":"[1114]按序打印","frequency":3.9667103591,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":112520,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5610331228108884,"acs":40685,"articleLive":2,"columnArticles":464,"formTitle":"[1115]交替打印FooBar","frequency":2.7677237874,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":72518,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5146457765667575,"acs":21154,"articleLive":2,"columnArticles":349,"formTitle":"[1116]打印零与奇偶数","frequency":2.7332867038,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":41104,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5208764610337909,"acs":16355,"articleLive":2,"columnArticles":241,"formTitle":"[1117]H2O 生成","frequency":2.2022005323,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":31399,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6404816513761468,"acs":2234,"articleLive":2,"columnArticles":34,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"","submitted":3488,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8661092294665538,"acs":8183,"articleLive":2,"columnArticles":141,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"","submitted":9448,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6027529582226515,"acs":2496,"articleLive":2,"columnArticles":45,"formTitle":"[1120]子树的最大平均值","frequency":0.3327171103,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"","submitted":4141,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.571042679632631,"acs":1057,"articleLive":2,"columnArticles":17,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"","submitted":1851,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.707025795135902,"acs":63288,"articleLive":2,"columnArticles":853,"formTitle":"[1122]数组的相对排序","frequency":2.4498082495,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":89513,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7043398812243034,"acs":7709,"articleLive":2,"columnArticles":99,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":10945,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.31484132975815476,"acs":12094,"articleLive":2,"columnArticles":125,"formTitle":"[1124]表现良好的最长时间段","frequency":0.3327171103,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":38413,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.490129913953096,"acs":2905,"articleLive":2,"columnArticles":49,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":5927,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6959929212488939,"acs":5506,"articleLive":2,"columnArticles":83,"formTitle":"[1126]查询活跃业务","frequency":0.2768834642,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"","submitted":7911,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.41819018052201906,"acs":3637,"articleLive":2,"columnArticles":67,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"","submitted":8697,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5448843707270673,"acs":36662,"articleLive":2,"columnArticles":474,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.8058212079,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":67284,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.37865803339046533,"acs":5965,"articleLive":2,"columnArticles":106,"formTitle":"[1129]颜色交替的最短路径","frequency":0.3327171103,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":15753,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6266963292547275,"acs":5634,"articleLive":2,"columnArticles":98,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":8990,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4525670498084291,"acs":2953,"articleLive":2,"columnArticles":43,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6525,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3934653831914106,"acs":4251,"articleLive":2,"columnArticles":46,"formTitle":"[1132]报告的记录 II","frequency":0.8353654542,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"","submitted":10804,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.643398392652124,"acs":2802,"articleLive":2,"columnArticles":57,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"","submitted":4355,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7738998482549317,"acs":3060,"articleLive":2,"columnArticles":50,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"","submitted":3954,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5345339769773487,"acs":5758,"articleLive":2,"columnArticles":68,"formTitle":"[1135]最低成本联通所有城市","frequency":1.1661086006,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"","submitted":10772,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5664478152592257,"acs":2502,"articleLive":2,"columnArticles":47,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"","submitted":4417,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6054211889152112,"acs":65934,"articleLive":2,"columnArticles":786,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.6185183208,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":108906,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43137966052517046,"acs":5947,"articleLive":2,"columnArticles":134,"formTitle":"[1138]字母板上的路径","frequency":0.3041926436,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":13786,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4763744113445156,"acs":9003,"articleLive":2,"columnArticles":144,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.8980524322,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":18899,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6540016168148747,"acs":6472,"articleLive":2,"columnArticles":93,"formTitle":"[1140]石子游戏 II","frequency":0.3327171103,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":9896,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5126050420168067,"acs":9272,"articleLive":2,"columnArticles":63,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.2768834642,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"","submitted":18088,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3713871154962275,"acs":6399,"articleLive":2,"columnArticles":48,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"","submitted":17230,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6321502761311243,"acs":149721,"articleLive":2,"columnArticles":1035,"formTitle":"[1143]最长公共子序列","frequency":3.9485586874,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":236844,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44165422776363156,"acs":10060,"articleLive":2,"columnArticles":142,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":1.1661086006,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":22778,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4687522788594764,"acs":6428,"articleLive":2,"columnArticles":103,"formTitle":"[1145]二叉树着色游戏","frequency":1.7051051014,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":13713,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2862448117672759,"acs":3931,"articleLive":2,"columnArticles":59,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":13733,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5546038543897216,"acs":3626,"articleLive":2,"columnArticles":72,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":6538,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7183070671027852,"acs":7247,"articleLive":2,"columnArticles":32,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"","submitted":10089,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.4439819004524887,"acs":4906,"articleLive":2,"columnArticles":43,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"","submitted":11050,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6073034473361494,"acs":4457,"articleLive":2,"columnArticles":79,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.8980524322,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"","submitted":7339,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.4831204956378809,"acs":3821,"articleLive":2,"columnArticles":54,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.7773697867,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"","submitted":7909,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.38277945619335346,"acs":1267,"articleLive":2,"columnArticles":29,"formTitle":"[1152]用户网站访问行为分析","frequency":0.7499407495,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"","submitted":3310,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.37108759288448545,"acs":1648,"articleLive":2,"columnArticles":23,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"","submitted":4441,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5653725078698846,"acs":13470,"articleLive":2,"columnArticles":214,"formTitle":"[1154]一年中的第几天","frequency":0.2507039587,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":23825,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.47950449253017174,"acs":9019,"articleLive":2,"columnArticles":120,"formTitle":"[1155]掷骰子的N种方法","frequency":0.3041926436,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":18809,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.43423703975087014,"acs":4741,"articleLive":2,"columnArticles":74,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.3041926436,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":10918,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.312506899216249,"acs":2831,"articleLive":2,"columnArticles":43,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.4966987206,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9059,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5518717751674168,"acs":5027,"articleLive":2,"columnArticles":57,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"","submitted":9109,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.4957486669548926,"acs":3440,"articleLive":2,"columnArticles":73,"formTitle":"[1159]市场分析 II","frequency":0.966163858,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"","submitted":6939,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6877332199707147,"acs":58240,"articleLive":2,"columnArticles":896,"formTitle":"[1160]拼写单词","frequency":0.8353654542,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":84684,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6342664754660515,"acs":10173,"articleLive":2,"columnArticles":163,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16039,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4688578035558588,"acs":37104,"articleLive":2,"columnArticles":486,"formTitle":"[1162]地图分析","frequency":1.5645561361,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":79137,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2671280924098583,"acs":5712,"articleLive":2,"columnArticles":94,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.3625522588,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":21383,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6177026707634129,"acs":5227,"articleLive":2,"columnArticles":75,"formTitle":"[1164]指定日期的产品价格","frequency":0.8660803995,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"","submitted":8462,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8381587876046144,"acs":7411,"articleLive":2,"columnArticles":110,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"","submitted":8842,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4817474566128067,"acs":2415,"articleLive":2,"columnArticles":44,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"","submitted":5013,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.4199142634450507,"acs":2155,"articleLive":2,"columnArticles":33,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"","submitted":5132,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5689981096408318,"acs":1505,"articleLive":2,"columnArticles":23,"formTitle":"[1168]水资源分配优化","frequency":0.532340412,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"","submitted":2645,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3224590976698066,"acs":6504,"articleLive":2,"columnArticles":76,"formTitle":"[1169]查询无效交易","frequency":0.9313777419,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20170,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6172046955245781,"acs":13460,"articleLive":2,"columnArticles":209,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.3327171103,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":21808,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47170310963153517,"acs":12469,"articleLive":2,"columnArticles":148,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.3041926436,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":26434,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2703804347826087,"acs":2388,"articleLive":2,"columnArticles":50,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":8832,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7583695762111864,"acs":7498,"articleLive":2,"columnArticles":72,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"","submitted":9887,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6190804915090432,"acs":4484,"articleLive":2,"columnArticles":56,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"","submitted":7243,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.48748231966053746,"acs":6893,"articleLive":2,"columnArticles":106,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14140,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4445040790038643,"acs":4141,"articleLive":2,"columnArticles":56,"formTitle":"[1176]健身计划评估","frequency":0.3625522588,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"","submitted":9316,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26345206937852106,"acs":5939,"articleLive":2,"columnArticles":89,"formTitle":"[1177]构建回文串检测","frequency":0.3327171103,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":22543,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4621297478654949,"acs":18457,"articleLive":2,"columnArticles":181,"formTitle":"[1178]猜字谜","frequency":2.1901811569,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":39939,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6339123498914344,"acs":28611,"articleLive":2,"columnArticles":173,"formTitle":"[1179]重新格式化部门表","frequency":2.5693047726,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":45134,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7729022324865281,"acs":3012,"articleLive":2,"columnArticles":64,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.3625522588,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"","submitted":3897,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3689839572192513,"acs":1449,"articleLive":2,"columnArticles":27,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"","submitted":3927,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.3839419175742046,"acs":1798,"articleLive":2,"columnArticles":36,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"","submitted":4683,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5990430622009569,"acs":626,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"","submitted":1045,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5849218538260006,"acs":12949,"articleLive":2,"columnArticles":250,"formTitle":"[1184]公交站间的距离","frequency":0.8353654542,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22138,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6100904545199168,"acs":10859,"articleLive":2,"columnArticles":192,"formTitle":"[1185]一周中的第几天","frequency":0.8058212079,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":17799,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39072518240106124,"acs":7069,"articleLive":2,"columnArticles":104,"formTitle":"[1186]删除一次得到子数组最大和","frequency":1.3331626853,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":18092,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.43687872763419483,"acs":1758,"articleLive":2,"columnArticles":31,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4024,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6917514124293785,"acs":3061,"articleLive":2,"columnArticles":63,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"","submitted":4425,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6445382450754669,"acs":20156,"articleLive":2,"columnArticles":309,"formTitle":"[1189]“气球” 的最大数量","frequency":0.2507039587,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":31272,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6510615467157201,"acs":42472,"articleLive":2,"columnArticles":594,"formTitle":"[1190]反转每对括号间的子串","frequency":4.5830206656,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":65235,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2678134944426509,"acs":5807,"articleLive":2,"columnArticles":91,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":21683,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.4989798520785514,"acs":3913,"articleLive":2,"columnArticles":43,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":7842,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6109853449302991,"acs":5128,"articleLive":2,"columnArticles":66,"formTitle":"[1193]每月交易 I","frequency":0.2768834642,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"","submitted":8393,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5131807419100237,"acs":3251,"articleLive":2,"columnArticles":57,"formTitle":"[1194]锦标赛优胜者","frequency":0.3041926436,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"","submitted":6335,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6354518322814228,"acs":12988,"articleLive":2,"columnArticles":254,"formTitle":"[1195]交替打印字符串","frequency":1.4308011549,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":20439,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6914273824386183,"acs":3323,"articleLive":2,"columnArticles":53,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"","submitted":4806,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.36568144499178984,"acs":4454,"articleLive":2,"columnArticles":58,"formTitle":"[1197]进击的骑士","frequency":0.9313777419,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"","submitted":12180,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7482842147759386,"acs":3707,"articleLive":2,"columnArticles":55,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"","submitted":4954,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.4317904993909866,"acs":709,"articleLive":2,"columnArticles":16,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"","submitted":1642,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6858590695076211,"acs":17189,"articleLive":2,"columnArticles":240,"formTitle":"[1200]最小绝对差","frequency":0.8353654542,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":25062,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24688778990450205,"acs":5791,"articleLive":2,"columnArticles":82,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":23456,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5024402333473138,"acs":26355,"articleLive":2,"columnArticles":291,"formTitle":"[1202]交换字符串中的元素","frequency":0.3041926436,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":52454,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6249478732276897,"acs":11989,"articleLive":2,"columnArticles":141,"formTitle":"[1203]项目管理","frequency":0.4610570293,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19184,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.726764500349406,"acs":5200,"articleLive":2,"columnArticles":76,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.8660803995,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"","submitted":7155,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46790850304024706,"acs":4848,"articleLive":2,"columnArticles":76,"formTitle":"[1205]每月交易II","frequency":1.229022426,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"","submitted":10361,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6184782608695653,"acs":6259,"articleLive":2,"columnArticles":84,"formTitle":"[1206]设计跳表","frequency":0.8660803995,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":10120,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7301927460112972,"acs":58947,"articleLive":2,"columnArticles":817,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":80728,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.49640793549662765,"acs":45190,"articleLive":2,"columnArticles":595,"formTitle":"[1208]尽可能使字符串相等","frequency":1.4951320132,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":91034,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5332064788601661,"acs":11489,"articleLive":2,"columnArticles":155,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":1.7395770104,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":21547,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4482274482274482,"acs":2554,"articleLive":2,"columnArticles":51,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5698,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6589803463708893,"acs":6773,"articleLive":2,"columnArticles":58,"formTitle":"[1211]查询结果的质量和占比","frequency":0.8353654542,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"","submitted":10278,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5154310818231741,"acs":4693,"articleLive":2,"columnArticles":92,"formTitle":"[1212]查询球队积分","frequency":0.2768834642,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"","submitted":9105,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7726158038147138,"acs":5671,"articleLive":2,"columnArticles":118,"formTitle":"[1213]三个有序数组的交集","frequency":0.8980524322,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"","submitted":7340,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6317341722375147,"acs":3213,"articleLive":2,"columnArticles":66,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.4265946251,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"","submitted":5086,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.40840190558683415,"acs":1886,"articleLive":2,"columnArticles":39,"formTitle":"[1215]步进数","frequency":1.2623366327,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"","submitted":4618,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5322518346852066,"acs":1378,"articleLive":2,"columnArticles":36,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"","submitted":2589,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6942994913798798,"acs":21022,"articleLive":2,"columnArticles":343,"formTitle":"[1217]玩筹码","frequency":1.7051051014,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"","submitted":30278,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.4215499947207264,"acs":7985,"articleLive":2,"columnArticles":106,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":18942,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6315991027955578,"acs":11545,"articleLive":2,"columnArticles":165,"formTitle":"[1219]黄金矿工","frequency":1.7051051014,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":18279,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5264643613267467,"acs":3730,"articleLive":2,"columnArticles":68,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7085,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8041382600226591,"acs":40457,"articleLive":2,"columnArticles":649,"formTitle":"[1221]分割平衡字符串","frequency":0.8058212079,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"","submitted":50311,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6713244228432563,"acs":5525,"articleLive":2,"columnArticles":121,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8230,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4735225277940316,"acs":3237,"articleLive":2,"columnArticles":55,"formTitle":"[1223]掷骰子模拟","frequency":0.4966987206,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":6836,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.32451802479753455,"acs":4528,"articleLive":2,"columnArticles":66,"formTitle":"[1224]最大相等频率","frequency":1.2623366327,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":13953,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.546926154965442,"acs":3007,"articleLive":2,"columnArticles":71,"formTitle":"[1225]报告系统状态的连续日期","frequency":1.0018055493,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"","submitted":5498,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.6007534983853606,"acs":11162,"articleLive":2,"columnArticles":130,"formTitle":"[1226]哲学家进餐","frequency":2.5148736074,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":18580,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6618413830954994,"acs":9647,"articleLive":2,"columnArticles":150,"formTitle":"[1227]飞机座位分配概率","frequency":0.2507039587,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":14576,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5395213923132705,"acs":2976,"articleLive":2,"columnArticles":48,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"","submitted":5516,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.4116022099447514,"acs":2235,"articleLive":2,"columnArticles":40,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"","submitted":5430,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.4866581956797967,"acs":2681,"articleLive":2,"columnArticles":53,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"","submitted":5509,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5546764049502941,"acs":2734,"articleLive":2,"columnArticles":40,"formTitle":"[1231]分享巧克力","frequency":1.0398908834,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"","submitted":4929,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4690606099056803,"acs":33270,"articleLive":2,"columnArticles":409,"formTitle":"[1232]缀点成线","frequency":0.8058212079,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":70929,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48220719297136716,"acs":7629,"articleLive":2,"columnArticles":109,"formTitle":"[1233]删除子文件夹","frequency":0.3041926436,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":15821,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.34149717174148514,"acs":5675,"articleLive":2,"columnArticles":83,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.8660803995,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":16618,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.45030425963488846,"acs":5550,"articleLive":2,"columnArticles":99,"formTitle":"[1235]规划兼职工作","frequency":1.9133230025,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":12325,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5592369477911646,"acs":1114,"articleLive":2,"columnArticles":31,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"","submitted":1992,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7116656003412242,"acs":10011,"articleLive":2,"columnArticles":126,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14067,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.654965563208176,"acs":2948,"articleLive":2,"columnArticles":69,"formTitle":"[1238]循环码排列","frequency":0.3938048023,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4501,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49073740358970663,"acs":34040,"articleLive":2,"columnArticles":381,"formTitle":"[1239]串联字符串的最大长度","frequency":2.0263098659,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":69365,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4948328267477204,"acs":2442,"articleLive":2,"columnArticles":38,"formTitle":"[1240]铺瓷砖","frequency":1.6398929527,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":4935,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5969577918807293,"acs":5926,"articleLive":2,"columnArticles":63,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"","submitted":9927,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4606786427145709,"acs":1154,"articleLive":2,"columnArticles":19,"formTitle":"[1242]多线程网页爬虫","frequency":1.0018055493,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"","submitted":2505,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5390222984562607,"acs":2514,"articleLive":2,"columnArticles":50,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"","submitted":4664,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6230352303523036,"acs":2299,"articleLive":2,"columnArticles":37,"formTitle":"[1244]力扣排行榜","frequency":0.4610570293,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"","submitted":3690,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5050566037735849,"acs":3346,"articleLive":2,"columnArticles":60,"formTitle":"[1245]树的直径","frequency":0.3327171103,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"","submitted":6625,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.47878584605064567,"acs":2855,"articleLive":2,"columnArticles":38,"formTitle":"[1246]删除回文子数组","frequency":0.7499407495,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"","submitted":5963,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6153379812064262,"acs":8120,"articleLive":2,"columnArticles":150,"formTitle":"[1247]交换字符使得字符串相同","frequency":1.5645561361,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"","submitted":13196,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5583847522743526,"acs":33574,"articleLive":2,"columnArticles":460,"formTitle":"[1248]统计「优美子数组」","frequency":0.8058212079,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":60127,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5716136858647404,"acs":20733,"articleLive":2,"columnArticles":303,"formTitle":"[1249]移除无效的括号","frequency":1.8127357656,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":36271,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5602240896358543,"acs":2600,"articleLive":2,"columnArticles":36,"formTitle":"[1250]检查「好数组」","frequency":0.8980524322,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4641,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7719172470299058,"acs":7537,"articleLive":2,"columnArticles":93,"formTitle":"[1251]平均售价","frequency":0.2768834642,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"","submitted":9764,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7497873788059194,"acs":17632,"articleLive":2,"columnArticles":301,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":23516,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39357833655706,"acs":5087,"articleLive":2,"columnArticles":75,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":1.0018055493,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":12925,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5991618879576532,"acs":13583,"articleLive":2,"columnArticles":209,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.2255770086,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":22670,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6766481526201401,"acs":2802,"articleLive":2,"columnArticles":60,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4141,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6617712505562973,"acs":1487,"articleLive":2,"columnArticles":34,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"","submitted":2247,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5637755102040817,"acs":1768,"articleLive":2,"columnArticles":37,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"","submitted":3136,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5638703527168732,"acs":1183,"articleLive":2,"columnArticles":42,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"","submitted":2098,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4759651307596513,"acs":1911,"articleLive":2,"columnArticles":44,"formTitle":"[1259]不相交的握手","frequency":0.7499407495,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"","submitted":4015,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6033838383838384,"acs":11947,"articleLive":2,"columnArticles":242,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":19800,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7298726738491674,"acs":7452,"articleLive":2,"columnArticles":96,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10210,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5263628620102214,"acs":12359,"articleLive":2,"columnArticles":186,"formTitle":"[1262]可被三整除的最大和","frequency":2.088441647,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":23480,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4174410293066476,"acs":2920,"articleLive":2,"columnArticles":56,"formTitle":"[1263]推箱子","frequency":0.532340412,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":6995,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5733197556008147,"acs":4504,"articleLive":2,"columnArticles":80,"formTitle":"[1264]页面推荐","frequency":0.3327171103,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"","submitted":7856,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.92018779342723,"acs":2548,"articleLive":2,"columnArticles":61,"formTitle":"[1265]逆序打印不可变链表","frequency":0.3327171103,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"","submitted":2769,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8236266352914811,"acs":29401,"articleLive":2,"columnArticles":448,"formTitle":"[1266]访问所有点的最小时间","frequency":1.1661086006,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":35697,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6088867847964291,"acs":9003,"articleLive":2,"columnArticles":143,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":14786,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.580421216848674,"acs":7441,"articleLive":2,"columnArticles":135,"formTitle":"[1268]搜索推荐系统","frequency":0.3041926436,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"","submitted":12820,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4917984432609586,"acs":30012,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":2.3043300274,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61025,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8041487839771102,"acs":5621,"articleLive":2,"columnArticles":76,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.7773697867,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"","submitted":6990,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5044548154433602,"acs":2378,"articleLive":2,"columnArticles":38,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"","submitted":4714,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5178691840863116,"acs":1536,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"","submitted":2966,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.539124192390524,"acs":1502,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"","submitted":2786,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.5952685421994884,"acs":931,"articleLive":2,"columnArticles":23,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"","submitted":1564,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5399890440975076,"acs":7886,"articleLive":2,"columnArticles":165,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.8058212079,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":14604,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5010294583465316,"acs":6327,"articleLive":2,"columnArticles":94,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":12628,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7238982846583377,"acs":18020,"articleLive":2,"columnArticles":225,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":1.1969752486,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":24893,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5954561465304685,"acs":3381,"articleLive":2,"columnArticles":58,"formTitle":"[1278]分割回文串 III","frequency":2.866869569,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":5678,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6208333333333333,"acs":1490,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":1.0798482563,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"","submitted":2400,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5061920774214713,"acs":6172,"articleLive":2,"columnArticles":65,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.8058212079,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"","submitted":12193,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8313744481904372,"acs":44634,"articleLive":2,"columnArticles":604,"formTitle":"[1281]整数的各位积和之差","frequency":1.1969752486,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":53687,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8113530539578198,"acs":11849,"articleLive":2,"columnArticles":222,"formTitle":"[1282]用户分组","frequency":0.2768834642,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":14604,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41581948921398465,"acs":6708,"articleLive":2,"columnArticles":95,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.8353654542,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16132,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6588328492210193,"acs":2495,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":1.0798482563,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3787,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8123126124325405,"acs":4064,"articleLive":2,"columnArticles":55,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"","submitted":5003,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6445816956765862,"acs":4592,"articleLive":2,"columnArticles":86,"formTitle":"[1286]字母组合迭代器","frequency":0.8353654542,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7124,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6056435522618999,"acs":14874,"articleLive":2,"columnArticles":213,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.8353654542,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":24559,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5631597781356236,"acs":12590,"articleLive":2,"columnArticles":161,"formTitle":"[1288]删除被覆盖区间","frequency":1.4308011549,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":22356,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6310067405957817,"acs":5804,"articleLive":2,"columnArticles":84,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":9198,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8089712881450836,"acs":52012,"articleLive":2,"columnArticles":680,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":64294,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5176189374662657,"acs":6713,"articleLive":2,"columnArticles":147,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":12969,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.4685378373902964,"acs":5659,"articleLive":2,"columnArticles":89,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.3041926436,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12078,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.35584567991785243,"acs":12129,"articleLive":2,"columnArticles":122,"formTitle":"[1293]网格中的最短路径","frequency":2.7000389606,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":34085,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6612149532710281,"acs":6509,"articleLive":2,"columnArticles":71,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"","submitted":9844,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.809353507565337,"acs":47072,"articleLive":2,"columnArticles":625,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.2768834642,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":58160,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4513188282484502,"acs":7426,"articleLive":2,"columnArticles":119,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":16454,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.4598954113574427,"acs":6244,"articleLive":2,"columnArticles":87,"formTitle":"[1297]子串的最大出现次数","frequency":1.2623366327,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":13577,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5945883441258094,"acs":2571,"articleLive":2,"columnArticles":87,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4324,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7855445230801732,"acs":29747,"articleLive":2,"columnArticles":424,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":37868,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.46746460543439683,"acs":23707,"articleLive":2,"columnArticles":361,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.2768834642,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":50714,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.35722134049566595,"acs":2926,"articleLive":2,"columnArticles":68,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8191,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8163913043478261,"acs":18777,"articleLive":2,"columnArticles":283,"formTitle":"[1302]层数最深叶子节点的和","frequency":1.229022426,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":23000,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8213085590037557,"acs":8310,"articleLive":2,"columnArticles":79,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"","submitted":10118,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7257702294897888,"acs":20683,"articleLive":2,"columnArticles":370,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.2507039587,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":28498,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7472299886092989,"acs":14432,"articleLive":2,"columnArticles":214,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.2507039587,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":19314,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5769693112713902,"acs":16319,"articleLive":2,"columnArticles":258,"formTitle":"[1306]跳跃游戏 III","frequency":0.8660803995,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":28284,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3320290665176076,"acs":1782,"articleLive":2,"columnArticles":52,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5367,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7515923566878981,"acs":4956,"articleLive":2,"columnArticles":55,"formTitle":"[1308]不同性别每日分数总计","frequency":0.3041926436,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"","submitted":6594,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.755223880597015,"acs":16192,"articleLive":2,"columnArticles":277,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":21440,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7122559105555339,"acs":36694,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":2.5599501674,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":51518,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.37565951459725644,"acs":5340,"articleLive":2,"columnArticles":82,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.3625522588,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14215,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6656393397712486,"acs":9719,"articleLive":2,"columnArticles":140,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":1.6719059297,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":14601,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8309366404478116,"acs":34439,"articleLive":2,"columnArticles":536,"formTitle":"[1313]解压缩编码列表","frequency":0.2768834642,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":41446,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7334011332267907,"acs":10096,"articleLive":2,"columnArticles":173,"formTitle":"[1314]矩阵区域和","frequency":1.6719059297,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":13766,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8096474712718301,"acs":12471,"articleLive":2,"columnArticles":255,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15403,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.43580023075655183,"acs":2644,"articleLive":2,"columnArticles":55,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6067,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6141117702154231,"acs":9835,"articleLive":2,"columnArticles":184,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16015,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6487199208878145,"acs":5904,"articleLive":2,"columnArticles":101,"formTitle":"[1318]或运算的最小翻转次数","frequency":3.1887736265,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9101,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6177659530586148,"acs":29953,"articleLive":2,"columnArticles":507,"formTitle":"[1319]连通网络的操作次数","frequency":0.3041926436,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":48486,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5874538745387454,"acs":2388,"articleLive":2,"columnArticles":55,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4065,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6179673321234119,"acs":4086,"articleLive":2,"columnArticles":73,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"","submitted":6612,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5921399472801342,"acs":4942,"articleLive":2,"columnArticles":63,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"","submitted":8346,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7554049278807543,"acs":23515,"articleLive":2,"columnArticles":465,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":1.1969752486,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":31129,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5922653082441002,"acs":5697,"articleLive":2,"columnArticles":112,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":9619,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7277376654632972,"acs":9676,"articleLive":2,"columnArticles":173,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.2768834642,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":13296,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47566526610644255,"acs":5434,"articleLive":2,"columnArticles":91,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.3938048023,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":11424,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6941701609630732,"acs":5132,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"","submitted":7393,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.4564936115154456,"acs":5645,"articleLive":2,"columnArticles":113,"formTitle":"[1328]破坏回文串","frequency":0.8660803995,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12366,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7741043658564681,"acs":6720,"articleLive":2,"columnArticles":152,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.3625522588,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":8681,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3758747084305232,"acs":1128,"articleLive":2,"columnArticles":28,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.7499407495,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3001,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.534555445028658,"acs":11285,"articleLive":2,"columnArticles":192,"formTitle":"[1331]数组序号转换","frequency":0.2507039587,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":21111,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6827948796098751,"acs":8961,"articleLive":2,"columnArticles":130,"formTitle":"[1332]删除回文子序列","frequency":0.2768834642,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13124,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5417881926983807,"acs":5387,"articleLive":2,"columnArticles":114,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":9943,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.486219739292365,"acs":5222,"articleLive":2,"columnArticles":88,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":2.4067736718,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":10740,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5817988668555241,"acs":3286,"articleLive":2,"columnArticles":55,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":5648,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.42223910840932116,"acs":1667,"articleLive":2,"columnArticles":46,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"","submitted":3948,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7071204404938642,"acs":37628,"articleLive":2,"columnArticles":604,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.6813267377,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":53213,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.640152626944526,"acs":8724,"articleLive":2,"columnArticles":123,"formTitle":"[1338]数组大小减半","frequency":0.2507039587,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":13628,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.39704186512910505,"acs":7919,"articleLive":2,"columnArticles":127,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.3625522588,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":19945,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5709638064253761,"acs":4212,"articleLive":2,"columnArticles":94,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7377,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.48327424078927084,"acs":3135,"articleLive":2,"columnArticles":45,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"","submitted":6487,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8203030122041052,"acs":41203,"articleLive":2,"columnArticles":628,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":50229,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5415777322820926,"acs":12433,"articleLive":2,"columnArticles":210,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":22957,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5925044000414121,"acs":5723,"articleLive":2,"columnArticles":116,"formTitle":"[1344]时钟指针的夹角","frequency":0.3041926436,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":9659,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3674538941223298,"acs":5539,"articleLive":2,"columnArticles":107,"formTitle":"[1345]跳跃游戏 IV","frequency":0.3625522588,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15074,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43607664977575866,"acs":14974,"articleLive":2,"columnArticles":256,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":34338,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7376664056382146,"acs":7536,"articleLive":2,"columnArticles":110,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10216,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.30277078085642317,"acs":3005,"articleLive":2,"columnArticles":47,"formTitle":"[1348]推文计数","frequency":0.4265946251,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":9925,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5003379520108144,"acs":2961,"articleLive":2,"columnArticles":93,"formTitle":"[1349]参加考试的最大学生数","frequency":0.3625522588,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":5918,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8477287268074216,"acs":7950,"articleLive":2,"columnArticles":82,"formTitle":"[1350]院系无效的学生","frequency":0.2768834642,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"","submitted":9378,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7543429495539673,"acs":28920,"articleLive":2,"columnArticles":534,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.2507039587,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":38338,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44112699747687134,"acs":6294,"articleLive":2,"columnArticles":70,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.3327171103,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":14268,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28265174116218283,"acs":10706,"articleLive":2,"columnArticles":146,"formTitle":"[1353]最多可以参加的会议数目","frequency":2.5491509264,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":37877,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.28476278307203606,"acs":2779,"articleLive":2,"columnArticles":69,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":9759,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6621370067014147,"acs":3557,"articleLive":2,"columnArticles":53,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"","submitted":5372,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7318542510121457,"acs":45192,"articleLive":2,"columnArticles":498,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.8058212079,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":61750,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5266444629475437,"acs":3795,"articleLive":2,"columnArticles":40,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7206,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.48463181353886153,"acs":5219,"articleLive":2,"columnArticles":107,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.2768834642,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":10769,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.544,"acs":2652,"articleLive":2,"columnArticles":64,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":4875,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5029732408325074,"acs":8120,"articleLive":2,"columnArticles":134,"formTitle":"[1360]日期之间隔几天","frequency":1.6719059297,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":16144,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.40136247516321316,"acs":7070,"articleLive":2,"columnArticles":188,"formTitle":"[1361]验证二叉树","frequency":0.2507039587,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":17615,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5233203205259914,"acs":5094,"articleLive":2,"columnArticles":67,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":9734,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3600031162355874,"acs":4621,"articleLive":2,"columnArticles":96,"formTitle":"[1363]形成三的最大倍数","frequency":1.7051051014,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":12836,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6754823325384782,"acs":3116,"articleLive":2,"columnArticles":60,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.2768834642,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"","submitted":4613,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8249953101705123,"acs":83558,"articleLive":2,"columnArticles":1073,"formTitle":"[1365]有多少小于当前数字的数字","frequency":1.1969752486,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":101283,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5361156959836516,"acs":6821,"articleLive":2,"columnArticles":138,"formTitle":"[1366]通过投票对团队排名","frequency":0.8660803995,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":12723,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4166145270462431,"acs":14649,"articleLive":2,"columnArticles":216,"formTitle":"[1367]二叉树中的列表","frequency":0.8058212079,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":35162,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5170488835244418,"acs":3427,"articleLive":2,"columnArticles":83,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6628,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6072395961585816,"acs":2466,"articleLive":2,"columnArticles":39,"formTitle":"[1369]获取最近第二次的活动","frequency":0.3327171103,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"","submitted":4061,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7905049733481676,"acs":47605,"articleLive":2,"columnArticles":570,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60221,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5797729560451851,"acs":20735,"articleLive":2,"columnArticles":261,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":1.9925912299,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":35764,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5146738772010816,"acs":7804,"articleLive":2,"columnArticles":158,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.3327171103,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":15163,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.3961006602715834,"acs":6359,"articleLive":2,"columnArticles":149,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":1.1969752486,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":16054,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.738627223165609,"acs":16529,"articleLive":2,"columnArticles":221,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22378,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5707840590607697,"acs":8350,"articleLive":2,"columnArticles":167,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":14629,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5039281705948373,"acs":7184,"articleLive":2,"columnArticles":149,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.2768834642,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14256,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32516326695154396,"acs":4033,"articleLive":2,"columnArticles":128,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12403,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8625347134561979,"acs":6833,"articleLive":2,"columnArticles":58,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"","submitted":7922,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8362592561777186,"acs":10051,"articleLive":2,"columnArticles":155,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12019,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7274202271498107,"acs":16140,"articleLive":2,"columnArticles":243,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22188,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7321452058398,"acs":11133,"articleLive":2,"columnArticles":140,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":15206,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6896233868843824,"acs":10474,"articleLive":2,"columnArticles":165,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.3327171103,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":15188,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32273057371096586,"acs":4444,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":0.4610570293,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":13770,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5416542251418334,"acs":1814,"articleLive":2,"columnArticles":43,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"","submitted":3349,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7034018814263837,"acs":12861,"articleLive":2,"columnArticles":191,"formTitle":"[1385]两个数组间的距离值","frequency":0.2768834642,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":18284,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.30988326848249026,"acs":5973,"articleLive":2,"columnArticles":123,"formTitle":"[1386]安排电影院座位","frequency":0.966163858,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":19275,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6945096887844979,"acs":9462,"articleLive":2,"columnArticles":167,"formTitle":"[1387]将整数按权重排序","frequency":0.9313777419,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":13624,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5353673553153646,"acs":3913,"articleLive":2,"columnArticles":51,"formTitle":"[1388]3n 块披萨","frequency":2.7727453908,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7309,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8306456465491305,"acs":27609,"articleLive":2,"columnArticles":471,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.8353654542,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33238,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.350223290965304,"acs":6117,"articleLive":2,"columnArticles":113,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17466,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.3991669774959592,"acs":6421,"articleLive":2,"columnArticles":199,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.966163858,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16086,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.39768618944323936,"acs":7150,"articleLive":2,"columnArticles":128,"formTitle":"[1392]最长快乐前缀","frequency":0.2768834642,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":17979,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8566914917625819,"acs":3796,"articleLive":2,"columnArticles":56,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"","submitted":4431,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6641150263264479,"acs":16397,"articleLive":2,"columnArticles":262,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":24690,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7545618938024001,"acs":13770,"articleLive":2,"columnArticles":207,"formTitle":"[1395]统计作战单位数","frequency":0.2768834642,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":18249,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4155033589022821,"acs":8721,"articleLive":2,"columnArticles":130,"formTitle":"[1396]设计地铁系统","frequency":0.966163858,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":20989,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3652762119503946,"acs":972,"articleLive":2,"columnArticles":35,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2661,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7726928895612708,"acs":4086,"articleLive":2,"columnArticles":60,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"","submitted":5288,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6666169784601624,"acs":8944,"articleLive":2,"columnArticles":147,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":13417,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.603510758776897,"acs":5329,"articleLive":2,"columnArticles":87,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.2768834642,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"","submitted":8830,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41496523562520693,"acs":3760,"articleLive":2,"columnArticles":87,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.3327171103,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9061,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.750732421875,"acs":9225,"articleLive":2,"columnArticles":167,"formTitle":"[1402]做菜顺序","frequency":0.3041926436,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12288,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6912361964219783,"acs":20594,"articleLive":2,"columnArticles":350,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.7773697867,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":29793,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.49124649859943975,"acs":7015,"articleLive":2,"columnArticles":150,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.3625522588,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14280,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5057612391386476,"acs":5355,"articleLive":2,"columnArticles":134,"formTitle":"[1405]最长快乐字符串","frequency":0.8660803995,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":10588,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5683040078201369,"acs":4651,"articleLive":2,"columnArticles":78,"formTitle":"[1406]石子游戏 III","frequency":0.2768834642,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8184,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6673083864757551,"acs":5546,"articleLive":2,"columnArticles":64,"formTitle":"[1407]排名靠前的旅行者","frequency":0.8058212079,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"","submitted":8311,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6135216952573158,"acs":12768,"articleLive":2,"columnArticles":196,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":20811,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.805314256515074,"acs":7880,"articleLive":2,"columnArticles":128,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":9785,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4769674333267807,"acs":7279,"articleLive":2,"columnArticles":116,"formTitle":"[1410]HTML 实体解析器","frequency":0.3938048023,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15261,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5488677867056245,"acs":7514,"articleLive":2,"columnArticles":139,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":3.923893934,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":13690,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5544188071397474,"acs":2547,"articleLive":2,"columnArticles":61,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"","submitted":4594,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6912765240821825,"acs":10262,"articleLive":2,"columnArticles":208,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.8660803995,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":14845,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6019614474129185,"acs":7120,"articleLive":2,"columnArticles":143,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":11828,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6840128755364807,"acs":6375,"articleLive":2,"columnArticles":170,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.2507039587,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9320,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.4076923076923077,"acs":2703,"articleLive":2,"columnArticles":47,"formTitle":"[1416]恢复数组","frequency":1.3148973373,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6630,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5188079305041773,"acs":12482,"articleLive":2,"columnArticles":180,"formTitle":"[1417]重新格式化字符串","frequency":0.2255770086,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24059,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7334115089806659,"acs":25643,"articleLive":2,"columnArticles":412,"formTitle":"[1418]点菜展示表","frequency":2.4067736718,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":34964,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.41761765025540704,"acs":7685,"articleLive":2,"columnArticles":148,"formTitle":"[1419]数青蛙","frequency":1.2623366327,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18402,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5922084492790286,"acs":2341,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":1.2128460785,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":3953,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7496352494893492,"acs":2569,"articleLive":2,"columnArticles":32,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"","submitted":3427,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5404018811457888,"acs":10112,"articleLive":2,"columnArticles":186,"formTitle":"[1422]分割字符串的最大得分","frequency":1.4308011549,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":18712,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5546341063672867,"acs":33841,"articleLive":2,"columnArticles":500,"formTitle":"[1423]可获得的最大点数","frequency":0.8058212079,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":61015,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.3960241789742631,"acs":6355,"articleLive":2,"columnArticles":133,"formTitle":"[1424]对角线遍历 II","frequency":0.8660803995,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16047,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43367273770256703,"acs":3024,"articleLive":2,"columnArticles":66,"formTitle":"[1425]带限制的子序列和","frequency":0.3041926436,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":6973,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7011128775834659,"acs":1323,"articleLive":2,"columnArticles":44,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"","submitted":1887,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6581939799331104,"acs":984,"articleLive":2,"columnArticles":42,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"","submitted":1495,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5916095890410958,"acs":691,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"","submitted":1168,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5080291970802919,"acs":1044,"articleLive":2,"columnArticles":35,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"","submitted":2055,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.57548032936871,"acs":629,"articleLive":2,"columnArticles":25,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"","submitted":1093,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.846117734398882,"acs":77501,"articleLive":2,"columnArticles":1020,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.2768834642,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":91596,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39210053859964095,"acs":4368,"articleLive":2,"columnArticles":96,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11140,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6409515340151178,"acs":5766,"articleLive":2,"columnArticles":98,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":8996,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.44621979734996103,"acs":2290,"articleLive":2,"columnArticles":44,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5132,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.623403911427186,"acs":3857,"articleLive":2,"columnArticles":45,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"","submitted":6187,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.7829547152891945,"acs":20955,"articleLive":2,"columnArticles":363,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"","submitted":26764,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5894362017804154,"acs":9932,"articleLive":2,"columnArticles":167,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.2768834642,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":16850,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4818401573502695,"acs":32092,"articleLive":2,"columnArticles":458,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":1.5645561361,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":66603,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5604934366598133,"acs":3544,"articleLive":2,"columnArticles":55,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6323,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6947633716045926,"acs":2481,"articleLive":2,"columnArticles":33,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"","submitted":3571,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6466013609511703,"acs":17294,"articleLive":2,"columnArticles":356,"formTitle":"[1441]用栈操作构建数组","frequency":0.3327171103,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":26746,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7916359447004608,"acs":34357,"articleLive":2,"columnArticles":372,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":2.6274381477,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43400,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.410590539319072,"acs":5451,"articleLive":2,"columnArticles":137,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13276,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5236809306190279,"acs":2521,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":4814,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8565764925373134,"acs":3673,"articleLive":2,"columnArticles":46,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"","submitted":4288,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5731249703130196,"acs":12066,"articleLive":2,"columnArticles":205,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":21053,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6168507688975525,"acs":5696,"articleLive":2,"columnArticles":68,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9234,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7130648096858432,"acs":9011,"articleLive":2,"columnArticles":141,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.2255770086,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":12637,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6275018388757694,"acs":16209,"articleLive":2,"columnArticles":206,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":1.7754180025,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":25831,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.80217761143246,"acs":23576,"articleLive":2,"columnArticles":336,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.8058212079,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":29390,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5207462206497266,"acs":9714,"articleLive":2,"columnArticles":149,"formTitle":"[1451]重新排列句子中的单词","frequency":0.3327171103,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":18654,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.49728705537852036,"acs":5774,"articleLive":2,"columnArticles":88,"formTitle":"[1452]收藏清单","frequency":0.4265946251,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11611,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.3622891016871865,"acs":1589,"articleLive":2,"columnArticles":30,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4386,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.40266944011093775,"acs":4646,"articleLive":2,"columnArticles":75,"formTitle":"[1454]活跃用户","frequency":0.9313777419,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"","submitted":11538,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6340792874030902,"acs":11532,"articleLive":2,"columnArticles":193,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":18187,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.51767098906687,"acs":12216,"articleLive":2,"columnArticles":190,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":23598,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6368944814540669,"acs":7744,"articleLive":2,"columnArticles":134,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12159,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4401286690792119,"acs":5473,"articleLive":2,"columnArticles":85,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12435,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5950833568804748,"acs":2106,"articleLive":2,"columnArticles":45,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"","submitted":3539,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7436518754101671,"acs":14731,"articleLive":2,"columnArticles":305,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":19809,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.49946294307196565,"acs":5580,"articleLive":2,"columnArticles":79,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11172,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.42541106128550077,"acs":5692,"articleLive":2,"columnArticles":118,"formTitle":"[1462]课程表 IV","frequency":0.2768834642,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":13380,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.58803457688808,"acs":2585,"articleLive":2,"columnArticles":62,"formTitle":"[1463]摘樱桃 II","frequency":0.532340412,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4396,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7675719816114203,"acs":25379,"articleLive":2,"columnArticles":358,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.2768834642,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":33064,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.30742191423119414,"acs":6122,"articleLive":2,"columnArticles":77,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":19914,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4833240468041073,"acs":6072,"articleLive":2,"columnArticles":120,"formTitle":"[1466]重新规划路线","frequency":0.8660803995,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":12563,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6111325860069579,"acs":1581,"articleLive":2,"columnArticles":45,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2587,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7146936656282451,"acs":2753,"articleLive":2,"columnArticles":47,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"","submitted":3852,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.8029480217222653,"acs":2070,"articleLive":2,"columnArticles":77,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"","submitted":2578,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8434164845055934,"acs":52474,"articleLive":2,"columnArticles":718,"formTitle":"[1470]重新排列数组","frequency":2.0568559182,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":62216,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5409391932570741,"acs":7188,"articleLive":2,"columnArticles":101,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13288,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6162250516173434,"acs":7163,"articleLive":2,"columnArticles":121,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":11624,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6754838425252392,"acs":15322,"articleLive":2,"columnArticles":163,"formTitle":"[1473]粉刷房子 III","frequency":2.2647208893,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":22683,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7207713941341904,"acs":1794,"articleLive":2,"columnArticles":59,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"","submitted":2489,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7240904517290685,"acs":13673,"articleLive":2,"columnArticles":218,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":18883,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8657154846831725,"acs":12378,"articleLive":2,"columnArticles":111,"formTitle":"[1476]子矩形查询","frequency":0.8660803995,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14298,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.29008773567295126,"acs":4662,"articleLive":2,"columnArticles":95,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.966163858,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":16071,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5697940503432495,"acs":2490,"articleLive":2,"columnArticles":55,"formTitle":"[1478]安排邮筒","frequency":1.4103714351,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4370,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5768857235351247,"acs":1782,"articleLive":2,"columnArticles":36,"formTitle":"[1479]周内每天的销售情况","frequency":0.4265946251,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"","submitted":3089,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8544033971701438,"acs":101809,"articleLive":2,"columnArticles":1071,"formTitle":"[1480]一维数组的动态和","frequency":3.0002472928,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"","submitted":119158,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.513493091537133,"acs":9514,"articleLive":2,"columnArticles":137,"formTitle":"[1481]不同整数的最少数目","frequency":0.8353654542,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":18528,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5869719866951222,"acs":30529,"articleLive":2,"columnArticles":397,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":2.4817853945,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":52011,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.30050577345166524,"acs":3149,"articleLive":2,"columnArticles":67,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":10479,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8030467899891186,"acs":738,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"","submitted":919,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6624785836664763,"acs":3480,"articleLive":2,"columnArticles":43,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"","submitted":5253,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.858532229059369,"acs":70179,"articleLive":2,"columnArticles":673,"formTitle":"[1486]数组异或操作","frequency":2.3372602337,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":81743,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.30748530264138446,"acs":7427,"articleLive":2,"columnArticles":99,"formTitle":"[1487]保证文件名唯一","frequency":1.229022426,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24154,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23454048513836692,"acs":6865,"articleLive":2,"columnArticles":107,"formTitle":"[1488]避免洪水泛滥","frequency":2.879087192,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":29270,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6933227925079056,"acs":11401,"articleLive":2,"columnArticles":124,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16444,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8556782334384858,"acs":1085,"articleLive":2,"columnArticles":28,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"","submitted":1268,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6709713254183156,"acs":19328,"articleLive":2,"columnArticles":291,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":28806,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6665585468699319,"acs":6165,"articleLive":2,"columnArticles":74,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":9249,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5662082200543739,"acs":7081,"articleLive":2,"columnArticles":136,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":1.1363444987,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":12506,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.36,"acs":2034,"articleLive":2,"columnArticles":33,"formTitle":"[1494]并行课程 II","frequency":1.3331626853,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":5650,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5432263814616756,"acs":3657,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"","submitted":6732,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5384854449393971,"acs":10396,"articleLive":2,"columnArticles":157,"formTitle":"[1496]判断路径是否相交","frequency":0.2255770086,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":19306,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3923057324840764,"acs":7699,"articleLive":2,"columnArticles":105,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":19625,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33182272575808064,"acs":4979,"articleLive":2,"columnArticles":62,"formTitle":"[1498]满足条件的子序列数目","frequency":0.8660803995,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15005,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.37784772182254195,"acs":2521,"articleLive":2,"columnArticles":56,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":6672,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.29387331256490135,"acs":566,"articleLive":2,"columnArticles":25,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"","submitted":1926,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5932283464566929,"acs":3767,"articleLive":2,"columnArticles":55,"formTitle":"[1501]可以放心投资的国家","frequency":1.1661086006,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"","submitted":6350,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7180910099889012,"acs":24586,"articleLive":2,"columnArticles":295,"formTitle":"[1502]判断能否形成等差数列","frequency":1.4308011549,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":34238,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5116696588868941,"acs":8265,"articleLive":2,"columnArticles":79,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.8980524322,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16153,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5929783302536537,"acs":7060,"articleLive":2,"columnArticles":126,"formTitle":"[1504]统计全 1 子矩形","frequency":1.6398929527,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":11906,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3574338085539715,"acs":3159,"articleLive":2,"columnArticles":71,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":1.7221761885,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":8838,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8388704318936877,"acs":505,"articleLive":2,"columnArticles":15,"formTitle":"[1506]找到 N 叉树的根节点","frequency":1.4951320132,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"","submitted":602,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5901196449247395,"acs":9174,"articleLive":2,"columnArticles":125,"formTitle":"[1507]转变日期格式","frequency":1.4623744168,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":15546,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5515678126180582,"acs":5840,"articleLive":2,"columnArticles":48,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.3041926436,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":10588,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5445636957536164,"acs":4668,"articleLive":2,"columnArticles":71,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":8572,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5771125893077113,"acs":4685,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.8058212079,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8118,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6840296617833242,"acs":3782,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":0.2768834642,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"","submitted":5529,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8484521769953329,"acs":57447,"articleLive":2,"columnArticles":731,"formTitle":"[1512]好数对的数目","frequency":0.2768834642,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":67708,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37783941298318297,"acs":10762,"articleLive":2,"columnArticles":146,"formTitle":"[1513]仅含 1 的子串数","frequency":0.3041926436,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":28483,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.3149585464808608,"acs":7142,"articleLive":2,"columnArticles":128,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":22676,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34049623393885686,"acs":3074,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.6492521472,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9028,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5369318181818182,"acs":189,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"","submitted":352,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7286803790154842,"acs":3153,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"","submitted":4327,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6752315929629734,"acs":23835,"articleLive":2,"columnArticles":386,"formTitle":"[1518]换酒问题","frequency":1.1661086006,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":35299,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2950124001102232,"acs":5353,"articleLive":2,"columnArticles":121,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18145,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.3293559322033898,"acs":2429,"articleLive":2,"columnArticles":70,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7375,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3957078894549946,"acs":2563,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.7499407495,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6477,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7107728337236534,"acs":607,"articleLive":2,"columnArticles":22,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"","submitted":854,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5776287717159403,"acs":9476,"articleLive":2,"columnArticles":163,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":16405,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4224907063197026,"acs":4546,"articleLive":2,"columnArticles":96,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.8353654542,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":10760,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6597321544662592,"acs":5074,"articleLive":2,"columnArticles":107,"formTitle":"[1525]字符串的好分割数目","frequency":0.3041926436,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":7691,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.611682435211847,"acs":2974,"articleLive":2,"columnArticles":46,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":4862,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5094688221709007,"acs":3309,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"","submitted":6495,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7840103159252095,"acs":29184,"articleLive":2,"columnArticles":347,"formTitle":"[1528]重新排列字符串","frequency":0.7773697867,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":37224,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6886792452830188,"acs":8687,"articleLive":2,"columnArticles":130,"formTitle":"[1529]灯泡开关 IV","frequency":0.2768834642,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12614,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.565528781793842,"acs":8449,"articleLive":2,"columnArticles":143,"formTitle":"[1530]好叶子节点对的数量","frequency":0.966163858,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":14940,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.32206178029610677,"acs":1762,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":1.1218535916,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5471,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6207332490518331,"acs":2455,"articleLive":2,"columnArticles":45,"formTitle":"[1532]最近的三笔订单","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"","submitted":3955,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6093023255813953,"acs":262,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"","submitted":430,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7883000427005741,"acs":16615,"articleLive":2,"columnArticles":156,"formTitle":"[1534]统计好三元组","frequency":0.2507039587,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21077,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4523975224441506,"acs":13001,"articleLive":2,"columnArticles":176,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.3625522588,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":28738,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4378769601930036,"acs":3993,"articleLive":2,"columnArticles":75,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9119,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3649839064882263,"acs":4309,"articleLive":2,"columnArticles":86,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":11806,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.5956284153005464,"acs":109,"articleLive":2,"columnArticles":6,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"","submitted":183,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5379969096783256,"acs":15320,"articleLive":2,"columnArticles":227,"formTitle":"[1539]第 k 个缺失的正整数","frequency":2.76335124,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":28476,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3153219837157661,"acs":4686,"articleLive":2,"columnArticles":83,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":14861,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.45672799273987297,"acs":5536,"articleLive":2,"columnArticles":89,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12121,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.37849117174959873,"acs":2358,"articleLive":2,"columnArticles":46,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6230,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5491235222176927,"acs":2694,"articleLive":2,"columnArticles":42,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"","submitted":4906,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5429190836116482,"acs":18532,"articleLive":2,"columnArticles":303,"formTitle":"[1544]整理字符串","frequency":1.1661086006,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":34134,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5522194208877683,"acs":7228,"articleLive":2,"columnArticles":99,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.3625522588,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13089,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4083991683991684,"acs":4911,"articleLive":2,"columnArticles":74,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12025,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.531529056189037,"acs":3869,"articleLive":2,"columnArticles":68,"formTitle":"[1547]切棍子的最小成本","frequency":1.3709030133,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7279,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7108695652173913,"acs":327,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"","submitted":460,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.665576694411415,"acs":2239,"articleLive":2,"columnArticles":43,"formTitle":"[1549]每件商品的最新订单","frequency":0.3041926436,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"","submitted":3364,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6599858902001026,"acs":20581,"articleLive":2,"columnArticles":279,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.2768834642,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":31184,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8173033368564094,"acs":10826,"articleLive":2,"columnArticles":146,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.2768834642,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13246,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5059593362935265,"acs":8660,"articleLive":2,"columnArticles":120,"formTitle":"[1552]两球之间的磁力","frequency":0.3041926436,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17116,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29323337936476623,"acs":7432,"articleLive":2,"columnArticles":119,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":2.8228926337,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":25345,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.6992481203007519,"acs":465,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"","submitted":665,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.43618167821401077,"acs":2833,"articleLive":2,"columnArticles":53,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"","submitted":6495,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5795087638376384,"acs":10051,"articleLive":2,"columnArticles":153,"formTitle":"[1556]千位分隔数","frequency":2.2022005323,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":17344,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7607142857142857,"acs":7029,"articleLive":2,"columnArticles":93,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":9240,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6207986210858949,"acs":4322,"articleLive":2,"columnArticles":67,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.4610570293,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":6962,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.36511133489985453,"acs":3263,"articleLive":2,"columnArticles":59,"formTitle":"[1559]二维网格图中探测环","frequency":0.532340412,"frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","questionId":"1663","status":"","submitted":8937,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5734870317002881,"acs":8358,"articleLive":2,"columnArticles":88,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.3327171103,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":14574,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7790285595163644,"acs":11211,"articleLive":2,"columnArticles":150,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.8353654542,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":14391,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.30905175614464986,"acs":4162,"articleLive":2,"columnArticles":82,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.532340412,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13467,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3763004062221342,"acs":3798,"articleLive":2,"columnArticles":65,"formTitle":"[1563]石子游戏 V","frequency":2.1355091578,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10093,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5854870775347912,"acs":589,"articleLive":2,"columnArticles":22,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"","submitted":1006,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.725451397477121,"acs":2933,"articleLive":2,"columnArticles":39,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.2768834642,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"","submitted":4043,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4455131964809384,"acs":7596,"articleLive":2,"columnArticles":114,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.2768834642,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17050,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.3887833484760882,"acs":9414,"articleLive":2,"columnArticles":167,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.7499407495,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":24214,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45371050698016163,"acs":2470,"articleLive":2,"columnArticles":45,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5444,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47213658999288594,"acs":1991,"articleLive":2,"columnArticles":44,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4217,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8990033222591363,"acs":1353,"articleLive":2,"columnArticles":33,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"","submitted":1505,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7578162578162578,"acs":3151,"articleLive":2,"columnArticles":42,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"","submitted":4158,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8048120169424916,"acs":18431,"articleLive":2,"columnArticles":312,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.1782084566,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":22901,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.29552341597796145,"acs":4291,"articleLive":2,"columnArticles":59,"formTitle":"[1573]分割字符串的方案数","frequency":0.3041926436,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":14520,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3258735200693041,"acs":4514,"articleLive":2,"columnArticles":76,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":1.7051051014,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":13852,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.6017344896597732,"acs":3608,"articleLive":2,"columnArticles":60,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":5996,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47637071779258894,"acs":17368,"articleLive":2,"columnArticles":244,"formTitle":"[1576]替换所有的问号","frequency":0.3041926436,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":36459,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3233019174520637,"acs":4974,"articleLive":2,"columnArticles":78,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.4265946251,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15385,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5791802643951546,"acs":10471,"articleLive":2,"columnArticles":197,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18079,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6197155735156978,"acs":15949,"articleLive":2,"columnArticles":293,"formTitle":"[1579]保证图可完全遍历","frequency":1.2128460785,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":25736,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6282722513089005,"acs":240,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"","submitted":382,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8144382308083375,"acs":3204,"articleLive":2,"columnArticles":44,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"","submitted":3934,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6711091690335736,"acs":9215,"articleLive":2,"columnArticles":106,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.2768834642,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":13731,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6848562396507601,"acs":18198,"articleLive":2,"columnArticles":240,"formTitle":"[1583]统计不开心的朋友","frequency":1.2934820963,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":26572,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6669441013800139,"acs":24841,"articleLive":2,"columnArticles":318,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":37246,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4296022201665125,"acs":2322,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5405,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6261343012704175,"acs":345,"articleLive":2,"columnArticles":21,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"","submitted":551,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8252807521546096,"acs":3160,"articleLive":2,"columnArticles":40,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"","submitted":3829,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8018267691947383,"acs":20542,"articleLive":2,"columnArticles":384,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.8353654542,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"","submitted":25619,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2947298860069387,"acs":3568,"articleLive":2,"columnArticles":51,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":12106,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.26369545032497677,"acs":3408,"articleLive":2,"columnArticles":54,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.4610570293,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":12924,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.575973669775096,"acs":1050,"articleLive":2,"columnArticles":30,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1823,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4451686885146961,"acs":7376,"articleLive":2,"columnArticles":118,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":16569,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5265171094799959,"acs":5093,"articleLive":2,"columnArticles":87,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.2768834642,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":9673,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3125922473393925,"acs":4024,"articleLive":2,"columnArticles":98,"formTitle":"[1594]矩阵的最大非负积","frequency":0.3327171103,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":12873,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.461226558540294,"acs":1820,"articleLive":2,"columnArticles":37,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":3946,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7630397236614853,"acs":2209,"articleLive":2,"columnArticles":37,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"","submitted":2895,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6548223350253807,"acs":258,"articleLive":2,"columnArticles":18,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"","submitted":394,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6704747397816705,"acs":10564,"articleLive":2,"columnArticles":145,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.2768834642,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":15756,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.418899388549194,"acs":3768,"articleLive":2,"columnArticles":67,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":8995,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.683558419031099,"acs":16551,"articleLive":2,"columnArticles":203,"formTitle":"[1600]皇位继承顺序","frequency":0.8660803995,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24213,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4804295942720764,"acs":2013,"articleLive":2,"columnArticles":39,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4190,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7802746566791511,"acs":625,"articleLive":2,"columnArticles":27,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"","submitted":801,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8449242424242425,"acs":55765,"articleLive":2,"columnArticles":446,"formTitle":"[1603]设计停车系统","frequency":2.9828070182,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":66000,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.41375291375291373,"acs":3550,"articleLive":2,"columnArticles":59,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":8580,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7349425287356322,"acs":3197,"articleLive":2,"columnArticles":64,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"","submitted":4350,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.34025974025974026,"acs":1572,"articleLive":2,"columnArticles":32,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4620,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5515202702702703,"acs":2612,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"","submitted":4736,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6392261782259724,"acs":9318,"articleLive":2,"columnArticles":150,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":14577,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5117607274366874,"acs":6810,"articleLive":2,"columnArticles":115,"formTitle":"[1609]奇偶树","frequency":0.2768834642,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":13307,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.2701006512729426,"acs":2281,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8445,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6077844311377245,"acs":2030,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3340,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7357142857142858,"acs":412,"articleLive":2,"columnArticles":19,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"","submitted":560,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7272293752980449,"acs":1525,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"","submitted":2097,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8201288080147209,"acs":16045,"articleLive":2,"columnArticles":270,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.2507039587,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":19564,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49475728155339804,"acs":5096,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10300,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.2749745446317457,"acs":4861,"articleLive":2,"columnArticles":90,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.3625522588,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":17678,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6180478821362799,"acs":1678,"articleLive":2,"columnArticles":31,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2715,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5894308943089431,"acs":290,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"","submitted":492,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6784317559640204,"acs":6939,"articleLive":2,"columnArticles":124,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10228,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3670129052565313,"acs":2332,"articleLive":2,"columnArticles":39,"formTitle":"[1620]网络信号最好的坐标","frequency":0.532340412,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6354,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.43452380952380953,"acs":1679,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":3864,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.145315117927568,"acs":2255,"articleLive":2,"columnArticles":50,"formTitle":"[1622]奇妙序列","frequency":0.966163858,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":15518,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7831474597273854,"acs":3160,"articleLive":2,"columnArticles":42,"formTitle":"[1623]三人国家代表队","frequency":0.3041926436,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"","submitted":4035,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6274372853733776,"acs":10780,"articleLive":2,"columnArticles":183,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.8353654542,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":17181,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5394887447539107,"acs":2828,"articleLive":2,"columnArticles":63,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5242,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3829371205104456,"acs":3721,"articleLive":2,"columnArticles":82,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.3327171103,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":9717,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.378915079108815,"acs":2347,"articleLive":2,"columnArticles":36,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6194,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8416075650118203,"acs":356,"articleLive":2,"columnArticles":17,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"","submitted":423,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5221309833767274,"acs":7821,"articleLive":2,"columnArticles":86,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":14979,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7694687433326222,"acs":7213,"articleLive":2,"columnArticles":110,"formTitle":"[1630]等差子数组","frequency":0.3041926436,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9374,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4920396087920132,"acs":24199,"articleLive":2,"columnArticles":296,"formTitle":"[1631]最小体力消耗路径","frequency":1.229022426,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"","submitted":49181,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31667038607453696,"acs":1419,"articleLive":2,"columnArticles":26,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4481,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6587131367292225,"acs":2457,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":0.3041926436,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"","submitted":3730,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5203804347826086,"acs":383,"articleLive":2,"columnArticles":23,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"","submitted":736,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5442970822281167,"acs":1026,"articleLive":2,"columnArticles":27,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.3327171103,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"","submitted":1885,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7069351230425056,"acs":8532,"articleLive":2,"columnArticles":168,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.2768834642,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12069,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8060453400503779,"acs":5120,"articleLive":2,"columnArticles":65,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6352,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7099761841757078,"acs":2683,"articleLive":2,"columnArticles":46,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3779,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4018629407850965,"acs":1208,"articleLive":2,"columnArticles":27,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3006,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6637856989478205,"acs":12365,"articleLive":2,"columnArticles":210,"formTitle":"[1640]能否连接形成数组","frequency":0.2768834642,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":18628,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7692760447321955,"acs":11763,"articleLive":2,"columnArticles":263,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":1.8450487545,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15291,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4541546215995849,"acs":6127,"articleLive":2,"columnArticles":101,"formTitle":"[1642]可以到达的最远建筑","frequency":0.8353654542,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":13491,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.44944757139879093,"acs":2156,"articleLive":2,"columnArticles":47,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":4797,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5361726954492415,"acs":919,"articleLive":2,"columnArticles":19,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.8660803995,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"","submitted":1714,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4216374269005848,"acs":721,"articleLive":2,"columnArticles":23,"formTitle":"[1645]Hopper Company Queries II","frequency":0.3327171103,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"","submitted":1710,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5118418027132674,"acs":6678,"articleLive":2,"columnArticles":97,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":1.1969752486,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":13047,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2783026826387717,"acs":3299,"articleLive":2,"columnArticles":85,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.3625522588,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":11854,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.47469088098918083,"acs":2457,"articleLive":2,"columnArticles":61,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5176,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7948517940717629,"acs":1019,"articleLive":2,"columnArticles":25,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.3041926436,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"","submitted":1282,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.7027310924369747,"acs":669,"articleLive":2,"columnArticles":22,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"","submitted":952,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6594670972951151,"acs":6534,"articleLive":2,"columnArticles":167,"formTitle":"[1652]拆炸弹","frequency":0.8353654542,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":9908,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5007444907683145,"acs":3363,"articleLive":2,"columnArticles":80,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.3041926436,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":6716,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.27374784110535405,"acs":3170,"articleLive":2,"columnArticles":46,"formTitle":"[1654]到家的最少跳跃次数","frequency":1.1969752486,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":11580,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3817068018588931,"acs":1807,"articleLive":2,"columnArticles":30,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":4734,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7801558441558442,"acs":7509,"articleLive":2,"columnArticles":88,"formTitle":"[1656]设计有序流","frequency":0.2768834642,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":9625,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46491843536221716,"acs":5301,"articleLive":2,"columnArticles":74,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.3041926436,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11402,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.2953496755587599,"acs":8193,"articleLive":2,"columnArticles":145,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":27740,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.40582462804685027,"acs":1282,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":1.3148973373,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3159,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.741869918699187,"acs":365,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"","submitted":492,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7316498316498317,"acs":2173,"articleLive":2,"columnArticles":52,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.8660803995,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"","submitted":2970,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8136060581117788,"acs":19769,"articleLive":2,"columnArticles":269,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.8058212079,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":24298,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5713509316770187,"acs":7359,"articleLive":2,"columnArticles":127,"formTitle":"[1663]具有给定数值的最小字符串","frequency":1.229022426,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":12880,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5444998960282803,"acs":5237,"articleLive":2,"columnArticles":104,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9618,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6673765473179821,"acs":5014,"articleLive":2,"columnArticles":77,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.3327171103,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7513,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.680379746835443,"acs":215,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"","submitted":316,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6064959400374765,"acs":1942,"articleLive":2,"columnArticles":31,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"","submitted":3202,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4413376022767698,"acs":6203,"articleLive":2,"columnArticles":122,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":14055,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.768872010127257,"acs":11540,"articleLive":2,"columnArticles":211,"formTitle":"[1669]合并两个链表","frequency":0.8058212079,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":15009,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5274754446509159,"acs":3974,"articleLive":2,"columnArticles":75,"formTitle":"[1670]设计前中后队列","frequency":0.3327171103,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":7534,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46537059538274606,"acs":1915,"articleLive":2,"columnArticles":35,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.6036237946,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4115,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8502631519504867,"acs":37642,"articleLive":2,"columnArticles":433,"formTitle":"[1672]最富有客户的资产总量","frequency":0.2768834642,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":44271,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.350782541071255,"acs":7217,"articleLive":2,"columnArticles":162,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.3041926436,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":20574,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.35898212662829443,"acs":2370,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":1.0018055493,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6602,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4355926188786373,"acs":2455,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":5636,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7653061224489796,"acs":675,"articleLive":2,"columnArticles":19,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.4966987206,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"","submitted":882,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.40549273021001614,"acs":1757,"articleLive":2,"columnArticles":30,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"","submitted":4333,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8296660117878193,"acs":16892,"articleLive":2,"columnArticles":270,"formTitle":"[1678]设计 Goal 解析器","frequency":0.2768834642,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":20360,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.494142228191926,"acs":6622,"articleLive":2,"columnArticles":106,"formTitle":"[1679]K 和数对的最大数目","frequency":0.3041926436,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":13401,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4610406878822799,"acs":5201,"articleLive":2,"columnArticles":70,"formTitle":"[1680]连接连续二进制数字","frequency":0.2768834642,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11281,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3802294197031039,"acs":2254,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.6036237946,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":5928,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5335892514395394,"acs":278,"articleLive":2,"columnArticles":13,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"","submitted":521,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8951704545454545,"acs":3151,"articleLive":2,"columnArticles":35,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"","submitted":3520,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8275252262561115,"acs":15910,"articleLive":2,"columnArticles":336,"formTitle":"[1684]统计一致字符串的数目","frequency":1.1661086006,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":19226,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.59404741304724,"acs":3433,"articleLive":2,"columnArticles":79,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":5779,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4679462571976967,"acs":2438,"articleLive":2,"columnArticles":47,"formTitle":"[1686]石子游戏 VI","frequency":0.3327171103,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5210,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.3997308209959623,"acs":891,"articleLive":2,"columnArticles":19,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2229,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8037450031559016,"acs":19101,"articleLive":2,"columnArticles":250,"formTitle":"[1688]比赛中的配对次数","frequency":0.8058212079,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":23765,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8690105787181083,"acs":13965,"articleLive":2,"columnArticles":181,"formTitle":"[1689]十-二进制数的最少数目","frequency":1.1661086006,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":16070,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5094668659691082,"acs":4090,"articleLive":2,"columnArticles":103,"formTitle":"[1690]石子游戏 VII","frequency":0.3327171103,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8028,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4849052675411201,"acs":2329,"articleLive":2,"columnArticles":62,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":4803,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6538461538461539,"acs":153,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"","submitted":234,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8059581320450886,"acs":2002,"articleLive":2,"columnArticles":32,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"","submitted":2484,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6366024518388792,"acs":7270,"articleLive":2,"columnArticles":132,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":11420,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.45321730799936133,"acs":5677,"articleLive":2,"columnArticles":125,"formTitle":"[1695]删除子数组的最大得分","frequency":0.2768834642,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":12526,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.4000138150169234,"acs":5791,"articleLive":2,"columnArticles":107,"formTitle":"[1696]跳跃游戏 VI","frequency":1.1661086006,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":14477,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.52453300124533,"acs":2106,"articleLive":2,"columnArticles":42,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4015,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5438144329896907,"acs":422,"articleLive":2,"columnArticles":16,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"","submitted":776,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8001038421599169,"acs":1541,"articleLive":2,"columnArticles":39,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"","submitted":1926,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7194956757319996,"acs":6905,"articleLive":2,"columnArticles":165,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.2768834642,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":9597,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6104330379535194,"acs":3651,"articleLive":2,"columnArticles":75,"formTitle":"[1701]平均等待时间","frequency":0.8660803995,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":5981,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.47571801566579636,"acs":2733,"articleLive":2,"columnArticles":65,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.9313777419,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":5745,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3889240506329114,"acs":1229,"articleLive":2,"columnArticles":22,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3160,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7813362039965014,"acs":11613,"articleLive":2,"columnArticles":175,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":14863,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.34626545546303306,"acs":5489,"articleLive":2,"columnArticles":114,"formTitle":"[1705]吃苹果的最大数目","frequency":0.8660803995,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":15852,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5849002849002849,"acs":4106,"articleLive":2,"columnArticles":106,"formTitle":"[1706]球会落何处","frequency":0.8980524322,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7020,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5033776500179662,"acs":14009,"articleLive":2,"columnArticles":147,"formTitle":"[1707]与数组中元素的最大异或值","frequency":2.0672656307,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":27830,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.664396887159533,"acs":683,"articleLive":2,"columnArticles":23,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"","submitted":1028,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7200902934537246,"acs":1276,"articleLive":2,"columnArticles":34,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"","submitted":1772,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6923773780251068,"acs":10700,"articleLive":2,"columnArticles":175,"formTitle":"[1710]卡车上的最大单元数","frequency":1.1969752486,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"","submitted":15454,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.35923384032711353,"acs":29783,"articleLive":2,"columnArticles":357,"formTitle":"[1711]大餐计数","frequency":2.4996909759,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":82907,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26560146085368636,"acs":5818,"articleLive":2,"columnArticles":101,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":21905,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4973379368203672,"acs":15413,"articleLive":2,"columnArticles":171,"formTitle":"[1713]得到子序列的最少操作次数","frequency":1.1762712897,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":30991,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6342857142857142,"acs":222,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"","submitted":350,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7370820668693009,"acs":1455,"articleLive":2,"columnArticles":33,"formTitle":"[1715]苹果和橘子的个数","frequency":0.8660803995,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"","submitted":1974,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6748884807137234,"acs":7716,"articleLive":2,"columnArticles":182,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":11433,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43122521394280944,"acs":2066,"articleLive":2,"columnArticles":48,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":4791,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.48623853211009177,"acs":1855,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":3815,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3614013521819299,"acs":588,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1627,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.869298312300441,"acs":45739,"articleLive":2,"columnArticles":481,"formTitle":"[1720]解码异或后的数组","frequency":2.76335124,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":52616,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6494489010630666,"acs":9958,"articleLive":2,"columnArticles":157,"formTitle":"[1721]交换链表中的节点","frequency":0.3041926436,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":15333,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5132949257699978,"acs":4633,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9026,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.507857287381129,"acs":22590,"articleLive":2,"columnArticles":175,"formTitle":"[1723]完成所有工作的最短时间","frequency":3.5822027378,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":44481,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5536332179930796,"acs":320,"articleLive":2,"columnArticles":10,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"","submitted":578,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.786817556201254,"acs":10290,"articleLive":2,"columnArticles":137,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.2768834642,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13078,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4749330954504906,"acs":5324,"articleLive":2,"columnArticles":106,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11210,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.572639225181598,"acs":3311,"articleLive":2,"columnArticles":82,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.532340412,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5782,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3480905711388983,"acs":1030,"articleLive":2,"columnArticles":24,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":2959,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6249162759544541,"acs":1866,"articleLive":2,"columnArticles":21,"formTitle":"[1729]求关注者的数量","frequency":0.3041926436,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"","submitted":2986,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5354416575790621,"acs":491,"articleLive":2,"columnArticles":21,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"","submitted":917,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.4769874476987448,"acs":1596,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"","submitted":3346,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7929852132295164,"acs":11101,"articleLive":2,"columnArticles":192,"formTitle":"[1732]找到最高海拔","frequency":1.5291604751,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":13999,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4576502732240437,"acs":2010,"articleLive":2,"columnArticles":55,"formTitle":"[1733]需要教语言的最少人数","frequency":0.5679821033,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4392,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7232900974110538,"acs":27770,"articleLive":2,"columnArticles":367,"formTitle":"[1734]解码异或后的排列","frequency":2.7000389606,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38394,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4844844844844845,"acs":968,"articleLive":2,"columnArticles":24,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":1998,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4491451012947205,"acs":28134,"articleLive":2,"columnArticles":349,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":2.1704854006,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":62639,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3078558143654238,"acs":3476,"articleLive":2,"columnArticles":100,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":1.0018055493,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11291,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6540284360189573,"acs":28014,"articleLive":2,"columnArticles":385,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":2.0976668046,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":42833,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4703845452888646,"acs":2581,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5487,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7002762430939227,"acs":507,"articleLive":2,"columnArticles":16,"formTitle":"[1740]找到二叉树中的距离","frequency":0.6036237946,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"","submitted":724,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8428571428571429,"acs":1770,"articleLive":2,"columnArticles":30,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"","submitted":2100,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7056550755180893,"acs":8036,"articleLive":2,"columnArticles":124,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.2768834642,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11388,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6974609683015297,"acs":22113,"articleLive":2,"columnArticles":323,"formTitle":"[1743]从相邻元素对还原数组","frequency":0.8483808224,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":31705,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36309693099257956,"acs":28087,"articleLive":2,"columnArticles":363,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":2.7000389606,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":77354,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.48450491307634164,"acs":3205,"articleLive":2,"columnArticles":70,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":6615,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.6091428571428571,"acs":533,"articleLive":2,"columnArticles":25,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"","submitted":875,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7031736154324829,"acs":1130,"articleLive":2,"columnArticles":32,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"","submitted":1607,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7494150336355659,"acs":10249,"articleLive":2,"columnArticles":213,"formTitle":"[1748]唯一元素的和","frequency":1.1969752486,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":13676,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5303244005641748,"acs":3384,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":1.1969752486,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6381,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.45898234683281414,"acs":3094,"articleLive":2,"columnArticles":78,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":6741,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.46792009400705054,"acs":1991,"articleLive":2,"columnArticles":32,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":1.1218535916,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4255,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6868074273734651,"acs":9173,"articleLive":2,"columnArticles":109,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":13356,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6275685882483617,"acs":5650,"articleLive":2,"columnArticles":122,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9003,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.42007746257720086,"acs":4013,"articleLive":2,"columnArticles":89,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.3327171103,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":9553,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.39651058753355206,"acs":2659,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.3041926436,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":6706,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8121019108280255,"acs":255,"articleLive":2,"columnArticles":11,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"","submitted":314,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9238907849829352,"acs":2707,"articleLive":2,"columnArticles":30,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"","submitted":2930,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6350009368559115,"acs":6778,"articleLive":2,"columnArticles":108,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":10674,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.42744984006978776,"acs":4410,"articleLive":2,"columnArticles":92,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.2768834642,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10317,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5360415811790453,"acs":3919,"articleLive":2,"columnArticles":75,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7311,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4278821299327934,"acs":2483,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":1.0398908834,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":5803,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.669449081803005,"acs":401,"articleLive":2,"columnArticles":17,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"","submitted":599,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6104963112005366,"acs":3641,"articleLive":2,"columnArticles":75,"formTitle":"[1763]最长的美好子字符串","frequency":0.3327171103,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":5964,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.47643979057591623,"acs":2184,"articleLive":2,"columnArticles":51,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4584,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5651093439363817,"acs":3411,"articleLive":2,"columnArticles":80,"formTitle":"[1765]地图中的最高点","frequency":0.3327171103,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6036,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.375139353400223,"acs":1346,"articleLive":2,"columnArticles":25,"formTitle":"[1766]互质树","frequency":0.7499407495,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3588,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.8061224489795918,"acs":711,"articleLive":2,"columnArticles":19,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"","submitted":882,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7690136768217671,"acs":10627,"articleLive":2,"columnArticles":195,"formTitle":"[1768]交替合并字符串","frequency":1.1363444987,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":13819,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8549867608120035,"acs":9687,"articleLive":2,"columnArticles":163,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.2768834642,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11330,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.36849365458892774,"acs":4007,"articleLive":2,"columnArticles":99,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.4966987206,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":10874,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36369540509823023,"acs":2240,"articleLive":2,"columnArticles":46,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6159,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5387673956262425,"acs":271,"articleLive":2,"columnArticles":10,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"","submitted":503,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8409165302782324,"acs":15414,"articleLive":2,"columnArticles":194,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":1.4308011549,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":18330,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5551382066840027,"acs":5764,"articleLive":2,"columnArticles":87,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.8660803995,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10383,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4720776968435657,"acs":4083,"articleLive":2,"columnArticles":87,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.8980524322,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":8649,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4634010576120234,"acs":1665,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":1.4103714351,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3593,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7780216070222823,"acs":4609,"articleLive":2,"columnArticles":57,"formTitle":"[1777]每家商店的产品价格","frequency":3.3833338447,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"","submitted":5924,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5571955719557196,"acs":151,"articleLive":2,"columnArticles":8,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"","submitted":271,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6471479050984351,"acs":5128,"articleLive":2,"columnArticles":65,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.3041926436,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":7924,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6612594201047388,"acs":5177,"articleLive":2,"columnArticles":106,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":7829,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5156903765690377,"acs":3944,"articleLive":2,"columnArticles":56,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.2507039587,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7648,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2851415685291907,"acs":1138,"articleLive":2,"columnArticles":32,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":3991,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7928853754940711,"acs":1003,"articleLive":2,"columnArticles":25,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"","submitted":1265,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42036981807336715,"acs":8457,"articleLive":2,"columnArticles":98,"formTitle":"[1784]检查二进制字符串字段","frequency":0.2768834642,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":20118,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.3471840080857993,"acs":6183,"articleLive":2,"columnArticles":61,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":17809,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3392367699768079,"acs":3218,"articleLive":2,"columnArticles":83,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9486,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541105460235846,"acs":11704,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":2.7000389606,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":17893,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6796536796536796,"acs":157,"articleLive":2,"columnArticles":12,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"","submitted":231,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7180941576857629,"acs":1266,"articleLive":2,"columnArticles":27,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"","submitted":1763,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6520006211501631,"acs":12596,"articleLive":2,"columnArticles":135,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.2768834642,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":19319,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8097144382172404,"acs":9102,"articleLive":2,"columnArticles":123,"formTitle":"[1791]找出星型图的中心节点","frequency":0.2255770086,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":11241,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5136418511066398,"acs":6382,"articleLive":2,"columnArticles":103,"formTitle":"[1792]最大平均通过率","frequency":1.7395770104,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12425,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41100252552981226,"acs":3743,"articleLive":2,"columnArticles":89,"formTitle":"[1793]好子数组的最大分数","frequency":0.966163858,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9107,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.6822916666666666,"acs":131,"articleLive":2,"columnArticles":8,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"","submitted":192,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7908496732026143,"acs":1452,"articleLive":2,"columnArticles":26,"formTitle":"[1795]每个产品在不同商店的价格","frequency":1.2623366327,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"","submitted":1836,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.4865217037218014,"acs":5974,"articleLive":2,"columnArticles":113,"formTitle":"[1796]字符串中第二大的数字","frequency":0.2768834642,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":12279,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5728240268260679,"acs":3929,"articleLive":2,"columnArticles":60,"formTitle":"[1797]设计一个验证系统","frequency":0.8660803995,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":6859,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5180744452397996,"acs":2895,"articleLive":2,"columnArticles":46,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5588,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5103596094308168,"acs":2143,"articleLive":2,"columnArticles":33,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.4265946251,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4199,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6835461835461836,"acs":9206,"articleLive":2,"columnArticles":148,"formTitle":"[1800]最大升序子数组和","frequency":0.8353654542,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":13468,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.37633898947767563,"acs":3970,"articleLive":2,"columnArticles":107,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10549,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2619569421167977,"acs":4064,"articleLive":2,"columnArticles":106,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":15514,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.4107825387246027,"acs":2042,"articleLive":2,"columnArticles":51,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":1.0798482563,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":4971,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5766773162939297,"acs":361,"articleLive":2,"columnArticles":25,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.6036237946,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"","submitted":626,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4959498421124891,"acs":10837,"articleLive":2,"columnArticles":143,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.2507039587,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":21851,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6634996041171813,"acs":5028,"articleLive":2,"columnArticles":80,"formTitle":"[1806]还原排列的最少操作步数","frequency":1.2623366327,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7578,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5839804276140836,"acs":5490,"articleLive":2,"columnArticles":83,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9401,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2655064703257474,"acs":2380,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.6978998714,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":8964,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6390532544378699,"acs":1296,"articleLive":2,"columnArticles":28,"formTitle":"[1809]没有广告的剧集","frequency":0.8353654542,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"","submitted":2028,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6567164179104478,"acs":132,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":1.3709030133,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"","submitted":201,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6697435897435897,"acs":653,"articleLive":2,"columnArticles":22,"formTitle":"[1811]寻找面试候选人","frequency":0.2768834642,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"","submitted":975,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7947385170255649,"acs":7492,"articleLive":2,"columnArticles":174,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":9427,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5229599594526102,"acs":5159,"articleLive":2,"columnArticles":68,"formTitle":"[1813]句子相似性 III","frequency":1.229022426,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":9865,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3411019114790964,"acs":3337,"articleLive":2,"columnArticles":76,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.3327171103,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":9783,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.3006384213580963,"acs":1554,"articleLive":2,"columnArticles":36,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5169,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7540119389099931,"acs":9726,"articleLive":2,"columnArticles":141,"formTitle":"[1816]截断句子","frequency":0.2768834642,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":12899,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6951234342697312,"acs":5716,"articleLive":2,"columnArticles":93,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.3327171103,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8223,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37413981511562655,"acs":25336,"articleLive":2,"columnArticles":337,"formTitle":"[1818]绝对差值和","frequency":2.2690405504,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":67718,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.36443719412724307,"acs":2234,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6130,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.46496815286624205,"acs":73,"articleLive":2,"columnArticles":7,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"","submitted":157,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9008226691042047,"acs":1971,"articleLive":2,"columnArticles":18,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":1.2623366327,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"","submitted":2188,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8132287470850117,"acs":19180,"articleLive":2,"columnArticles":186,"formTitle":"[1822]数组元素积的符号","frequency":0.8058212079,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":23585,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7054104295078759,"acs":7210,"articleLive":2,"columnArticles":89,"formTitle":"[1823]找出游戏的获胜者","frequency":0.8058212079,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":10221,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6621514645087518,"acs":7528,"articleLive":2,"columnArticles":151,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11369,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2869226488592098,"acs":2578,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.6036237946,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":8985,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.43953488372093025,"acs":189,"articleLive":2,"columnArticles":15,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"","submitted":430,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7959521619135235,"acs":8652,"articleLive":2,"columnArticles":132,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":10870,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.870800395256917,"acs":7050,"articleLive":2,"columnArticles":91,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.7773697867,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8096,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.676355206847361,"acs":3793,"articleLive":2,"columnArticles":80,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5608,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.48148148148148145,"acs":819,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1701,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7392218717139852,"acs":703,"articleLive":2,"columnArticles":20,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"","submitted":951,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8215139442231075,"acs":12372,"articleLive":2,"columnArticles":202,"formTitle":"[1832]判断句子是否为全字母句","frequency":1.1969752486,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":15060,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6852281761806328,"acs":43094,"articleLive":2,"columnArticles":385,"formTitle":"[1833]雪糕的最大数量","frequency":1.4623744168,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":62890,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3504684572142411,"acs":5611,"articleLive":2,"columnArticles":122,"formTitle":"[1834]单线程 CPU","frequency":1.5291604751,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":16010,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5072903132669265,"acs":3514,"articleLive":2,"columnArticles":59,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.6492521472,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":6927,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7105263157894737,"acs":297,"articleLive":2,"columnArticles":21,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.4966987206,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"","submitted":418,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7938144329896907,"acs":7161,"articleLive":2,"columnArticles":82,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9021,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.4309235600817148,"acs":28266,"articleLive":2,"columnArticles":299,"formTitle":"[1838]最高频元素的频数","frequency":2.8311163642,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":65594,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5805375347544022,"acs":6264,"articleLive":2,"columnArticles":123,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":10790,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.390294917381301,"acs":1866,"articleLive":2,"columnArticles":44,"formTitle":"[1840]最高建筑高度","frequency":0.4610570293,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":4781,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5135764158262219,"acs":662,"articleLive":2,"columnArticles":25,"formTitle":"[1841]联赛信息统计","frequency":1.229022426,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"","submitted":1289,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.7086614173228346,"acs":90,"articleLive":2,"columnArticles":9,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"","submitted":127,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.524416135881104,"acs":494,"articleLive":2,"columnArticles":20,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.3327171103,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"","submitted":942,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.802680280791321,"acs":6289,"articleLive":2,"columnArticles":105,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":7835,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5819574835437574,"acs":5393,"articleLive":2,"columnArticles":53,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":9267,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6335155250610536,"acs":27238,"articleLive":2,"columnArticles":374,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":1.9925912299,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":42995,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3592295345104334,"acs":2238,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.4966987206,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6230,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6854256854256854,"acs":7125,"articleLive":2,"columnArticles":92,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":10395,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3292156027505629,"acs":5410,"articleLive":2,"columnArticles":106,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.3938048023,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":16433,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6061175207942044,"acs":2259,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.4610570293,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3727,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.39696905914544306,"acs":1886,"articleLive":2,"columnArticles":45,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4751,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7009803921568627,"acs":143,"articleLive":2,"columnArticles":10,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"","submitted":204,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6487845766974015,"acs":774,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.3327171103,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"","submitted":1193,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7946383771772633,"acs":11086,"articleLive":2,"columnArticles":111,"formTitle":"[1854]人口最多的年份","frequency":1.1969752486,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":13951,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6919260568166372,"acs":10181,"articleLive":2,"columnArticles":97,"formTitle":"[1855]下标对中的最大距离","frequency":1.229022426,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":14714,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.356262222600119,"acs":4190,"articleLive":2,"columnArticles":80,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.9313777419,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":11761,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4476550344521005,"acs":2014,"articleLive":2,"columnArticles":30,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4499,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.7084548104956269,"acs":243,"articleLive":2,"columnArticles":14,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.6492521472,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"","submitted":343,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7732305013061326,"acs":6216,"articleLive":2,"columnArticles":130,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":8039,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7717346518335394,"acs":3746,"articleLive":2,"columnArticles":60,"formTitle":"[1860]增长的内存泄露","frequency":0.2768834642,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":4854,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6183613030602172,"acs":3132,"articleLive":2,"columnArticles":66,"formTitle":"[1861]旋转盒子","frequency":0.3041926436,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5065,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3099620216184633,"acs":2122,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":6846,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9234152855235253,"acs":11756,"articleLive":2,"columnArticles":133,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":1.9286395831,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":12731,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3862561439302606,"acs":4165,"articleLive":2,"columnArticles":102,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.3938048023,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":10783,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5171747967479675,"acs":5089,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":9840,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5945113413609633,"acs":2123,"articleLive":2,"columnArticles":48,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":1.0398908834,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3571,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7777777777777778,"acs":371,"articleLive":2,"columnArticles":13,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"","submitted":477,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5561797752808989,"acs":99,"articleLive":2,"columnArticles":9,"formTitle":"[1868]两个行程编码数组的积","frequency":0.8660803995,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"","submitted":178,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.8024031161286064,"acs":12154,"articleLive":2,"columnArticles":131,"formTitle":"[1869]哪种连续子字符串更长","frequency":1.1363444987,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":15147,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.461113580090153,"acs":7263,"articleLive":2,"columnArticles":70,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.3327171103,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":15751,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27557177615571776,"acs":5663,"articleLive":2,"columnArticles":123,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":20550,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6240053050397878,"acs":1882,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3016,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.7980972515856237,"acs":1510,"articleLive":2,"columnArticles":27,"formTitle":"[1873]计算特殊奖金","frequency":1.7395770104,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"","submitted":1892,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.868421052631579,"acs":198,"articleLive":2,"columnArticles":13,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"","submitted":228,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7422434367541766,"acs":311,"articleLive":2,"columnArticles":17,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"","submitted":419,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7319816692126093,"acs":5271,"articleLive":2,"columnArticles":84,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":7201,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8195480473892058,"acs":29884,"articleLive":2,"columnArticles":394,"formTitle":"[1877]数组中最大数对和的最小值","frequency":2.6274381477,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":36464,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.42723102585487904,"acs":2049,"articleLive":2,"columnArticles":54,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":4796,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.4047893161409164,"acs":1758,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.4265946251,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4343,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7724631202503353,"acs":6912,"articleLive":2,"columnArticles":88,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.2768834642,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":8948,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.35139613378336915,"acs":5726,"articleLive":2,"columnArticles":62,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":16295,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2766109785202864,"acs":3477,"articleLive":2,"columnArticles":109,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":12570,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.37023914968999116,"acs":1672,"articleLive":2,"columnArticles":25,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4516,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.7011972930765227,"acs":1347,"articleLive":2,"columnArticles":31,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":1.7051051014,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":1921,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5365853658536586,"acs":176,"articleLive":2,"columnArticles":8,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"","submitted":328,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5716382522298746,"acs":5063,"articleLive":2,"columnArticles":75,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.3041926436,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":8857,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6406312160190956,"acs":4831,"articleLive":2,"columnArticles":59,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7541,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3138617359557178,"acs":2665,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.4265946251,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8491,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2744084851781344,"acs":2018,"articleLive":2,"columnArticles":40,"formTitle":"[1889]装包裹的最小浪费空间","frequency":1.0018055493,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7354,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.696875,"acs":669,"articleLive":2,"columnArticles":16,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"","submitted":960,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.5035211267605634,"acs":143,"articleLive":2,"columnArticles":8,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"","submitted":284,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.35181236673773986,"acs":330,"articleLive":2,"columnArticles":11,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.3625522588,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"","submitted":938,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5915569326103796,"acs":30548,"articleLive":2,"columnArticles":402,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":2.0813292414,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":51640,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.4295988934993084,"acs":3106,"articleLive":2,"columnArticles":46,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":7230,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5313028764805414,"acs":1884,"articleLive":2,"columnArticles":38,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3546,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5009299442033478,"acs":808,"articleLive":2,"columnArticles":30,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1613,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5275419902474264,"acs":5842,"articleLive":2,"columnArticles":72,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.2507039587,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11074,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3068430942687128,"acs":3919,"articleLive":2,"columnArticles":61,"formTitle":"[1898]可移除字符的最大数目","frequency":0.3938048023,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":12772,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6268019220501868,"acs":3522,"articleLive":2,"columnArticles":41,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5619,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.4239457831325301,"acs":1126,"articleLive":2,"columnArticles":33,"formTitle":"[1900]最佳运动员的比拼回合","frequency":1.2128460785,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2656,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6582597730138714,"acs":522,"articleLive":2,"columnArticles":22,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":793,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4296875,"acs":55,"articleLive":2,"columnArticles":3,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"","submitted":128,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6446690640489844,"acs":6633,"articleLive":2,"columnArticles":94,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":10289,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.27485430236544395,"acs":3207,"articleLive":2,"columnArticles":67,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":11668,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5736040609137056,"acs":4181,"articleLive":2,"columnArticles":85,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":7289,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4216910453085979,"acs":2364,"articleLive":2,"columnArticles":53,"formTitle":"[1906]查询差绝对值的最小值","frequency":1.0798482563,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5606,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.6317829457364341,"acs":326,"articleLive":2,"columnArticles":14,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"","submitted":516,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6507936507936508,"acs":82,"articleLive":2,"columnArticles":6,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"","submitted":126,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.3292015453960077,"acs":4090,"articleLive":2,"columnArticles":65,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.2507039587,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":12424,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6780179445350734,"acs":3325,"articleLive":2,"columnArticles":54,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":4904,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5636470128855916,"acs":2887,"articleLive":2,"columnArticles":63,"formTitle":"[1911]最大子序列交替和","frequency":0.2507039587,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5122,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.3040796963946869,"acs":1282,"articleLive":2,"columnArticles":36,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":4216,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8468172983479106,"acs":6971,"articleLive":2,"columnArticles":72,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.2507039587,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":8232,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.43911752227407724,"acs":3105,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.8660803995,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7071,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3887695172611374,"acs":2714,"articleLive":2,"columnArticles":55,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":6981,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5548189699133096,"acs":1088,"articleLive":2,"columnArticles":17,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.966163858,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":1961,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.28711256117455136,"acs":176,"articleLive":2,"columnArticles":8,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"","submitted":613,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.4642857142857143,"acs":78,"articleLive":2,"columnArticles":2,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"","submitted":168,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.41903171953255425,"acs":251,"articleLive":2,"columnArticles":9,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"","submitted":599,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9405309734513274,"acs":7971,"articleLive":2,"columnArticles":68,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":8475,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.3421173085725495,"acs":5232,"articleLive":2,"columnArticles":86,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.8980524322,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":15293,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.36241280262617975,"acs":4416,"articleLive":2,"columnArticles":78,"formTitle":"[1922]统计好数字的数目","frequency":0.3041926436,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12185,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23557046979865773,"acs":1404,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":1.2623366327,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":5960,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.5223880597014925,"acs":35,"articleLive":2,"columnArticles":2,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"","submitted":67,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6987104337631888,"acs":4172,"articleLive":2,"columnArticles":53,"formTitle":"[1925]统计平方和三元组的数目","frequency":1.4623744168,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":5971,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.34578930166684824,"acs":3174,"articleLive":2,"columnArticles":57,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":9179,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.40973782771535583,"acs":1641,"articleLive":2,"columnArticles":36,"formTitle":"[1927]求和游戏","frequency":0.2768834642,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4005,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.34955520669806384,"acs":1336,"articleLive":2,"columnArticles":29,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":1.3331626853,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":3822,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9426826655238911,"acs":8799,"articleLive":2,"columnArticles":73,"formTitle":"[1929]数组串联","frequency":0.1782084566,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":9334,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.47502054982190156,"acs":5201,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.8058212079,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":10949,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5513230590287874,"acs":1896,"articleLive":2,"columnArticles":61,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.2768834642,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3439,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.32407709898725906,"acs":992,"articleLive":2,"columnArticles":35,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.4610570293,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3061,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5732484076433121,"acs":360,"articleLive":2,"columnArticles":21,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"","submitted":628,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7292576419213974,"acs":167,"articleLive":2,"columnArticles":8,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"","submitted":229,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7431795634920635,"acs":5993,"articleLive":2,"columnArticles":85,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":8064,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.44894173201787674,"acs":5324,"articleLive":2,"columnArticles":59,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":11859,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.23835946924004825,"acs":2964,"articleLive":2,"columnArticles":62,"formTitle":"[1937]扣分后的最大得分","frequency":0.8660803995,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":12435,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3331216259129883,"acs":1049,"articleLive":2,"columnArticles":39,"formTitle":"[1938]查询最大基因差","frequency":0.8660803995,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3149,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6613756613756614,"acs":250,"articleLive":2,"columnArticles":9,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"","submitted":378,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.8264984227129337,"acs":262,"articleLive":2,"columnArticles":21,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"","submitted":317,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7781318462457678,"acs":3907,"articleLive":2,"columnArticles":68,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":5021,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.38800245474071804,"acs":2529,"articleLive":2,"columnArticles":62,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":6518,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4008589835361489,"acs":1680,"articleLive":2,"columnArticles":47,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4191,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.576068376068376,"acs":1685,"articleLive":2,"columnArticles":47,"formTitle":"[1944]队列中可以看到的人数","frequency":0.3041926436,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":2925,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6617811590959947,"acs":5915,"articleLive":2,"columnArticles":65,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.0356416913,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":8938,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.3023422562141491,"acs":5060,"articleLive":2,"columnArticles":75,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.3327171103,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":16736,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.536125503742084,"acs":3725,"articleLive":2,"columnArticles":80,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":6948,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5184534270650264,"acs":885,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.2255770086,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1707,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5514018691588785,"acs":118,"articleLive":2,"columnArticles":9,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"","submitted":214,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5572916666666666,"acs":107,"articleLive":2,"columnArticles":5,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"","submitted":192,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.7228915662650602,"acs":120,"articleLive":2,"columnArticles":10,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"","submitted":166,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5413153456998314,"acs":6099,"articleLive":2,"columnArticles":67,"formTitle":"[1952]三除数","frequency":0.0712833827,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":11267,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3181634140416228,"acs":3929,"articleLive":2,"columnArticles":81,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":12349,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.48076682120035086,"acs":3837,"articleLive":2,"columnArticles":65,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":7981,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49375383985254967,"acs":2411,"articleLive":2,"columnArticles":38,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":4883,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.43014705882352944,"acs":117,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":1.0798482563,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"","submitted":272,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6069012178619756,"acs":3588,"articleLive":2,"columnArticles":44,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":5912,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.41758639406549664,"acs":2308,"articleLive":2,"columnArticles":41,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5527,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.40786082474226804,"acs":1266,"articleLive":2,"columnArticles":30,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3104,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.2766964755391899,"acs":526,"articleLive":2,"columnArticles":16,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":1901,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5339678658749564,"acs":6115,"articleLive":2,"columnArticles":52,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.106925074,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":11452,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4235512755533029,"acs":5014,"articleLive":2,"columnArticles":68,"formTitle":"[1962]移除石子使总数最小","frequency":0.4966987206,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":11838,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6112397714991509,"acs":3959,"articleLive":2,"columnArticles":52,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.2014329097,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":6477,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.38119138819178444,"acs":2886,"articleLive":2,"columnArticles":43,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":7571,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7387387387387387,"acs":164,"articleLive":2,"columnArticles":6,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"","submitted":222,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.6785714285714286,"acs":19,"articleLive":2,"columnArticles":4,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"","submitted":28,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7698984846255701,"acs":5233,"articleLive":2,"columnArticles":46,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":6797,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3463503048278135,"acs":4204,"articleLive":2,"columnArticles":64,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":12138,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.2704934541792548,"acs":2686,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":1.3709030133,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":9930,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.47461865466366593,"acs":1898,"articleLive":2,"columnArticles":45,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":1.4308011549,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":3999,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5377777777777778,"acs":121,"articleLive":2,"columnArticles":10,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":225,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4266666666666667,"acs":32,"articleLive":2,"columnArticles":5,"formTitle":"[1972]First and Last Call On the Same Day","frequency":1.6398929527,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"","submitted":75,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.4125,"acs":33,"articleLive":2,"columnArticles":7,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"","submitted":80,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7457150885080078,"acs":2654,"articleLive":2,"columnArticles":32,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.5679821033,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":3559,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3636837532580365,"acs":2093,"articleLive":2,"columnArticles":34,"formTitle":"[1975]最大方阵和","frequency":0.8058212079,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":5755,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.24156958920907418,"acs":1182,"articleLive":2,"columnArticles":18,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":4893,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.18776671408250356,"acs":396,"articleLive":2,"columnArticles":10,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":2109,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.8533411033411034,"acs":4393,"articleLive":2,"columnArticles":34,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":5148,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5303010724899858,"acs":4104,"articleLive":2,"columnArticles":70,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":7739,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.2536923631123919,"acs":2817,"articleLive":2,"columnArticles":57,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":1.5645561361,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":11104,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.38807260155574763,"acs":449,"articleLive":2,"columnArticles":12,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1157,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.844298315278969,"acs":79733,"articleLive":2,"columnArticles":614,"formTitle":"[LCP 01]猜数字","frequency":2.121137653,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":94437,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.687879588064431,"acs":13025,"articleLive":2,"columnArticles":226,"formTitle":"[LCP 02]分式化简","frequency":1.4623744168,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":18935,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21744434278743519,"acs":10695,"articleLive":2,"columnArticles":178,"formTitle":"[LCP 03]机器人大冒险","frequency":1.4951320132,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":49185,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3731089842543995,"acs":2417,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 04]覆盖","frequency":1.9870891527,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6478,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19517388218594747,"acs":1925,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":9863,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8389324523345142,"acs":42153,"articleLive":2,"columnArticles":639,"formTitle":"[LCP 06]拿硬币","frequency":1.6719059297,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":50246,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7712628070608567,"acs":37488,"articleLive":2,"columnArticles":453,"formTitle":"[LCP 07]传递信息","frequency":3.3099871973,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":48606,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.28097669777542994,"acs":4787,"articleLive":2,"columnArticles":98,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17037,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.264430368453921,"acs":5928,"articleLive":2,"columnArticles":103,"formTitle":"[LCP 09]最小跳跃次数","frequency":2.9469865697,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":22418,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.579302987197724,"acs":1629,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 10]二叉树任务调度","frequency":1.2623366327,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":2812,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6829013377926422,"acs":6534,"articleLive":2,"columnArticles":64,"formTitle":"[LCP 11]期望个数统计","frequency":0.3625522588,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":9568,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4053419835737456,"acs":5873,"articleLive":2,"columnArticles":96,"formTitle":"[LCP 12]小张刷题计划","frequency":1.8450487545,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":14489,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6158536585365854,"acs":9292,"articleLive":2,"columnArticles":83,"formTitle":"[LCP 13]寻宝","frequency":0.6036237946,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15088,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.1991419088480531,"acs":2460,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":1.9870891527,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12353,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5711191335740072,"acs":791,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.8058212079,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1385,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.29201101928374656,"acs":530,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1815,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7973812616281111,"acs":22715,"articleLive":2,"columnArticles":238,"formTitle":"[LCP 17]速算机器人","frequency":1.6398929527,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":28487,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2826552095992879,"acs":16513,"articleLive":2,"columnArticles":206,"formTitle":"[LCP 18]早餐组合","frequency":1.6719059297,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":58421,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5158026466437682,"acs":19372,"articleLive":2,"columnArticles":201,"formTitle":"[LCP 19]秋叶收藏集","frequency":1.6089881446,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":37557,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.29560460290511226,"acs":1567,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 20]快速公交","frequency":1.1661086006,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5301,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.315742397137746,"acs":706,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 21]追逐游戏","frequency":1.2623366327,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2236,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3315634669009511,"acs":8680,"articleLive":2,"columnArticles":182,"formTitle":"[LCP 22]黑白方格画","frequency":2.5148736074,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26179,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.33174126637554585,"acs":2431,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":1.0398908834,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7328,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2662760416666667,"acs":818,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3072,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.3187385180649112,"acs":1041,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3266,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3265720081135903,"acs":483,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1479,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.3252387448840382,"acs":1192,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 27]黑盒光线反射","frequency":1.6398929527,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3665,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.26403312950920443,"acs":8161,"articleLive":2,"columnArticles":143,"formTitle":"[LCP 28]采购方案","frequency":1.4951320132,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":30909,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.1673171559477346,"acs":3944,"articleLive":2,"columnArticles":105,"formTitle":"[LCP 29]乐团站位","frequency":2.3713792637,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":23572,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3292138939670932,"acs":4502,"articleLive":2,"columnArticles":77,"formTitle":"[LCP 30]魔塔游戏","frequency":0.3327171103,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"notac","submitted":13675,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.21644017235664567,"acs":1306,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6034,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.349437148217636,"acs":745,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 32]批量处理任务","frequency":1.1218535916,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2132,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.1953815047355539,"acs":3672,"articleLive":2,"columnArticles":73,"formTitle":"[LCP 33]蓄水","frequency":1.1969752486,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":18794,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.45456674473067915,"acs":1941,"articleLive":2,"columnArticles":56,"formTitle":"[LCP 34]二叉树染色","frequency":1.4623744168,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4270,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.35876042908224076,"acs":903,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 35]电动车游城市","frequency":1.1218535916,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2517,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.224,"acs":588,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 36]最多牌组数","frequency":1.9348384624,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":2625,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.1730180806675939,"acs":622,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 37]最小矩形面积","frequency":1.7663237238,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":3595,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5156017830609212,"acs":347,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 38]守卫城堡","frequency":1.4308011549,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":673,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5363428943937418,"acs":3291,"articleLive":2,"columnArticles":81,"formTitle":"[LCS 01]下载插件","frequency":1.229022426,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":6136,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.7053227050655696,"acs":2743,"articleLive":2,"columnArticles":51,"formTitle":"[LCS 02]完成一半题目","frequency":0.8353654542,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":3889,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4165984165984166,"acs":1526,"articleLive":2,"columnArticles":50,"formTitle":"[LCS 03]主题空间","frequency":0.2768834642,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":3663,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6785903536034178,"acs":370093,"articleLive":2,"columnArticles":2653,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":4.6523769809,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":545385,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4030976458160924,"acs":239648,"articleLive":2,"columnArticles":1962,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":3.8073280932,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":594516,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7619224707361562,"acs":258150,"articleLive":2,"columnArticles":1826,"formTitle":"[剑指 Offer 05]替换空格","frequency":3.2459709292,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":338814,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7523811879283527,"acs":273787,"articleLive":2,"columnArticles":1954,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":3.7005621126,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":363894,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6953582962105072,"acs":175918,"articleLive":2,"columnArticles":1376,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":4.112736251,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":252989,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7178141619837961,"acs":233632,"articleLive":2,"columnArticles":1525,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":4.3098652761,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":325477,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3478518709511071,"acs":215856,"articleLive":2,"columnArticles":1590,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":3.8901912093,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"","submitted":620540,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4407085190867026,"acs":177249,"articleLive":2,"columnArticles":1239,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":3.6189088599,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":402191,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49367822591423605,"acs":240093,"articleLive":2,"columnArticles":1538,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":4.0353348386,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":486335,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.45300600147404624,"acs":154890,"articleLive":2,"columnArticles":1049,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":3.1062300215,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":341916,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5245508826499303,"acs":161558,"articleLive":2,"columnArticles":1625,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":3.5757410974,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":307993,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.568067916869999,"acs":146674,"articleLive":2,"columnArticles":1239,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":3.2890132741,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":258198,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.31090988870716824,"acs":77942,"articleLive":2,"columnArticles":467,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":1.8785489841,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":250690,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7457732155342274,"acs":187732,"articleLive":2,"columnArticles":1207,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":2.5579159926,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":251728,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.33782353393373504,"acs":114258,"articleLive":2,"columnArticles":716,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":1.6664902652,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":338218,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7774150361583285,"acs":141687,"articleLive":2,"columnArticles":1081,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":3.1239354746,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":182254,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5946740891244062,"acs":173269,"articleLive":2,"columnArticles":1388,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":2.8548043315,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":291368,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3740491630221686,"acs":62008,"articleLive":2,"columnArticles":420,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":2.7595095142,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":165775,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.2386864918614817,"acs":71531,"articleLive":2,"columnArticles":795,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":3.5793809063,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":299686,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6423233646219894,"acs":176549,"articleLive":2,"columnArticles":1511,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":2.6564780666,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":274860,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7894918820848189,"acs":212352,"articleLive":2,"columnArticles":2063,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":4.1658343234,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":268973,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7425534180847964,"acs":264949,"articleLive":2,"columnArticles":1730,"formTitle":"[剑指 Offer 24]反转链表","frequency":4.6539220747,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":356808,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7288297559541311,"acs":168555,"articleLive":2,"columnArticles":1107,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":3.7349189667,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":231268,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4653286941440305,"acs":130930,"articleLive":2,"columnArticles":1101,"formTitle":"[剑指 Offer 26]树的子结构","frequency":3.2594899631,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":281371,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7905579554123164,"acs":175141,"articleLive":2,"columnArticles":1314,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":3.0919231809,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":221541,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5799183387873694,"acs":135923,"articleLive":2,"columnArticles":1020,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":2.3043300274,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":234383,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.4396222865224669,"acs":135525,"articleLive":2,"columnArticles":1406,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":3.856495299,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":308276,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5741513031817512,"acs":120740,"articleLive":2,"columnArticles":820,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":2.6798280867,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":210293,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6134301163052095,"acs":103693,"articleLive":2,"columnArticles":864,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":1.9133230025,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":169038,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6463890508227114,"acs":123077,"articleLive":2,"columnArticles":878,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":3.0831585284,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":190407,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6861950142978036,"acs":124062,"articleLive":2,"columnArticles":1008,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":2.7225827467,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":180797,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5887447551679444,"acs":107201,"articleLive":2,"columnArticles":1050,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":2.7935650186,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":182084,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5485503471299319,"acs":103190,"articleLive":2,"columnArticles":884,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":2.9960329748,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":188114,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5774937381694423,"acs":120814,"articleLive":2,"columnArticles":801,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":3.179742317,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":209204,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7218565553020162,"acs":104078,"articleLive":2,"columnArticles":752,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":2.8156409703,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":144181,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6536309345449224,"acs":93798,"articleLive":2,"columnArticles":836,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":3.3833338447,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":143503,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5583888594286768,"acs":72657,"articleLive":2,"columnArticles":537,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":3.3833338447,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":130119,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5796034886696986,"acs":147199,"articleLive":2,"columnArticles":1061,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":4.538038603,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":253965,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6888735259316378,"acs":155445,"articleLive":2,"columnArticles":969,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":3.006552643,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":225651,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5690618886826071,"acs":228356,"articleLive":2,"columnArticles":1722,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":3.7421137055,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":401285,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5788841800662884,"acs":56414,"articleLive":2,"columnArticles":421,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":2.2472531963,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":97453,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6053088541464998,"acs":203227,"articleLive":2,"columnArticles":1454,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":4.4488938243,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":335741,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.48154913755997186,"acs":45869,"articleLive":2,"columnArticles":479,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":2.5693047726,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":95253,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.4125118422531593,"acs":51380,"articleLive":2,"columnArticles":431,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":2.3650835995,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":124554,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5616784982223715,"acs":97003,"articleLive":2,"columnArticles":734,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":3.3576188767,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":172702,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5394202591533382,"acs":106946,"articleLive":2,"columnArticles":1348,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":3.4452539615,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":198261,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6888920663187381,"acs":105995,"articleLive":2,"columnArticles":906,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":2.7478949817,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":153863,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46452422418167105,"acs":135498,"articleLive":2,"columnArticles":937,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":3.5285862716,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":291692,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6513963960335425,"acs":80865,"articleLive":2,"columnArticles":486,"formTitle":"[剑指 Offer 49]丑数","frequency":3.1267519812,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":124141,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.613999109540064,"acs":136527,"articleLive":2,"columnArticles":970,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":3.2029905279,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":222357,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4807471382267263,"acs":93738,"articleLive":2,"columnArticles":798,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":4.3345114086,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":194984,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6467810521159166,"acs":161075,"articleLive":2,"columnArticles":1000,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":3.3081292895,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":249041,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5405061416856478,"acs":171568,"articleLive":2,"columnArticles":1484,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":2.8852543408,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":317421,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44750959900775633,"acs":150817,"articleLive":2,"columnArticles":1370,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":2.8858945702,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":337014,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7542606917807174,"acs":148305,"articleLive":2,"columnArticles":1071,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":2.2797587667,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":196623,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7888457509682008,"acs":164173,"articleLive":2,"columnArticles":1203,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":3.1069377607,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":208118,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5862241533331151,"acs":125340,"articleLive":2,"columnArticles":874,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":2.5168562009,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":213809,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.700036795626577,"acs":106540,"articleLive":2,"columnArticles":971,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":3.0719131242,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":152192,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.7993059796252677,"acs":82462,"articleLive":2,"columnArticles":655,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":2.4498082495,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":103167,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6622293810914849,"acs":121284,"articleLive":2,"columnArticles":770,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":3.1144894118,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":183145,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7059432425511978,"acs":129578,"articleLive":2,"columnArticles":1792,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":3.1181116855,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":183553,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.440842836643758,"acs":116744,"articleLive":2,"columnArticles":885,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":2.8079952834,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":264820,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8561524487450414,"acs":184744,"articleLive":2,"columnArticles":1678,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":2.7953855179,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":215784,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44412899098110065,"acs":122175,"articleLive":2,"columnArticles":1128,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":3.675602272,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":275089,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.47412915766971264,"acs":88051,"articleLive":2,"columnArticles":1029,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":2.4688653182,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":185711,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5586459099072273,"acs":60036,"articleLive":2,"columnArticles":542,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":2.9192532337,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":107467,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.46013959403570964,"acs":91900,"articleLive":2,"columnArticles":888,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":3.2554868353,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":199722,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6547315735699228,"acs":101249,"articleLive":2,"columnArticles":717,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":3.5640038734,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":154642,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6338765561639943,"acs":115988,"articleLive":2,"columnArticles":886,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":3.1144894118,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":182982,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8565455883336678,"acs":128045,"articleLive":2,"columnArticles":1236,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":2.756107456,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":149490,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.581180878273713,"acs":64532,"articleLive":2,"columnArticles":456,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":2.155021972,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":111036,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5973226455800182,"acs":66172,"articleLive":2,"columnArticles":470,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":2.7248664523,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":110781,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.2845346959501187,"acs":62199,"articleLive":2,"columnArticles":520,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":2.6324456694,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":218599,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6930172297101309,"acs":107514,"articleLive":2,"columnArticles":633,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":2.3043300274,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":155139,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.6988867487186184,"acs":107038,"articleLive":2,"columnArticles":636,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":2.9960329748,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":153155,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.2151918197893442,"acs":2799,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.4610570293,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":13007,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5964483906770255,"acs":2687,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":4505,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.793684710351377,"acs":3343,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.4265946251,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":4212,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6986764291748803,"acs":2481,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":3551,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7217858619264159,"acs":1746,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":2419,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6761932822628167,"acs":2295,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.4966987206,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":3394,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.48523421588594706,"acs":1906,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":3928,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5281627838395754,"acs":1791,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":3391,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5632411067193676,"acs":1425,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":2530,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4406926406926407,"acs":1527,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":3465,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5835051546391753,"acs":1132,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":1940,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6739231125521075,"acs":1455,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.4610570293,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":2159,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6700468018720749,"acs":859,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":1282,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5278058645096056,"acs":1044,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":1978,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.651033386327504,"acs":819,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":1258,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.5044281863688872,"acs":1310,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":2597,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5409836065573771,"acs":693,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":1281,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5510902094912355,"acs":1289,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":2339,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.49311163895486937,"acs":1038,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":1.1218535916,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":2105,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.693069306930693,"acs":980,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":1414,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5307108350586611,"acs":1538,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":2898,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5264059377676278,"acs":1844,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":3503,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7076517150395778,"acs":1341,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.4265946251,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":1895,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7772212543554007,"acs":3569,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 024]反转链表","frequency":1.0018055493,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":4592,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6091245376078915,"acs":988,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":1.1218535916,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":1622,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6784643071385723,"acs":1131,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":1667,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6441426146010186,"acs":1897,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":2945,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.58898847631242,"acs":460,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":781,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.3067685589519651,"acs":562,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":1832,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5561224489795918,"acs":436,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":784,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.604129263913824,"acs":673,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":1114,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.5981240981240982,"acs":829,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":1386,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7902374670184696,"acs":599,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":758,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.564870259481038,"acs":566,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":1002,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.7275280898876404,"acs":518,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":712,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5742471443406023,"acs":553,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":963,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.48082901554404145,"acs":464,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":965,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7852882703777336,"acs":790,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":1006,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5417156286721504,"acs":461,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":851,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5640074211502782,"acs":304,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":539,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7986829727187206,"acs":849,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":1063,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8638676844783715,"acs":679,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":786,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6484560570071259,"acs":273,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":421,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6634980988593155,"acs":698,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":1052,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.7780401416765053,"acs":659,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":847,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7138331573389651,"acs":676,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":947,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.7133333333333334,"acs":535,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":750,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6929824561403509,"acs":395,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":570,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7478260869565218,"acs":602,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":805,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6183986371379898,"acs":363,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":587,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.42487046632124353,"acs":328,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":772,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7605042016806722,"acs":724,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.4610570293,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":952,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.646379853095488,"acs":616,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.4966987206,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":953,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8853503184713376,"acs":556,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":628,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8925,"acs":357,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":400,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7357065803667745,"acs":682,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.4966987206,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":927,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3503787878787879,"acs":185,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":528,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5751445086705202,"acs":199,"articleLive":2,"columnArticles":4,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":346,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6166902404526167,"acs":436,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":707,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6301369863013698,"acs":414,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":657,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5231143552311436,"acs":215,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":411,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7125,"acs":285,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":400,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7581967213114754,"acs":185,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":244,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6635071090047393,"acs":140,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":211,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.5664335664335665,"acs":162,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":286,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6446886446886447,"acs":176,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":273,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6830357142857143,"acs":153,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":224,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.539360872954014,"acs":692,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":1283,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7271689497716894,"acs":637,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"","submitted":876,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6986128625472888,"acs":554,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":793,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5145228215767634,"acs":124,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":241,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.441747572815534,"acs":819,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":1854,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5600739371534196,"acs":303,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":541,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5331230283911672,"acs":507,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":951,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.730379746835443,"acs":577,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":790,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6578782172002511,"acs":1048,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.4966987206,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":1593,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.523838630806846,"acs":857,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":1636,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6269230769230769,"acs":652,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":1040,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8778173190984578,"acs":740,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":843,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.7446808510638298,"acs":455,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":611,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.795551753635586,"acs":930,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":1169,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6659979939819458,"acs":664,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.4610570293,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":997,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8764976958525346,"acs":951,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.5679821033,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":1085,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.7023305084745762,"acs":663,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":944,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8813209494324046,"acs":854,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.4610570293,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":969,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7378048780487805,"acs":484,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":656,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.609167671893848,"acs":505,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":829,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7422279792746114,"acs":1146,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":1544,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6098104793756968,"acs":547,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":897,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5223048327137546,"acs":281,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":538,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7596899224806202,"acs":392,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":516,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6305309734513275,"acs":285,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":452,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5172413793103449,"acs":225,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":435,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.6,"acs":195,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":325,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6964729259811226,"acs":1402,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":1.4951320132,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":2013,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.5202020202020202,"acs":206,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":396,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5105633802816901,"acs":145,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":284,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.733102253032929,"acs":423,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":577,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6603396603396603,"acs":661,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":1.0798482563,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":1001,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7654320987654321,"acs":372,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":486,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.4651376146788991,"acs":507,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 101]分割等和子串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":1090,"title":"分割等和子串","titleSlug":"NUPfPr"},{"acceptance":0.5626373626373626,"acs":256,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":455,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.5004055150040552,"acs":617,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":1233,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5382882882882883,"acs":239,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":444,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6890547263681592,"acs":831,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.4966987206,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":1206,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.6177474402730375,"acs":181,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":293,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5311572700296736,"acs":179,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":337,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5193370165745856,"acs":94,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":181,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.5189873417721519,"acs":164,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":316,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8388520971302428,"acs":380,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":453,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.7013888888888888,"acs":101,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":144,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5799180327868853,"acs":283,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":488,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.6539325842696629,"acs":291,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":445,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.38961038961038963,"acs":90,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":231,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.2524752475247525,"acs":153,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":606,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6323440339188371,"acs":1044,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 116]朋友圈","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":1651,"title":"朋友圈","titleSlug":"bLyHh0"},{"acceptance":0.5769230769230769,"acs":135,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":234,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6556776556776557,"acs":179,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":273,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.46329426280074026,"acs":751,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.532340412,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":1621,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7214562988493742,"acs":82891,"articleLive":2,"columnArticles":1463,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":3.6908450173,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":114894,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6510059708446232,"acs":53098,"articleLive":2,"columnArticles":1036,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":2.3342186838,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":81563,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.580164864941955,"acs":40680,"articleLive":2,"columnArticles":444,"formTitle":"[面试题 01.03]URL化","frequency":1.898257939,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":70118,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.551381199285233,"acs":37645,"articleLive":2,"columnArticles":734,"formTitle":"[面试题 01.04]回文排列","frequency":2.2022005323,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":68274,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.33375239197187484,"acs":29999,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 01.05]一次编辑","frequency":2.1101109672,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":89884,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4737612920886942,"acs":69226,"articleLive":2,"columnArticles":1125,"formTitle":"[面试题 01.06]字符串压缩","frequency":3.3508740004,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":146120,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7553911827482152,"acs":61581,"articleLive":2,"columnArticles":937,"formTitle":"[面试题 01.07]旋转矩阵","frequency":2.7595095142,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":81522,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6219757440752429,"acs":40207,"articleLive":2,"columnArticles":467,"formTitle":"[面试题 01.08]零矩阵","frequency":1.9286395831,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":64644,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5518996546082531,"acs":30360,"articleLive":2,"columnArticles":392,"formTitle":"[面试题 01.09]字符串轮转","frequency":1.4623744168,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":55010,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6846675403110933,"acs":60083,"articleLive":2,"columnArticles":661,"formTitle":"[面试题 02.01]移除重复节点","frequency":2.5279119417,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":87755,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7800042422049485,"acs":62515,"articleLive":2,"columnArticles":916,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":2.7966391064,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":80147,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8540191895025036,"acs":69249,"articleLive":2,"columnArticles":663,"formTitle":"[面试题 02.03]删除中间节点","frequency":2.9672932103,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":81086,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6582081246521981,"acs":23656,"articleLive":2,"columnArticles":341,"formTitle":"[面试题 02.04]分割链表","frequency":2.4188715691,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":35940,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46691774141107617,"acs":34466,"articleLive":2,"columnArticles":501,"formTitle":"[面试题 02.05]链表求和","frequency":3.6930486321,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":73816,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.48232120534245676,"acs":36654,"articleLive":2,"columnArticles":485,"formTitle":"[面试题 02.06]回文链表","frequency":1.7815319859,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":75995,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6879373213757761,"acs":41883,"articleLive":2,"columnArticles":379,"formTitle":"[面试题 02.07]链表相交","frequency":1.1363444987,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":60882,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5302506662225184,"acs":25469,"articleLive":2,"columnArticles":273,"formTitle":"[面试题 02.08]环路检测","frequency":2.430005062,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":48032,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5428291727851199,"acs":9981,"articleLive":2,"columnArticles":160,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":18387,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6121713262913757,"acs":24283,"articleLive":2,"columnArticles":278,"formTitle":"[面试题 03.02]栈的最小值","frequency":2.121137653,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":39667,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3877509112377432,"acs":7553,"articleLive":2,"columnArticles":117,"formTitle":"[面试题 03.03]堆盘子","frequency":1.4623744168,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":19479,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7114218815152196,"acs":22180,"articleLive":2,"columnArticles":331,"formTitle":"[面试题 03.04]化栈为队","frequency":1.9600604803,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":31177,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5463844943261824,"acs":13193,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 03.05]栈排序","frequency":0.8058212079,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":24146,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5895817355908206,"acs":9994,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 03.06]动物收容所","frequency":1.4951320132,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":16951,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5346087070462214,"acs":16320,"articleLive":2,"columnArticles":228,"formTitle":"[面试题 04.01]节点间通路","frequency":1.7051051014,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":30527,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7894209911563491,"acs":33117,"articleLive":2,"columnArticles":404,"formTitle":"[面试题 04.02]最小高度树","frequency":2.5148736074,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":41951,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8058143213695644,"acs":22923,"articleLive":2,"columnArticles":502,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":1.9286395831,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":28447,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5832553702786492,"acs":31795,"articleLive":2,"columnArticles":373,"formTitle":"[面试题 04.04]检查平衡性","frequency":1.1363444987,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":54513,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35100840090156016,"acs":23983,"articleLive":2,"columnArticles":300,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":1.9286395831,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":68326,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5912813405568855,"acs":18772,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 04.06]后继者","frequency":0.8058212079,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":31748,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7170158030135979,"acs":15608,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 04.08]首个共同祖先","frequency":1.4308011549,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":21768,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47795401077635274,"acs":6298,"articleLive":2,"columnArticles":107,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":1.229022426,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":13177,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7183164824829532,"acs":15275,"articleLive":2,"columnArticles":239,"formTitle":"[面试题 04.10]检查子树","frequency":0.2507039587,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":21265,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.4883576620767094,"acs":16527,"articleLive":2,"columnArticles":246,"formTitle":"[面试题 04.12]求和路径","frequency":1.4308011549,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":33842,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5065979858779951,"acs":8753,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":17278,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6839140811455847,"acs":7164,"articleLive":2,"columnArticles":114,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.8353654542,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":10475,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.39160202627829666,"acs":9895,"articleLive":2,"columnArticles":216,"formTitle":"[面试题 05.03]翻转数位","frequency":1.8785489841,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":25268,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3948269001193792,"acs":4961,"articleLive":2,"columnArticles":129,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":12565,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5274237157203554,"acs":10924,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 05.06]整数转换","frequency":0.2768834642,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":20712,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7040423169855679,"acs":10781,"articleLive":2,"columnArticles":196,"formTitle":"[面试题 05.07]配对交换","frequency":0.8058212079,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":15313,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5538279533547406,"acs":3277,"articleLive":2,"columnArticles":68,"formTitle":"[面试题 05.08]绘制直线","frequency":1.1661086006,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":5917,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36382694702514806,"acs":40610,"articleLive":2,"columnArticles":448,"formTitle":"[面试题 08.01]三步问题","frequency":2.2417313711,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":111619,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3605659222018112,"acs":11188,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 08.02]迷路的机器人","frequency":1.7815319859,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":31029,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.676938607443615,"acs":50964,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 08.03]魔术索引","frequency":0.2768834642,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":75286,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8227916441712696,"acs":19812,"articleLive":2,"columnArticles":312,"formTitle":"[面试题 08.04]幂集","frequency":2.088441647,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":24079,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.679021547635181,"acs":20042,"articleLive":2,"columnArticles":454,"formTitle":"[面试题 08.05]递归乘法","frequency":0.2255770086,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":29516,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6550491774226895,"acs":22178,"articleLive":2,"columnArticles":251,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":2.890728767,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":33857,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.813468818489739,"acs":20414,"articleLive":2,"columnArticles":302,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":2.088441647,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":25095,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7184798947763998,"acs":15295,"articleLive":2,"columnArticles":220,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":2.088441647,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":21288,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8112078131768597,"acs":20599,"articleLive":2,"columnArticles":332,"formTitle":"[面试题 08.09]括号","frequency":3.1206394927,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":25393,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.559679386652727,"acs":12848,"articleLive":2,"columnArticles":205,"formTitle":"[面试题 08.10]颜色填充","frequency":0.7773697867,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":22956,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49481965842589276,"acs":33145,"articleLive":2,"columnArticles":320,"formTitle":"[面试题 08.11]硬币","frequency":2.4642102497,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":66984,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7582775026701621,"acs":15619,"articleLive":2,"columnArticles":282,"formTitle":"[面试题 08.12]八皇后","frequency":2.430005062,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":20598,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5015830299192655,"acs":6337,"articleLive":2,"columnArticles":86,"formTitle":"[面试题 08.13]堆箱子","frequency":0.8660803995,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":12634,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5326071580138634,"acs":3765,"articleLive":2,"columnArticles":71,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7069,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5536861675502845,"acs":54202,"articleLive":2,"columnArticles":2358,"formTitle":"[面试题 10.01]合并排序的数组","frequency":3.5360690961,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":97893,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7393844616754631,"acs":34042,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 10.02]变位词组","frequency":2.9322912281,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46041,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39692520410850674,"acs":12057,"articleLive":2,"columnArticles":199,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":2.8562159835,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":30376,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5525600772853521,"acs":18303,"articleLive":2,"columnArticles":245,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":1.1969752486,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":33124,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.45603075444497837,"acs":12337,"articleLive":2,"columnArticles":159,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":2.1704854006,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":27053,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6297613754261153,"acs":4249,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.3327171103,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":6747,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6664179104477612,"acs":7144,"articleLive":2,"columnArticles":91,"formTitle":"[面试题 10.11]峰与谷","frequency":1.9600604803,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":10720,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8326862825228171,"acs":24451,"articleLive":2,"columnArticles":388,"formTitle":"[面试题 16.01]交换数字","frequency":1.4951320132,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":29364,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.765415697996236,"acs":13828,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.02]单词频率","frequency":0.2768834642,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":18066,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44319618031175395,"acs":9468,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 16.03]交点","frequency":0.3625522588,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21363,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4610057819013043,"acs":6857,"articleLive":2,"columnArticles":151,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":14874,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46397172120003627,"acs":10238,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 16.05]阶乘尾数","frequency":1.4623744168,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":22066,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4239230388342647,"acs":11986,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 16.06]最小差","frequency":1.7051051014,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":28274,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7337952090183184,"acs":18747,"articleLive":2,"columnArticles":277,"formTitle":"[面试题 16.07]最大数值","frequency":1.8450487545,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":25548,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.37737150741635045,"acs":2188,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.3938048023,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":5798,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5468045611243701,"acs":2062,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3771,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6848860991607306,"acs":9711,"articleLive":2,"columnArticles":181,"formTitle":"[面试题 16.10]生存人数","frequency":1.1969752486,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":14179,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.441086024476553,"acs":49485,"articleLive":2,"columnArticles":571,"formTitle":"[面试题 16.11]跳水板","frequency":1.1661086006,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":112189,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4321631878557875,"acs":1822,"articleLive":2,"columnArticles":48,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4216,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5494791666666666,"acs":3376,"articleLive":2,"columnArticles":55,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6144,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.502313990744037,"acs":8466,"articleLive":2,"columnArticles":209,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.2768834642,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":16854,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4507205352547607,"acs":14012,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 16.16]部分排序","frequency":1.9600604803,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":31088,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6013174517235156,"acs":33319,"articleLive":2,"columnArticles":364,"formTitle":"[面试题 16.17]连续数列","frequency":2.121137653,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":55410,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3443440899956111,"acs":14907,"articleLive":2,"columnArticles":305,"formTitle":"[面试题 16.18]模式匹配","frequency":1.4951320132,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":43291,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.608823437451146,"acs":19472,"articleLive":2,"columnArticles":346,"formTitle":"[面试题 16.19]水域大小","frequency":2.4817853945,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":31983,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7200275410964799,"acs":8366,"articleLive":2,"columnArticles":161,"formTitle":"[面试题 16.20]T9键盘","frequency":1.4623744168,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":11619,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46488851844134194,"acs":8924,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 16.21]交换和","frequency":0.2768834642,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":19196,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5815918185860383,"acs":2616,"articleLive":2,"columnArticles":54,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.3625522588,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4498,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47027225563564573,"acs":10243,"articleLive":2,"columnArticles":151,"formTitle":"[面试题 16.24]数对和","frequency":1.1661086006,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":21781,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5436103194840258,"acs":28994,"articleLive":2,"columnArticles":246,"formTitle":"[面试题 16.25]LRU 缓存","frequency":4.2805962087,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":53336,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3863714778608396,"acs":13438,"articleLive":2,"columnArticles":190,"formTitle":"[面试题 16.26]计算器","frequency":2.9322912281,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":34780,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5991346005254211,"acs":11631,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 17.01]不用加号的加法","frequency":1.1969752486,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":19413,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6457940492224807,"acs":26371,"articleLive":2,"columnArticles":430,"formTitle":"[面试题 17.04]消失的数字","frequency":2.0263098659,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":40835,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.3855766335441132,"acs":5122,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.8980524322,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":13284,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.44693587662337664,"acs":4405,"articleLive":2,"columnArticles":102,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.2768834642,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":9856,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4115777976367789,"acs":8290,"articleLive":2,"columnArticles":210,"formTitle":"[面试题 17.07]婴儿名字","frequency":1.6719059297,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":20142,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.271703409557716,"acs":7937,"articleLive":2,"columnArticles":114,"formTitle":"[面试题 17.08]马戏团人塔","frequency":1.9133230025,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":29212,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5491654272021154,"acs":13292,"articleLive":2,"columnArticles":133,"formTitle":"[面试题 17.09]第 k 个数","frequency":2.5930995566,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":24204,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5713777638986477,"acs":65869,"articleLive":2,"columnArticles":911,"formTitle":"[面试题 17.10]主要元素","frequency":2.9505096849,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":115281,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6862696728995017,"acs":13910,"articleLive":2,"columnArticles":249,"formTitle":"[面试题 17.11]单词距离","frequency":1.7051051014,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":20269,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6319285532672261,"acs":19883,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 17.12]BiNode","frequency":0.8353654542,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":31464,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5531028165788872,"acs":24154,"articleLive":2,"columnArticles":261,"formTitle":"[面试题 17.13]恢复空格","frequency":1.4623744168,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":43670,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5473379766261363,"acs":37092,"articleLive":2,"columnArticles":416,"formTitle":"[面试题 17.14]最小K个数","frequency":3.5586576966,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"","submitted":67768,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40260610573343264,"acs":5407,"articleLive":2,"columnArticles":111,"formTitle":"[面试题 17.15]最长单词","frequency":1.4951320132,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":13430,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5195543448747033,"acs":59317,"articleLive":2,"columnArticles":1119,"formTitle":"[面试题 17.16]按摩师","frequency":2.7000389606,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":114169,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4424451858913251,"acs":7426,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 17.17]多次搜索","frequency":0.8353654542,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":16784,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4466688546110929,"acs":6805,"articleLive":2,"columnArticles":112,"formTitle":"[面试题 17.18]最短超串","frequency":0.8660803995,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":15235,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5816196284215005,"acs":8202,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 17.19]消失的两个数字","frequency":1.6089881446,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":14102,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5686910832946994,"acs":3680,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 17.20]连续中值","frequency":0.8353654542,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6471,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6351183427627444,"acs":43444,"articleLive":2,"columnArticles":527,"formTitle":"[面试题 17.21]直方图的水量","frequency":4.201939328,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":68403,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.37083389404745887,"acs":8267,"articleLive":2,"columnArticles":148,"formTitle":"[面试题 17.22]单词转换","frequency":1.9600604803,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":22293,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.38026637673280783,"acs":4197,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.3327171103,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":11037,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5137957220604986,"acs":8119,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.24]最大子矩阵","frequency":3.0002472928,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":15802,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.4933431952662722,"acs":1334,"articleLive":2,"columnArticles":37,"formTitle":"[面试题 17.25]单词矩阵","frequency":1.3331626853,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":2704,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3404187817258883,"acs":3219,"articleLive":2,"columnArticles":48,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.8980524322,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":9456,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file